./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrlen-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_d2272f80-4ef2-472d-9bbc-7f6b5a471933/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d2272f80-4ef2-472d-9bbc-7f6b5a471933/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d2272f80-4ef2-472d-9bbc-7f6b5a471933/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d2272f80-4ef2-472d-9bbc-7f6b5a471933/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrlen-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_d2272f80-4ef2-472d-9bbc-7f6b5a471933/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d2272f80-4ef2-472d-9bbc-7f6b5a471933/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 b812e7d14425eea3a24125f5e2db40eadfc6c14c ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 13:27:57,401 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:27:57,402 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:27:57,409 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:27:57,409 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:27:57,410 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:27:57,411 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:27:57,412 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:27:57,413 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:27:57,414 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:27:57,415 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:27:57,415 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:27:57,416 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:27:57,416 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:27:57,417 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:27:57,418 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:27:57,418 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:27:57,419 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:27:57,420 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:27:57,422 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:27:57,423 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:27:57,424 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:27:57,425 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:27:57,426 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:27:57,428 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:27:57,428 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:27:57,428 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:27:57,428 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:27:57,429 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:27:57,429 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:27:57,429 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:27:57,430 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:27:57,430 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:27:57,431 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:27:57,432 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:27:57,432 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:27:57,433 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:27:57,433 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:27:57,433 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:27:57,434 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:27:57,434 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:27:57,435 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d2272f80-4ef2-472d-9bbc-7f6b5a471933/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-12-07 13:27:57,446 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:27:57,447 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:27:57,448 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 13:27:57,448 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 13:27:57,448 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 13:27:57,448 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:27:57,448 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:27:57,448 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 13:27:57,449 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:27:57,449 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:27:57,449 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:27:57,449 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 13:27:57,449 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 13:27:57,449 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 13:27:57,449 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:27:57,450 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 13:27:57,450 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:27:57,450 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:27:57,450 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:27:57,450 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 13:27:57,450 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:27:57,451 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:27:57,451 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:27:57,451 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:27:57,451 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:27:57,451 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 13:27:57,451 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 13:27:57,452 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:27:57,452 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_d2272f80-4ef2-472d-9bbc-7f6b5a471933/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 -> b812e7d14425eea3a24125f5e2db40eadfc6c14c [2019-12-07 13:27:57,558 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:27:57,565 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:27:57,567 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:27:57,568 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:27:57,569 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:27:57,569 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d2272f80-4ef2-472d-9bbc-7f6b5a471933/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstrlen-alloca-1.i [2019-12-07 13:27:57,606 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d2272f80-4ef2-472d-9bbc-7f6b5a471933/bin/uautomizer/data/2fcd1709e/51dc449d26d44da298cd48e05458d9cd/FLAG9ce498292 [2019-12-07 13:27:58,055 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:27:58,055 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d2272f80-4ef2-472d-9bbc-7f6b5a471933/sv-benchmarks/c/array-memsafety/openbsd_cstrlen-alloca-1.i [2019-12-07 13:27:58,065 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d2272f80-4ef2-472d-9bbc-7f6b5a471933/bin/uautomizer/data/2fcd1709e/51dc449d26d44da298cd48e05458d9cd/FLAG9ce498292 [2019-12-07 13:27:58,073 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d2272f80-4ef2-472d-9bbc-7f6b5a471933/bin/uautomizer/data/2fcd1709e/51dc449d26d44da298cd48e05458d9cd [2019-12-07 13:27:58,075 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:27:58,076 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-07 13:27:58,076 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:27:58,076 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:27:58,079 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:27:58,079 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:27:58" (1/1) ... [2019-12-07 13:27:58,081 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a81b648 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:27:58, skipping insertion in model container [2019-12-07 13:27:58,081 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:27:58" (1/1) ... [2019-12-07 13:27:58,086 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:27:58,110 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:27:58,311 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:27:58,317 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:27:58,342 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:27:58,372 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:27:58,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:27:58 WrapperNode [2019-12-07 13:27:58,373 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:27:58,373 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:27:58,373 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:27:58,373 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:27:58,381 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:27:58" (1/1) ... [2019-12-07 13:27:58,381 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:27:58" (1/1) ... [2019-12-07 13:27:58,390 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:27:58" (1/1) ... [2019-12-07 13:27:58,391 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:27:58" (1/1) ... [2019-12-07 13:27:58,399 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:27:58" (1/1) ... [2019-12-07 13:27:58,402 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:27:58" (1/1) ... [2019-12-07 13:27:58,404 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:27:58" (1/1) ... [2019-12-07 13:27:58,408 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:27:58,408 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:27:58,408 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:27:58,408 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:27:58,409 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:27:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d2272f80-4ef2-472d-9bbc-7f6b5a471933/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-12-07 13:27:58,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-12-07 13:27:58,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:27:58,447 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-12-07 13:27:58,447 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-12-07 13:27:58,448 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-12-07 13:27:58,448 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-12-07 13:27:58,448 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-12-07 13:27:58,448 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrlen [2019-12-07 13:27:58,448 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-12-07 13:27:58,448 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-12-07 13:27:58,448 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-12-07 13:27:58,448 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-12-07 13:27:58,448 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-12-07 13:27:58,448 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-12-07 13:27:58,449 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-12-07 13:27:58,449 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-12-07 13:27:58,449 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-12-07 13:27:58,449 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-12-07 13:27:58,449 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-12-07 13:27:58,449 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-12-07 13:27:58,449 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-12-07 13:27:58,449 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-12-07 13:27:58,449 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-12-07 13:27:58,449 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-12-07 13:27:58,449 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-12-07 13:27:58,449 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-12-07 13:27:58,450 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-12-07 13:27:58,450 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-12-07 13:27:58,450 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-12-07 13:27:58,450 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-12-07 13:27:58,450 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-12-07 13:27:58,450 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-12-07 13:27:58,450 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-12-07 13:27:58,450 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-12-07 13:27:58,450 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-12-07 13:27:58,450 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-12-07 13:27:58,450 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-12-07 13:27:58,451 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-12-07 13:27:58,451 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-12-07 13:27:58,451 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-12-07 13:27:58,451 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-12-07 13:27:58,451 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-12-07 13:27:58,451 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-12-07 13:27:58,451 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-12-07 13:27:58,451 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-12-07 13:27:58,451 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-12-07 13:27:58,451 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-12-07 13:27:58,451 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-12-07 13:27:58,452 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-12-07 13:27:58,452 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-12-07 13:27:58,452 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-12-07 13:27:58,452 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-12-07 13:27:58,452 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-12-07 13:27:58,452 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-12-07 13:27:58,452 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-12-07 13:27:58,452 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-12-07 13:27:58,452 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-12-07 13:27:58,452 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-12-07 13:27:58,452 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-12-07 13:27:58,452 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-12-07 13:27:58,453 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-12-07 13:27:58,453 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-12-07 13:27:58,453 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-12-07 13:27:58,453 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-12-07 13:27:58,453 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-12-07 13:27:58,453 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-12-07 13:27:58,453 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-12-07 13:27:58,453 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-12-07 13:27:58,453 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-12-07 13:27:58,453 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-12-07 13:27:58,453 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-12-07 13:27:58,453 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-12-07 13:27:58,454 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-12-07 13:27:58,454 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-12-07 13:27:58,454 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-12-07 13:27:58,454 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-12-07 13:27:58,454 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-12-07 13:27:58,454 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-12-07 13:27:58,454 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-12-07 13:27:58,454 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-12-07 13:27:58,454 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-12-07 13:27:58,454 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-12-07 13:27:58,454 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-12-07 13:27:58,454 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-12-07 13:27:58,455 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-12-07 13:27:58,455 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-12-07 13:27:58,455 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-12-07 13:27:58,455 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-12-07 13:27:58,455 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-12-07 13:27:58,455 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-12-07 13:27:58,455 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-12-07 13:27:58,455 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-12-07 13:27:58,455 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-12-07 13:27:58,455 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-12-07 13:27:58,455 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-12-07 13:27:58,456 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-12-07 13:27:58,456 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-12-07 13:27:58,456 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-12-07 13:27:58,456 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-12-07 13:27:58,456 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-12-07 13:27:58,456 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-12-07 13:27:58,456 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-12-07 13:27:58,456 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-12-07 13:27:58,456 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-12-07 13:27:58,456 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-12-07 13:27:58,457 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-12-07 13:27:58,457 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-12-07 13:27:58,457 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-12-07 13:27:58,457 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-12-07 13:27:58,457 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-12-07 13:27:58,457 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-12-07 13:27:58,457 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-12-07 13:27:58,457 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-12-07 13:27:58,457 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-12-07 13:27:58,457 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-12-07 13:27:58,458 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-12-07 13:27:58,458 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-12-07 13:27:58,458 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-12-07 13:27:58,458 INFO L130 BoogieDeclarations]: Found specification of procedure cstrlen [2019-12-07 13:27:58,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 13:27:58,458 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-12-07 13:27:58,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 13:27:58,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 13:27:58,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 13:27:58,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-12-07 13:27:58,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:27:58,695 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:27:58,695 INFO L287 CfgBuilder]: Removed 2 assume(true) statements. [2019-12-07 13:27:58,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:27:58 BoogieIcfgContainer [2019-12-07 13:27:58,696 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:27:58,697 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:27:58,697 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:27:58,698 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:27:58,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:27:58" (1/3) ... [2019-12-07 13:27:58,699 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14d2c658 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:27:58, skipping insertion in model container [2019-12-07 13:27:58,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:27:58" (2/3) ... [2019-12-07 13:27:58,699 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14d2c658 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:27:58, skipping insertion in model container [2019-12-07 13:27:58,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:27:58" (3/3) ... [2019-12-07 13:27:58,700 INFO L109 eAbstractionObserver]: Analyzing ICFG openbsd_cstrlen-alloca-1.i [2019-12-07 13:27:58,706 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:27:58,711 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-12-07 13:27:58,718 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 13:27:58,730 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:27:58,730 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 13:27:58,730 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:27:58,730 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:27:58,730 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:27:58,730 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:27:58,730 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:27:58,730 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:27:58,740 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2019-12-07 13:27:58,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 13:27:58,745 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:58,746 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:27:58,746 INFO L410 AbstractCegarLoop]: === Iteration 1 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 13:27:58,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:58,750 INFO L82 PathProgramCache]: Analyzing trace with hash -2095006156, now seen corresponding path program 1 times [2019-12-07 13:27:58,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:58,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226909453] [2019-12-07 13:27:58,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:58,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:58,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:58,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:27:58,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226909453] [2019-12-07 13:27:58,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:58,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:27:58,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953341851] [2019-12-07 13:27:58,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:27:58,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:58,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:27:58,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:27:58,888 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 4 states. [2019-12-07 13:27:58,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:58,962 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2019-12-07 13:27:58,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:27:58,963 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 13:27:58,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:58,969 INFO L225 Difference]: With dead ends: 31 [2019-12-07 13:27:58,969 INFO L226 Difference]: Without dead ends: 28 [2019-12-07 13:27:58,970 INFO L630 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-12-07 13:27:58,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-07 13:27:58,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-12-07 13:27:58,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-07 13:27:58,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-12-07 13:27:58,993 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 10 [2019-12-07 13:27:58,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:58,993 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-12-07 13:27:58,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:27:58,993 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-12-07 13:27:58,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 13:27:58,994 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:58,994 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:27:58,994 INFO L410 AbstractCegarLoop]: === Iteration 2 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 13:27:58,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:58,994 INFO L82 PathProgramCache]: Analyzing trace with hash -2095006155, now seen corresponding path program 1 times [2019-12-07 13:27:58,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:58,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829524865] [2019-12-07 13:27:58,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:59,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:59,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:59,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:27:59,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829524865] [2019-12-07 13:27:59,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:59,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:27:59,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901763627] [2019-12-07 13:27:59,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:27:59,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:59,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:27:59,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:27:59,049 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 5 states. [2019-12-07 13:27:59,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:59,104 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2019-12-07 13:27:59,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:27:59,105 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-12-07 13:27:59,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:59,106 INFO L225 Difference]: With dead ends: 27 [2019-12-07 13:27:59,106 INFO L226 Difference]: Without dead ends: 27 [2019-12-07 13:27:59,106 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:27:59,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-12-07 13:27:59,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-12-07 13:27:59,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-12-07 13:27:59,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-12-07 13:27:59,110 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 10 [2019-12-07 13:27:59,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:59,110 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-12-07 13:27:59,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:27:59,110 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-12-07 13:27:59,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 13:27:59,111 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:59,111 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:27:59,111 INFO L410 AbstractCegarLoop]: === Iteration 3 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 13:27:59,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:59,111 INFO L82 PathProgramCache]: Analyzing trace with hash -2095006102, now seen corresponding path program 1 times [2019-12-07 13:27:59,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:59,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057342754] [2019-12-07 13:27:59,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:59,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:59,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:59,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:27:59,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057342754] [2019-12-07 13:27:59,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:59,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:27:59,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531504400] [2019-12-07 13:27:59,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:27:59,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:59,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:27:59,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:27:59,157 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 5 states. [2019-12-07 13:27:59,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:59,207 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2019-12-07 13:27:59,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:27:59,208 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-12-07 13:27:59,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:59,209 INFO L225 Difference]: With dead ends: 34 [2019-12-07 13:27:59,209 INFO L226 Difference]: Without dead ends: 34 [2019-12-07 13:27:59,210 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:27:59,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-12-07 13:27:59,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2019-12-07 13:27:59,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-12-07 13:27:59,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2019-12-07 13:27:59,216 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 10 [2019-12-07 13:27:59,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:59,216 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-12-07 13:27:59,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:27:59,216 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2019-12-07 13:27:59,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 13:27:59,217 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:59,217 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:27:59,217 INFO L410 AbstractCegarLoop]: === Iteration 4 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 13:27:59,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:59,217 INFO L82 PathProgramCache]: Analyzing trace with hash -2094946520, now seen corresponding path program 1 times [2019-12-07 13:27:59,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:59,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115549100] [2019-12-07 13:27:59,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:59,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:59,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:59,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:27:59,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115549100] [2019-12-07 13:27:59,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:59,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:27:59,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747336340] [2019-12-07 13:27:59,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:27:59,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:59,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:27:59,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:27:59,264 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 5 states. [2019-12-07 13:27:59,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:59,327 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2019-12-07 13:27:59,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:27:59,327 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-12-07 13:27:59,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:59,328 INFO L225 Difference]: With dead ends: 38 [2019-12-07 13:27:59,328 INFO L226 Difference]: Without dead ends: 38 [2019-12-07 13:27:59,328 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-12-07 13:27:59,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-12-07 13:27:59,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2019-12-07 13:27:59,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-07 13:27:59,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2019-12-07 13:27:59,331 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 10 [2019-12-07 13:27:59,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:59,332 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2019-12-07 13:27:59,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:27:59,332 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2019-12-07 13:27:59,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 13:27:59,332 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:59,332 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:27:59,332 INFO L410 AbstractCegarLoop]: === Iteration 5 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 13:27:59,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:59,333 INFO L82 PathProgramCache]: Analyzing trace with hash 2136386996, now seen corresponding path program 1 times [2019-12-07 13:27:59,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:59,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483668348] [2019-12-07 13:27:59,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:59,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:59,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:59,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:27:59,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483668348] [2019-12-07 13:27:59,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:59,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:27:59,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086613025] [2019-12-07 13:27:59,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:27:59,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:59,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:27:59,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:27:59,375 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 6 states. [2019-12-07 13:27:59,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:59,438 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2019-12-07 13:27:59,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:27:59,438 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-12-07 13:27:59,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:59,439 INFO L225 Difference]: With dead ends: 30 [2019-12-07 13:27:59,439 INFO L226 Difference]: Without dead ends: 30 [2019-12-07 13:27:59,439 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-07 13:27:59,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-12-07 13:27:59,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-12-07 13:27:59,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-07 13:27:59,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-12-07 13:27:59,442 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 13 [2019-12-07 13:27:59,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:59,443 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-12-07 13:27:59,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:27:59,443 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-12-07 13:27:59,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 13:27:59,443 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:59,443 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:27:59,443 INFO L410 AbstractCegarLoop]: === Iteration 6 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 13:27:59,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:59,444 INFO L82 PathProgramCache]: Analyzing trace with hash 2136386997, now seen corresponding path program 1 times [2019-12-07 13:27:59,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:59,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636856373] [2019-12-07 13:27:59,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:59,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:59,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:59,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:27:59,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636856373] [2019-12-07 13:27:59,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:59,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 13:27:59,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513888022] [2019-12-07 13:27:59,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 13:27:59,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:59,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 13:27:59,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 13:27:59,507 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 8 states. [2019-12-07 13:27:59,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:59,602 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2019-12-07 13:27:59,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:27:59,602 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-12-07 13:27:59,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:59,604 INFO L225 Difference]: With dead ends: 36 [2019-12-07 13:27:59,604 INFO L226 Difference]: Without dead ends: 36 [2019-12-07 13:27:59,604 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-07 13:27:59,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-12-07 13:27:59,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2019-12-07 13:27:59,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-07 13:27:59,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2019-12-07 13:27:59,608 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 13 [2019-12-07 13:27:59,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:59,608 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2019-12-07 13:27:59,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 13:27:59,608 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2019-12-07 13:27:59,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 13:27:59,609 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:59,609 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:27:59,609 INFO L410 AbstractCegarLoop]: === Iteration 7 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 13:27:59,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:59,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1041914347, now seen corresponding path program 1 times [2019-12-07 13:27:59,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:59,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636636862] [2019-12-07 13:27:59,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:59,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:59,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:59,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:27:59,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636636862] [2019-12-07 13:27:59,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54026359] [2019-12-07 13:27:59,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d2272f80-4ef2-472d-9bbc-7f6b5a471933/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-12-07 13:27:59,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:59,744 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 13:27:59,748 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:27:59,785 INFO L377 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-12-07 13:27:59,785 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:27:59,790 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:27:59,790 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:27:59,791 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-12-07 13:27:59,802 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:27:59,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:27:59,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 6 [2019-12-07 13:27:59,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562067903] [2019-12-07 13:27:59,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:27:59,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:59,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:27:59,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:27:59,804 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 7 states. [2019-12-07 13:27:59,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:59,882 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2019-12-07 13:27:59,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:27:59,882 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-12-07 13:27:59,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:59,883 INFO L225 Difference]: With dead ends: 37 [2019-12-07 13:27:59,883 INFO L226 Difference]: Without dead ends: 37 [2019-12-07 13:27:59,883 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-07 13:27:59,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-12-07 13:27:59,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2019-12-07 13:27:59,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-07 13:27:59,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-12-07 13:27:59,887 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 14 [2019-12-07 13:27:59,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:59,887 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-12-07 13:27:59,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:27:59,888 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-12-07 13:27:59,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 13:27:59,888 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:59,888 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:28:00,089 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:28:00,090 INFO L410 AbstractCegarLoop]: === Iteration 8 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 13:28:00,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:28:00,091 INFO L82 PathProgramCache]: Analyzing trace with hash -2015340679, now seen corresponding path program 1 times [2019-12-07 13:28:00,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:28:00,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769443632] [2019-12-07 13:28:00,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:28:00,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:28:00,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:28:00,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:28:00,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769443632] [2019-12-07 13:28:00,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:28:00,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 13:28:00,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055178975] [2019-12-07 13:28:00,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 13:28:00,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:28:00,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 13:28:00,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:28:00,199 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 9 states. [2019-12-07 13:28:00,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:28:00,308 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-12-07 13:28:00,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 13:28:00,308 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-12-07 13:28:00,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:28:00,309 INFO L225 Difference]: With dead ends: 39 [2019-12-07 13:28:00,309 INFO L226 Difference]: Without dead ends: 39 [2019-12-07 13:28:00,309 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-12-07 13:28:00,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-12-07 13:28:00,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2019-12-07 13:28:00,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-12-07 13:28:00,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-12-07 13:28:00,313 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 16 [2019-12-07 13:28:00,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:28:00,313 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-12-07 13:28:00,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 13:28:00,313 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2019-12-07 13:28:00,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 13:28:00,314 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:28:00,314 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:28:00,314 INFO L410 AbstractCegarLoop]: === Iteration 9 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 13:28:00,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:28:00,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1886599607, now seen corresponding path program 1 times [2019-12-07 13:28:00,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:28:00,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192548831] [2019-12-07 13:28:00,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:28:00,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:28:00,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:28:00,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:28:00,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192548831] [2019-12-07 13:28:00,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:28:00,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 13:28:00,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131995732] [2019-12-07 13:28:00,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 13:28:00,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:28:00,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 13:28:00,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-07 13:28:00,406 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 10 states. [2019-12-07 13:28:00,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:28:00,533 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2019-12-07 13:28:00,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 13:28:00,534 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-12-07 13:28:00,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:28:00,534 INFO L225 Difference]: With dead ends: 51 [2019-12-07 13:28:00,534 INFO L226 Difference]: Without dead ends: 51 [2019-12-07 13:28:00,535 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2019-12-07 13:28:00,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-12-07 13:28:00,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 37. [2019-12-07 13:28:00,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-12-07 13:28:00,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2019-12-07 13:28:00,538 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 16 [2019-12-07 13:28:00,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:28:00,538 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2019-12-07 13:28:00,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 13:28:00,538 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2019-12-07 13:28:00,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 13:28:00,538 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:28:00,539 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:28:00,539 INFO L410 AbstractCegarLoop]: === Iteration 10 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 13:28:00,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:28:00,539 INFO L82 PathProgramCache]: Analyzing trace with hash 280521542, now seen corresponding path program 1 times [2019-12-07 13:28:00,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:28:00,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142149272] [2019-12-07 13:28:00,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:28:00,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:28:00,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:28:00,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:28:00,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:28:00,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142149272] [2019-12-07 13:28:00,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:28:00,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:28:00,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020600929] [2019-12-07 13:28:00,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:28:00,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:28:00,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:28:00,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:28:00,590 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 5 states. [2019-12-07 13:28:00,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:28:00,614 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2019-12-07 13:28:00,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:28:00,614 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-07 13:28:00,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:28:00,615 INFO L225 Difference]: With dead ends: 36 [2019-12-07 13:28:00,615 INFO L226 Difference]: Without dead ends: 21 [2019-12-07 13:28:00,615 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:28:00,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-12-07 13:28:00,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-12-07 13:28:00,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-12-07 13:28:00,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-12-07 13:28:00,617 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2019-12-07 13:28:00,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:28:00,617 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-12-07 13:28:00,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:28:00,617 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-12-07 13:28:00,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 13:28:00,617 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:28:00,617 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:28:00,617 INFO L410 AbstractCegarLoop]: === Iteration 11 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 13:28:00,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:28:00,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1912442426, now seen corresponding path program 1 times [2019-12-07 13:28:00,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:28:00,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505429100] [2019-12-07 13:28:00,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:28:00,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:28:00,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:28:00,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:28:00,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505429100] [2019-12-07 13:28:00,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750959247] [2019-12-07 13:28:00,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d2272f80-4ef2-472d-9bbc-7f6b5a471933/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-12-07 13:28:00,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:28:00,746 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-07 13:28:00,748 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:28:00,804 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:28:00,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:28:00,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-12-07 13:28:00,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141167919] [2019-12-07 13:28:00,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 13:28:00,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:28:00,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 13:28:00,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-12-07 13:28:00,806 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 16 states. [2019-12-07 13:28:00,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:28:00,936 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2019-12-07 13:28:00,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 13:28:00,937 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 20 [2019-12-07 13:28:00,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:28:00,937 INFO L225 Difference]: With dead ends: 26 [2019-12-07 13:28:00,937 INFO L226 Difference]: Without dead ends: 26 [2019-12-07 13:28:00,938 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2019-12-07 13:28:00,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-12-07 13:28:00,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-12-07 13:28:00,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-07 13:28:00,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-12-07 13:28:00,939 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 20 [2019-12-07 13:28:00,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:28:00,939 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-12-07 13:28:00,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 13:28:00,940 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-12-07 13:28:00,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 13:28:00,940 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:28:00,940 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:28:01,140 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:28:01,141 INFO L410 AbstractCegarLoop]: === Iteration 12 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 13:28:01,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:28:01,142 INFO L82 PathProgramCache]: Analyzing trace with hash 831122644, now seen corresponding path program 2 times [2019-12-07 13:28:01,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:28:01,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734969603] [2019-12-07 13:28:01,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:28:01,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:28:01,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:28:01,337 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:28:01,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734969603] [2019-12-07 13:28:01,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989446963] [2019-12-07 13:28:01,337 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d2272f80-4ef2-472d-9bbc-7f6b5a471933/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-12-07 13:28:01,396 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 13:28:01,397 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 13:28:01,397 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 32 conjunts are in the unsatisfiable core [2019-12-07 13:28:01,399 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:28:01,428 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2019-12-07 13:28:01,428 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:28:01,435 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:28:01,436 INFO L534 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-12-07 13:28:01,437 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2019-12-07 13:28:01,560 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:28:01,560 INFO L377 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-12-07 13:28:01,560 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 13:28:01,567 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:28:01,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:28:01,571 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:28:01,571 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:31 [2019-12-07 13:28:01,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:28:01,659 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:28:01,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:28:01,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 21 [2019-12-07 13:28:01,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793447516] [2019-12-07 13:28:01,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-07 13:28:01,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:28:01,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 13:28:01,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2019-12-07 13:28:01,661 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 21 states. [2019-12-07 13:28:02,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:28:02,883 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2019-12-07 13:28:02,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 13:28:02,883 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 23 [2019-12-07 13:28:02,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:28:02,884 INFO L225 Difference]: With dead ends: 44 [2019-12-07 13:28:02,884 INFO L226 Difference]: Without dead ends: 36 [2019-12-07 13:28:02,885 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=186, Invalid=1220, Unknown=0, NotChecked=0, Total=1406 [2019-12-07 13:28:02,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-12-07 13:28:02,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2019-12-07 13:28:02,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-07 13:28:02,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-12-07 13:28:02,887 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 23 [2019-12-07 13:28:02,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:28:02,887 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-12-07 13:28:02,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-07 13:28:02,887 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-12-07 13:28:02,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 13:28:02,887 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:28:02,887 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:28:03,088 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:28:03,089 INFO L410 AbstractCegarLoop]: === Iteration 13 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 13:28:03,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:28:03,089 INFO L82 PathProgramCache]: Analyzing trace with hash 976723133, now seen corresponding path program 3 times [2019-12-07 13:28:03,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:28:03,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327281036] [2019-12-07 13:28:03,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:28:03,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:28:03,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:28:03,247 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:28:03,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327281036] [2019-12-07 13:28:03,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459207764] [2019-12-07 13:28:03,247 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d2272f80-4ef2-472d-9bbc-7f6b5a471933/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-12-07 13:28:03,312 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-07 13:28:03,312 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 13:28:03,313 INFO L264 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 31 conjunts are in the unsatisfiable core [2019-12-07 13:28:03,315 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:28:03,388 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2019-12-07 13:28:03,388 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:28:03,392 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:28:03,393 INFO L534 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-12-07 13:28:03,393 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-12-07 13:28:03,476 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 13:28:03,476 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:28:03,477 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:28:03,478 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:28:03,478 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-12-07 13:28:03,479 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:28:03,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:28:03,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 22 [2019-12-07 13:28:03,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210729771] [2019-12-07 13:28:03,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-07 13:28:03,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:28:03,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-07 13:28:03,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2019-12-07 13:28:03,481 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 22 states. [2019-12-07 13:28:03,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:28:03,820 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2019-12-07 13:28:03,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 13:28:03,820 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2019-12-07 13:28:03,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:28:03,821 INFO L225 Difference]: With dead ends: 49 [2019-12-07 13:28:03,821 INFO L226 Difference]: Without dead ends: 38 [2019-12-07 13:28:03,821 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=759, Unknown=0, NotChecked=0, Total=870 [2019-12-07 13:28:03,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-12-07 13:28:03,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2019-12-07 13:28:03,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-12-07 13:28:03,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-12-07 13:28:03,824 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 30 [2019-12-07 13:28:03,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:28:03,824 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-12-07 13:28:03,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-07 13:28:03,824 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-12-07 13:28:03,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 13:28:03,825 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:28:03,825 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:28:04,026 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:28:04,026 INFO L410 AbstractCegarLoop]: === Iteration 14 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 13:28:04,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:28:04,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1134145536, now seen corresponding path program 4 times [2019-12-07 13:28:04,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:28:04,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142410693] [2019-12-07 13:28:04,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:28:04,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:28:04,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:28:04,172 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:28:04,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142410693] [2019-12-07 13:28:04,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762135328] [2019-12-07 13:28:04,173 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d2272f80-4ef2-472d-9bbc-7f6b5a471933/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-12-07 13:28:04,235 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 13:28:04,235 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 13:28:04,236 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 38 conjunts are in the unsatisfiable core [2019-12-07 13:28:04,238 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:28:04,241 INFO L377 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-12-07 13:28:04,242 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:28:04,246 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:28:04,246 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:28:04,246 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-12-07 13:28:04,278 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-12-07 13:28:04,278 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:28:04,284 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:28:04,284 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:28:04,284 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-12-07 13:28:04,395 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:28:04,396 INFO L377 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 19 treesize of output 19 [2019-12-07 13:28:04,396 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 13:28:04,402 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:28:04,402 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:28:04,403 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:24 [2019-12-07 13:28:04,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:28:04,470 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:28:04,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:28:04,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 23 [2019-12-07 13:28:04,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326950766] [2019-12-07 13:28:04,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-07 13:28:04,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:28:04,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-07 13:28:04,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2019-12-07 13:28:04,471 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 24 states. [2019-12-07 13:28:04,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:28:04,903 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2019-12-07 13:28:04,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 13:28:04,903 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 34 [2019-12-07 13:28:04,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:28:04,904 INFO L225 Difference]: With dead ends: 40 [2019-12-07 13:28:04,904 INFO L226 Difference]: Without dead ends: 40 [2019-12-07 13:28:04,904 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=919, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 13:28:04,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-12-07 13:28:04,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2019-12-07 13:28:04,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-12-07 13:28:04,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-12-07 13:28:04,906 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 34 [2019-12-07 13:28:04,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:28:04,906 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-12-07 13:28:04,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-07 13:28:04,906 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-12-07 13:28:04,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 13:28:04,907 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:28:04,907 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:28:05,107 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:28:05,108 INFO L410 AbstractCegarLoop]: === Iteration 15 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 13:28:05,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:28:05,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1178045774, now seen corresponding path program 5 times [2019-12-07 13:28:05,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:28:05,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170561781] [2019-12-07 13:28:05,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:28:05,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:28:05,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:28:05,282 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 7 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:28:05,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170561781] [2019-12-07 13:28:05,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398955244] [2019-12-07 13:28:05,282 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d2272f80-4ef2-472d-9bbc-7f6b5a471933/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-12-07 13:28:05,346 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-12-07 13:28:05,346 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 13:28:05,347 INFO L264 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 39 conjunts are in the unsatisfiable core [2019-12-07 13:28:05,349 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:28:05,352 INFO L377 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-12-07 13:28:05,353 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:28:05,357 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:28:05,357 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:28:05,357 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-12-07 13:28:05,434 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-12-07 13:28:05,434 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:28:05,439 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:28:05,439 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:28:05,439 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-12-07 13:28:05,688 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:28:05,688 INFO L377 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 20 treesize of output 20 [2019-12-07 13:28:05,689 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 13:28:05,697 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:28:05,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:28:05,698 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:28:05,698 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2019-12-07 13:28:05,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:28:05,806 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:28:05,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:28:05,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 30 [2019-12-07 13:28:05,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902406765] [2019-12-07 13:28:05,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-07 13:28:05,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:28:05,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-07 13:28:05,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=806, Unknown=0, NotChecked=0, Total=870 [2019-12-07 13:28:05,808 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 30 states. [2019-12-07 13:28:07,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:28:07,366 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2019-12-07 13:28:07,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 13:28:07,367 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 37 [2019-12-07 13:28:07,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:28:07,367 INFO L225 Difference]: With dead ends: 64 [2019-12-07 13:28:07,367 INFO L226 Difference]: Without dead ends: 50 [2019-12-07 13:28:07,368 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=282, Invalid=2580, Unknown=0, NotChecked=0, Total=2862 [2019-12-07 13:28:07,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-12-07 13:28:07,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2019-12-07 13:28:07,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-12-07 13:28:07,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-12-07 13:28:07,370 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 37 [2019-12-07 13:28:07,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:28:07,370 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-12-07 13:28:07,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-07 13:28:07,371 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-12-07 13:28:07,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 13:28:07,371 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:28:07,371 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:28:07,572 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:28:07,572 INFO L410 AbstractCegarLoop]: === Iteration 16 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 13:28:07,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:28:07,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1009410243, now seen corresponding path program 6 times [2019-12-07 13:28:07,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:28:07,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290054574] [2019-12-07 13:28:07,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:28:07,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:28:07,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:28:07,793 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 9 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:28:07,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290054574] [2019-12-07 13:28:07,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540617575] [2019-12-07 13:28:07,793 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d2272f80-4ef2-472d-9bbc-7f6b5a471933/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-12-07 13:28:07,858 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2019-12-07 13:28:07,858 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 13:28:07,859 INFO L264 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 45 conjunts are in the unsatisfiable core [2019-12-07 13:28:07,861 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:28:07,963 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2019-12-07 13:28:07,963 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:28:07,967 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:28:07,968 INFO L534 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-12-07 13:28:07,968 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-12-07 13:28:08,065 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 13:28:08,066 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:28:08,067 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:28:08,067 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:28:08,067 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-12-07 13:28:08,070 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 9 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:28:08,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:28:08,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 28 [2019-12-07 13:28:08,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602442200] [2019-12-07 13:28:08,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-07 13:28:08,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:28:08,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-07 13:28:08,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=690, Unknown=0, NotChecked=0, Total=756 [2019-12-07 13:28:08,071 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 28 states. [2019-12-07 13:28:08,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:28:08,609 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2019-12-07 13:28:08,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 13:28:08,609 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 44 [2019-12-07 13:28:08,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:28:08,610 INFO L225 Difference]: With dead ends: 69 [2019-12-07 13:28:08,610 INFO L226 Difference]: Without dead ends: 52 [2019-12-07 13:28:08,610 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=139, Invalid=1267, Unknown=0, NotChecked=0, Total=1406 [2019-12-07 13:28:08,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-12-07 13:28:08,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2019-12-07 13:28:08,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-12-07 13:28:08,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-12-07 13:28:08,613 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 44 [2019-12-07 13:28:08,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:28:08,613 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-12-07 13:28:08,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-07 13:28:08,613 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-12-07 13:28:08,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 13:28:08,614 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:28:08,614 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:28:08,815 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:28:08,815 INFO L410 AbstractCegarLoop]: === Iteration 17 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 13:28:08,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:28:08,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1167106758, now seen corresponding path program 7 times [2019-12-07 13:28:08,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:28:08,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744204305] [2019-12-07 13:28:08,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:28:08,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:28:08,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:28:08,981 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 30 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:28:08,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744204305] [2019-12-07 13:28:08,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488208720] [2019-12-07 13:28:08,981 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d2272f80-4ef2-472d-9bbc-7f6b5a471933/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-12-07 13:28:09,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:28:09,042 INFO L264 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 40 conjunts are in the unsatisfiable core [2019-12-07 13:28:09,044 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:28:09,180 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 28 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:28:09,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:28:09,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 27 [2019-12-07 13:28:09,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783171675] [2019-12-07 13:28:09,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-07 13:28:09,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:28:09,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-07 13:28:09,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=654, Unknown=0, NotChecked=0, Total=756 [2019-12-07 13:28:09,182 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 28 states. [2019-12-07 13:28:09,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:28:09,550 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2019-12-07 13:28:09,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 13:28:09,550 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 48 [2019-12-07 13:28:09,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:28:09,550 INFO L225 Difference]: With dead ends: 54 [2019-12-07 13:28:09,550 INFO L226 Difference]: Without dead ends: 54 [2019-12-07 13:28:09,551 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=1092, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 13:28:09,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-12-07 13:28:09,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2019-12-07 13:28:09,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-12-07 13:28:09,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2019-12-07 13:28:09,553 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 48 [2019-12-07 13:28:09,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:28:09,553 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2019-12-07 13:28:09,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-07 13:28:09,554 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2019-12-07 13:28:09,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 13:28:09,555 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:28:09,555 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:28:09,755 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:28:09,756 INFO L410 AbstractCegarLoop]: === Iteration 18 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 13:28:09,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:28:09,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1517157576, now seen corresponding path program 8 times [2019-12-07 13:28:09,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:28:09,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626885204] [2019-12-07 13:28:09,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:28:09,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:28:09,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:28:10,003 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 11 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:28:10,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626885204] [2019-12-07 13:28:10,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798241256] [2019-12-07 13:28:10,004 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d2272f80-4ef2-472d-9bbc-7f6b5a471933/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-12-07 13:28:10,062 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 13:28:10,062 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 13:28:10,063 INFO L264 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 52 conjunts are in the unsatisfiable core [2019-12-07 13:28:10,065 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:28:10,172 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2019-12-07 13:28:10,172 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:28:10,177 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:28:10,178 INFO L534 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-12-07 13:28:10,178 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2019-12-07 13:28:10,465 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:28:10,465 INFO L377 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-12-07 13:28:10,465 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 13:28:10,472 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:28:10,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:28:10,473 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:28:10,473 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:31 [2019-12-07 13:28:10,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:28:10,590 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 28 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:28:10,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:28:10,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 37 [2019-12-07 13:28:10,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548742737] [2019-12-07 13:28:10,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-12-07 13:28:10,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:28:10,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-12-07 13:28:10,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1231, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 13:28:10,592 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 37 states. [2019-12-07 13:28:14,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:28:14,773 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2019-12-07 13:28:14,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-07 13:28:14,774 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 51 [2019-12-07 13:28:14,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:28:14,774 INFO L225 Difference]: With dead ends: 84 [2019-12-07 13:28:14,774 INFO L226 Difference]: Without dead ends: 64 [2019-12-07 13:28:14,775 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=314, Invalid=3346, Unknown=0, NotChecked=0, Total=3660 [2019-12-07 13:28:14,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-12-07 13:28:14,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2019-12-07 13:28:14,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-12-07 13:28:14,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-12-07 13:28:14,777 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 51 [2019-12-07 13:28:14,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:28:14,778 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-12-07 13:28:14,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-12-07 13:28:14,778 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-12-07 13:28:14,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 13:28:14,778 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:28:14,778 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:28:14,979 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:28:14,979 INFO L410 AbstractCegarLoop]: === Iteration 19 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 13:28:14,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:28:14,980 INFO L82 PathProgramCache]: Analyzing trace with hash 470099401, now seen corresponding path program 9 times [2019-12-07 13:28:14,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:28:14,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366555886] [2019-12-07 13:28:14,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:28:15,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:28:15,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:28:15,279 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 13 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:28:15,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366555886] [2019-12-07 13:28:15,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50168565] [2019-12-07 13:28:15,280 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d2272f80-4ef2-472d-9bbc-7f6b5a471933/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-12-07 13:28:15,353 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-12-07 13:28:15,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 13:28:15,355 INFO L264 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 55 conjunts are in the unsatisfiable core [2019-12-07 13:28:15,356 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:28:15,514 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2019-12-07 13:28:15,514 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:28:15,518 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:28:15,518 INFO L534 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-12-07 13:28:15,518 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-12-07 13:28:15,630 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 13:28:15,631 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:28:15,632 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:28:15,632 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:28:15,632 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-12-07 13:28:15,637 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 13 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:28:15,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:28:15,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 34 [2019-12-07 13:28:15,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661162350] [2019-12-07 13:28:15,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-12-07 13:28:15,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:28:15,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-12-07 13:28:15,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1042, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 13:28:15,638 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 34 states. [2019-12-07 13:28:16,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:28:16,335 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2019-12-07 13:28:16,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 13:28:16,335 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 58 [2019-12-07 13:28:16,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:28:16,335 INFO L225 Difference]: With dead ends: 89 [2019-12-07 13:28:16,336 INFO L226 Difference]: Without dead ends: 66 [2019-12-07 13:28:16,336 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=167, Invalid=1903, Unknown=0, NotChecked=0, Total=2070 [2019-12-07 13:28:16,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-12-07 13:28:16,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2019-12-07 13:28:16,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-12-07 13:28:16,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-12-07 13:28:16,339 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 58 [2019-12-07 13:28:16,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:28:16,339 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-12-07 13:28:16,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-12-07 13:28:16,339 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-12-07 13:28:16,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 13:28:16,340 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:28:16,340 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:28:16,541 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:28:16,541 INFO L410 AbstractCegarLoop]: === Iteration 20 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 13:28:16,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:28:16,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1507993228, now seen corresponding path program 10 times [2019-12-07 13:28:16,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:28:16,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570671838] [2019-12-07 13:28:16,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:28:16,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:28:16,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:28:16,790 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 68 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:28:16,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570671838] [2019-12-07 13:28:16,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004077310] [2019-12-07 13:28:16,790 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d2272f80-4ef2-472d-9bbc-7f6b5a471933/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-12-07 13:28:16,856 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 13:28:16,856 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 13:28:16,858 INFO L264 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 58 conjunts are in the unsatisfiable core [2019-12-07 13:28:16,859 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:28:16,863 INFO L377 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-12-07 13:28:16,863 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:28:16,867 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:28:16,867 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:28:16,867 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-12-07 13:28:16,897 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-12-07 13:28:16,898 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:28:16,902 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:28:16,902 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:28:16,903 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-12-07 13:28:17,163 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:28:17,163 INFO L377 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 19 treesize of output 19 [2019-12-07 13:28:17,164 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 13:28:17,170 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:28:17,170 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:28:17,170 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:24 [2019-12-07 13:28:17,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:28:17,277 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 72 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:28:17,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:28:17,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 35 [2019-12-07 13:28:17,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92135693] [2019-12-07 13:28:17,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-07 13:28:17,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:28:17,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-07 13:28:17,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1155, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 13:28:17,278 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 36 states. [2019-12-07 13:28:18,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:28:18,272 INFO L93 Difference]: Finished difference Result 68 states and 69 transitions. [2019-12-07 13:28:18,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 13:28:18,272 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 62 [2019-12-07 13:28:18,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:28:18,273 INFO L225 Difference]: With dead ends: 68 [2019-12-07 13:28:18,273 INFO L226 Difference]: Without dead ends: 68 [2019-12-07 13:28:18,273 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=231, Invalid=2121, Unknown=0, NotChecked=0, Total=2352 [2019-12-07 13:28:18,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-12-07 13:28:18,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-12-07 13:28:18,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-12-07 13:28:18,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2019-12-07 13:28:18,276 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 62 [2019-12-07 13:28:18,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:28:18,276 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2019-12-07 13:28:18,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-07 13:28:18,276 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2019-12-07 13:28:18,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 13:28:18,276 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:28:18,276 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:28:18,477 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:28:18,478 INFO L410 AbstractCegarLoop]: === Iteration 21 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 13:28:18,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:28:18,478 INFO L82 PathProgramCache]: Analyzing trace with hash -731669694, now seen corresponding path program 11 times [2019-12-07 13:28:18,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:28:18,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074456664] [2019-12-07 13:28:18,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:28:18,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:28:18,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:28:18,776 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 15 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:28:18,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074456664] [2019-12-07 13:28:18,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420556147] [2019-12-07 13:28:18,776 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d2272f80-4ef2-472d-9bbc-7f6b5a471933/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-12-07 13:28:18,850 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2019-12-07 13:28:18,850 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 13:28:18,852 INFO L264 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 61 conjunts are in the unsatisfiable core [2019-12-07 13:28:18,853 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:28:19,046 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2019-12-07 13:28:19,046 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:28:19,049 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:28:19,050 INFO L534 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-12-07 13:28:19,050 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-12-07 13:28:19,173 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 13:28:19,173 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:28:19,174 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:28:19,174 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:28:19,174 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-12-07 13:28:19,180 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 15 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:28:19,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:28:19,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 37 [2019-12-07 13:28:19,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601406367] [2019-12-07 13:28:19,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-12-07 13:28:19,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:28:19,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-12-07 13:28:19,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1245, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 13:28:19,181 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 37 states. [2019-12-07 13:28:20,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:28:20,109 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2019-12-07 13:28:20,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 13:28:20,109 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 65 [2019-12-07 13:28:20,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:28:20,110 INFO L225 Difference]: With dead ends: 99 [2019-12-07 13:28:20,110 INFO L226 Difference]: Without dead ends: 73 [2019-12-07 13:28:20,110 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=181, Invalid=2269, Unknown=0, NotChecked=0, Total=2450 [2019-12-07 13:28:20,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-12-07 13:28:20,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2019-12-07 13:28:20,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-12-07 13:28:20,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2019-12-07 13:28:20,112 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 65 [2019-12-07 13:28:20,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:28:20,113 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2019-12-07 13:28:20,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-12-07 13:28:20,113 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2019-12-07 13:28:20,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 13:28:20,113 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:28:20,113 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:28:20,314 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:28:20,314 INFO L410 AbstractCegarLoop]: === Iteration 22 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 13:28:20,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:28:20,315 INFO L82 PathProgramCache]: Analyzing trace with hash -731133665, now seen corresponding path program 12 times [2019-12-07 13:28:20,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:28:20,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783216571] [2019-12-07 13:28:20,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:28:20,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:28:20,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:28:20,593 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 93 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:28:20,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783216571] [2019-12-07 13:28:20,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035485620] [2019-12-07 13:28:20,593 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d2272f80-4ef2-472d-9bbc-7f6b5a471933/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:28:20,706 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-12-07 13:28:20,706 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 13:28:20,708 INFO L264 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 50 conjunts are in the unsatisfiable core [2019-12-07 13:28:20,709 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:28:20,712 INFO L377 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-12-07 13:28:20,713 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:28:20,716 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:28:20,716 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:28:20,716 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-12-07 13:28:21,115 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 91 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:28:21,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:28:21,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 43 [2019-12-07 13:28:21,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632657642] [2019-12-07 13:28:21,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-12-07 13:28:21,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:28:21,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-12-07 13:28:21,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=1664, Unknown=0, NotChecked=0, Total=1892 [2019-12-07 13:28:21,116 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 44 states. [2019-12-07 13:28:22,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:28:22,485 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2019-12-07 13:28:22,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 13:28:22,486 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 69 [2019-12-07 13:28:22,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:28:22,486 INFO L225 Difference]: With dead ends: 75 [2019-12-07 13:28:22,487 INFO L226 Difference]: Without dead ends: 75 [2019-12-07 13:28:22,488 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 808 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=370, Invalid=2600, Unknown=0, NotChecked=0, Total=2970 [2019-12-07 13:28:22,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-12-07 13:28:22,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-12-07 13:28:22,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-12-07 13:28:22,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-12-07 13:28:22,491 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 69 [2019-12-07 13:28:22,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:28:22,491 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-12-07 13:28:22,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-12-07 13:28:22,491 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-12-07 13:28:22,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 13:28:22,492 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:28:22,492 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:28:22,692 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:28:22,693 INFO L410 AbstractCegarLoop]: === Iteration 23 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 13:28:22,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:28:22,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1423864881, now seen corresponding path program 13 times [2019-12-07 13:28:22,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:28:22,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566321504] [2019-12-07 13:28:22,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:28:22,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:28:23,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:28:23,051 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 17 proven. 220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:28:23,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566321504] [2019-12-07 13:28:23,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365314495] [2019-12-07 13:28:23,051 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d2272f80-4ef2-472d-9bbc-7f6b5a471933/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:28:23,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:28:23,117 INFO L264 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 63 conjunts are in the unsatisfiable core [2019-12-07 13:28:23,119 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:28:23,289 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2019-12-07 13:28:23,290 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:28:23,293 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:28:23,294 INFO L534 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-12-07 13:28:23,294 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-12-07 13:28:24,424 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:28:24,425 INFO L377 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-12-07 13:28:24,425 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 13:28:24,455 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:28:24,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:28:24,458 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:28:24,458 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:31 [2019-12-07 13:28:24,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:28:24,940 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 91 proven. 146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:28:24,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:28:24,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 50 [2019-12-07 13:28:24,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103607005] [2019-12-07 13:28:24,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-12-07 13:28:24,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:28:24,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-12-07 13:28:24,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=2283, Unknown=0, NotChecked=0, Total=2450 [2019-12-07 13:28:24,942 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 50 states. [2019-12-07 13:28:35,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:28:35,439 INFO L93 Difference]: Finished difference Result 114 states and 115 transitions. [2019-12-07 13:28:35,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-07 13:28:35,439 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 72 [2019-12-07 13:28:35,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:28:35,439 INFO L225 Difference]: With dead ends: 114 [2019-12-07 13:28:35,440 INFO L226 Difference]: Without dead ends: 85 [2019-12-07 13:28:35,441 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1010 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=438, Invalid=6042, Unknown=0, NotChecked=0, Total=6480 [2019-12-07 13:28:35,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-12-07 13:28:35,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 80. [2019-12-07 13:28:35,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-12-07 13:28:35,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2019-12-07 13:28:35,443 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 72 [2019-12-07 13:28:35,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:28:35,443 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2019-12-07 13:28:35,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-12-07 13:28:35,443 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2019-12-07 13:28:35,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-07 13:28:35,444 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:28:35,444 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:28:35,645 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:28:35,645 INFO L410 AbstractCegarLoop]: === Iteration 24 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 13:28:35,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:28:35,646 INFO L82 PathProgramCache]: Analyzing trace with hash 128895164, now seen corresponding path program 14 times [2019-12-07 13:28:35,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:28:35,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573347355] [2019-12-07 13:28:35,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:28:35,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:28:36,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:28:36,063 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 19 proven. 279 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:28:36,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573347355] [2019-12-07 13:28:36,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789222853] [2019-12-07 13:28:36,064 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d2272f80-4ef2-472d-9bbc-7f6b5a471933/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:28:36,133 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 13:28:36,133 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 13:28:36,134 INFO L264 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 72 conjunts are in the unsatisfiable core [2019-12-07 13:28:36,136 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:28:36,376 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2019-12-07 13:28:36,376 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:28:36,383 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:28:36,384 INFO L534 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-12-07 13:28:36,384 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2019-12-07 13:28:36,959 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:28:36,959 INFO L377 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-12-07 13:28:36,959 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 13:28:36,965 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:28:36,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:28:36,966 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:28:36,966 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:31 [2019-12-07 13:28:37,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:28:37,124 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 120 proven. 178 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:28:37,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:28:37,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 53 [2019-12-07 13:28:37,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861781233] [2019-12-07 13:28:37,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-12-07 13:28:37,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:28:37,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-12-07 13:28:37,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=2567, Unknown=0, NotChecked=0, Total=2756 [2019-12-07 13:28:37,126 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 53 states. [2019-12-07 13:28:44,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:28:44,535 INFO L93 Difference]: Finished difference Result 124 states and 125 transitions. [2019-12-07 13:28:44,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-07 13:28:44,536 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 79 [2019-12-07 13:28:44,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:28:44,536 INFO L225 Difference]: With dead ends: 124 [2019-12-07 13:28:44,536 INFO L226 Difference]: Without dead ends: 92 [2019-12-07 13:28:44,538 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1069 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=490, Invalid=6650, Unknown=0, NotChecked=0, Total=7140 [2019-12-07 13:28:44,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-12-07 13:28:44,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 87. [2019-12-07 13:28:44,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-12-07 13:28:44,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-12-07 13:28:44,540 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 79 [2019-12-07 13:28:44,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:28:44,540 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-12-07 13:28:44,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-12-07 13:28:44,540 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-12-07 13:28:44,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 13:28:44,541 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:28:44,541 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:28:44,741 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:28:44,741 INFO L410 AbstractCegarLoop]: === Iteration 25 === [cstrlenErr1REQUIRES_VIOLATION, cstrlenErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 13:28:44,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:28:44,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1954099925, now seen corresponding path program 15 times [2019-12-07 13:28:44,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:28:44,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134584557] [2019-12-07 13:28:44,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:28:44,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:28:45,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:28:45,191 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 21 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:28:45,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134584557] [2019-12-07 13:28:45,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258190131] [2019-12-07 13:28:45,191 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d2272f80-4ef2-472d-9bbc-7f6b5a471933/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:28:45,306 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-12-07 13:28:45,306 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 13:28:45,308 INFO L264 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 51 conjunts are in the unsatisfiable core [2019-12-07 13:28:45,309 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:28:45,312 INFO L377 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-12-07 13:28:45,312 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:28:45,315 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:28:45,315 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:28:45,315 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 13:28:45,399 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-12-07 13:28:45,399 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:28:45,400 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:28:45,401 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:28:45,401 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-12-07 13:28:45,492 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:28:45,492 INFO L377 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 19 treesize of output 19 [2019-12-07 13:28:45,492 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 13:28:45,497 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:28:45,498 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:28:45,498 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2019-12-07 13:28:45,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:28:45,617 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 37 proven. 31 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2019-12-07 13:28:45,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:28:45,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 10] total 39 [2019-12-07 13:28:45,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493022961] [2019-12-07 13:28:45,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-12-07 13:28:45,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:28:45,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-12-07 13:28:45,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1402, Unknown=0, NotChecked=0, Total=1482 [2019-12-07 13:28:45,618 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 39 states. [2019-12-07 13:28:48,911 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-12-07 13:28:49,212 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-12-07 13:28:49,745 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-12-07 13:28:50,512 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2019-12-07 13:28:50,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:28:50,514 INFO L93 Difference]: Finished difference Result 128 states and 129 transitions. [2019-12-07 13:28:50,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-12-07 13:28:50,514 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 86 [2019-12-07 13:28:50,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:28:50,515 INFO L225 Difference]: With dead ends: 128 [2019-12-07 13:28:50,515 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 13:28:50,521 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2067 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=805, Invalid=9907, Unknown=0, NotChecked=0, Total=10712 [2019-12-07 13:28:50,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 13:28:50,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 13:28:50,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 13:28:50,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 13:28:50,522 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 86 [2019-12-07 13:28:50,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:28:50,523 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 13:28:50,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-12-07 13:28:50,523 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 13:28:50,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 13:28:50,724 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:28:50,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:28:50 BoogieIcfgContainer [2019-12-07 13:28:50,733 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:28:50,734 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:28:50,734 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:28:50,735 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:28:50,736 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:27:58" (3/4) ... [2019-12-07 13:28:50,743 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 13:28:50,755 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-12-07 13:28:50,755 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-12-07 13:28:50,755 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-12-07 13:28:50,755 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-12-07 13:28:50,756 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-12-07 13:28:50,756 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrlen [2019-12-07 13:28:50,756 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-12-07 13:28:50,756 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-12-07 13:28:50,758 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2019-12-07 13:28:50,758 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-12-07 13:28:50,758 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 13:28:50,759 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 13:28:50,783 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_d2272f80-4ef2-472d-9bbc-7f6b5a471933/bin/uautomizer/witness.graphml [2019-12-07 13:28:50,783 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:28:50,784 INFO L168 Benchmark]: Toolchain (without parser) took 52708.26 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 235.9 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -163.7 MB). Peak memory consumption was 72.3 MB. Max. memory is 11.5 GB. [2019-12-07 13:28:50,784 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 957.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:28:50,784 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.55 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -153.3 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-12-07 13:28:50,785 INFO L168 Benchmark]: Boogie Preprocessor took 34.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2019-12-07 13:28:50,785 INFO L168 Benchmark]: RCFGBuilder took 287.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 11.5 GB. [2019-12-07 13:28:50,785 INFO L168 Benchmark]: TraceAbstraction took 52036.61 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 131.6 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -63.1 MB). Peak memory consumption was 68.5 MB. Max. memory is 11.5 GB. [2019-12-07 13:28:50,785 INFO L168 Benchmark]: Witness Printer took 49.07 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 11.5 GB. [2019-12-07 13:28:50,786 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 957.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 296.55 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -153.3 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 287.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 52036.61 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 131.6 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -63.1 MB). Peak memory consumption was 68.5 MB. Max. memory is 11.5 GB. * Witness Printer took 49.07 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 518]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 518]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 532]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 532]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 522]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 530]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 530]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 7 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 48 locations, 7 error locations. Result: SAFE, OverallTime: 51.9s, OverallIterations: 25, TraceHistogramMax: 11, AutomataDifference: 36.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 465 SDtfs, 1530 SDslu, 3578 SDs, 0 SdLazy, 16461 SolverSat, 520 SolverUnsat, 15 SolverUnknown, 0 SolverNotchecked, 21.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1467 GetRequests, 632 SyntacticMatches, 19 SemanticMatches, 816 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7692 ImplicationChecksByTransitivity, 22.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 25 MinimizatonAttempts, 90 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 10.4s InterpolantComputationTime, 1701 NumberOfCodeBlocks, 1689 NumberOfCodeBlocksAsserted, 90 NumberOfCheckSat, 1660 ConstructedInterpolants, 112 QuantifiedInterpolants, 920778 SizeOfPredicates, 132 NumberOfNonLiveVariables, 2892 ConjunctsInSsa, 718 ConjunctsInUnsatCore, 41 InterpolantComputations, 9 PerfectInterpolantSequences, 1145/3850 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 proved your program to be correct! Received shutdown request...