./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/cstrlen-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c2fc0728-dd6a-406e-9426-6a30e3eb128a/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c2fc0728-dd6a-406e-9426-6a30e3eb128a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c2fc0728-dd6a-406e-9426-6a30e3eb128a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c2fc0728-dd6a-406e-9426-6a30e3eb128a/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/cstrlen-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_c2fc0728-dd6a-406e-9426-6a30e3eb128a/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c2fc0728-dd6a-406e-9426-6a30e3eb128a/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 a9da884533d6d47d95abcc742a22337ea753025b .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:04:50,478 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:04:50,479 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:04:50,492 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:04:50,493 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:04:50,494 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:04:50,495 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:04:50,504 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:04:50,508 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:04:50,512 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:04:50,513 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:04:50,514 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:04:50,514 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:04:50,516 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:04:50,517 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:04:50,518 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:04:50,519 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:04:50,519 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:04:50,522 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:04:50,525 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:04:50,528 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:04:50,529 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:04:50,532 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:04:50,533 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:04:50,535 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:04:50,535 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:04:50,535 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:04:50,537 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:04:50,538 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:04:50,539 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:04:50,539 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:04:50,539 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:04:50,540 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:04:50,541 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:04:50,542 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:04:50,542 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:04:50,543 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:04:50,543 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:04:50,543 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:04:50,544 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:04:50,545 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:04:50,546 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c2fc0728-dd6a-406e-9426-6a30e3eb128a/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-15 22:04:50,570 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:04:50,570 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:04:50,571 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:04:50,571 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:04:50,571 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:04:50,571 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:04:50,571 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:04:50,572 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:04:50,572 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:04:50,572 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:04:50,572 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:04:50,572 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 22:04:50,573 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 22:04:50,573 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-15 22:04:50,573 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:04:50,573 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:04:50,573 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:04:50,573 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:04:50,574 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:04:50,574 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:04:50,574 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:04:50,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:04:50,574 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:04:50,575 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:04:50,575 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:04:50,575 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:04:50,575 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_c2fc0728-dd6a-406e-9426-6a30e3eb128a/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 -> a9da884533d6d47d95abcc742a22337ea753025b [2019-11-15 22:04:50,610 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:04:50,619 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:04:50,622 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:04:50,623 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:04:50,624 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:04:50,624 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c2fc0728-dd6a-406e-9426-6a30e3eb128a/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/cstrlen-alloca-2.i [2019-11-15 22:04:50,674 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c2fc0728-dd6a-406e-9426-6a30e3eb128a/bin/uautomizer/data/497b34c0e/5b21cbbff8234ebaa25b922119811b0d/FLAG57560b7cd [2019-11-15 22:04:51,120 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:04:51,120 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c2fc0728-dd6a-406e-9426-6a30e3eb128a/sv-benchmarks/c/array-memsafety/cstrlen-alloca-2.i [2019-11-15 22:04:51,132 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c2fc0728-dd6a-406e-9426-6a30e3eb128a/bin/uautomizer/data/497b34c0e/5b21cbbff8234ebaa25b922119811b0d/FLAG57560b7cd [2019-11-15 22:04:51,461 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c2fc0728-dd6a-406e-9426-6a30e3eb128a/bin/uautomizer/data/497b34c0e/5b21cbbff8234ebaa25b922119811b0d [2019-11-15 22:04:51,463 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:04:51,464 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 22:04:51,465 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:04:51,465 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:04:51,468 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:04:51,469 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:04:51" (1/1) ... [2019-11-15 22:04:51,471 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fda6529 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:04:51, skipping insertion in model container [2019-11-15 22:04:51,472 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:04:51" (1/1) ... [2019-11-15 22:04:51,478 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:04:51,517 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:04:51,967 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:04:51,977 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:04:52,016 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:04:52,077 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:04:52,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:04:52 WrapperNode [2019-11-15 22:04:52,078 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:04:52,078 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:04:52,078 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:04:52,078 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:04:52,087 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:04:52" (1/1) ... [2019-11-15 22:04:52,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:04:52" (1/1) ... [2019-11-15 22:04:52,099 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:04:52" (1/1) ... [2019-11-15 22:04:52,100 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:04:52" (1/1) ... [2019-11-15 22:04:52,110 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:04:52" (1/1) ... [2019-11-15 22:04:52,114 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:04:52" (1/1) ... [2019-11-15 22:04:52,117 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:04:52" (1/1) ... [2019-11-15 22:04:52,123 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:04:52,123 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:04:52,123 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:04:52,123 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:04:52,124 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:04:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2fc0728-dd6a-406e-9426-6a30e3eb128a/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:04:52,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 22:04:52,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:04:52,184 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-15 22:04:52,184 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-15 22:04:52,184 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-15 22:04:52,184 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-15 22:04:52,184 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-15 22:04:52,184 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrlen [2019-11-15 22:04:52,185 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 22:04:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 22:04:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 22:04:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 22:04:52,186 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 22:04:52,186 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 22:04:52,186 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 22:04:52,187 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 22:04:52,187 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 22:04:52,187 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 22:04:52,189 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 22:04:52,189 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 22:04:52,189 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 22:04:52,190 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 22:04:52,190 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 22:04:52,190 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 22:04:52,191 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 22:04:52,191 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-15 22:04:52,191 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-15 22:04:52,192 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-15 22:04:52,193 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-15 22:04:52,193 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-15 22:04:52,193 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 22:04:52,193 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 22:04:52,193 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 22:04:52,193 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 22:04:52,193 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 22:04:52,194 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 22:04:52,194 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 22:04:52,194 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 22:04:52,194 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 22:04:52,194 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 22:04:52,194 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 22:04:52,194 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 22:04:52,195 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 22:04:52,195 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 22:04:52,195 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 22:04:52,195 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 22:04:52,197 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 22:04:52,197 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 22:04:52,198 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 22:04:52,198 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 22:04:52,198 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 22:04:52,198 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 22:04:52,198 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 22:04:52,198 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 22:04:52,198 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 22:04:52,199 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 22:04:52,199 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 22:04:52,199 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 22:04:52,199 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 22:04:52,199 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 22:04:52,199 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 22:04:52,200 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 22:04:52,200 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 22:04:52,200 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 22:04:52,200 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 22:04:52,200 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 22:04:52,200 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 22:04:52,200 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 22:04:52,200 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 22:04:52,201 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 22:04:52,201 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 22:04:52,202 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 22:04:52,202 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 22:04:52,202 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 22:04:52,203 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 22:04:52,203 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 22:04:52,203 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 22:04:52,203 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 22:04:52,204 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 22:04:52,204 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 22:04:52,205 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 22:04:52,205 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 22:04:52,205 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 22:04:52,205 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 22:04:52,205 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 22:04:52,205 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 22:04:52,205 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 22:04:52,206 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 22:04:52,206 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 22:04:52,206 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 22:04:52,207 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 22:04:52,207 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 22:04:52,207 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 22:04:52,207 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 22:04:52,207 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 22:04:52,207 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 22:04:52,207 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 22:04:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 22:04:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 22:04:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 22:04:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 22:04:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 22:04:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 22:04:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 22:04:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 22:04:52,209 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 22:04:52,209 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 22:04:52,209 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 22:04:52,209 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 22:04:52,209 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 22:04:52,209 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 22:04:52,209 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 22:04:52,209 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 22:04:52,210 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 22:04:52,210 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 22:04:52,210 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 22:04:52,210 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-15 22:04:52,210 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-15 22:04:52,211 INFO L130 BoogieDeclarations]: Found specification of procedure cstrlen [2019-11-15 22:04:52,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 22:04:52,211 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 22:04:52,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:04:52,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:04:52,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:04:52,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 22:04:52,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:04:52,641 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:04:52,641 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-15 22:04:52,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:04:52 BoogieIcfgContainer [2019-11-15 22:04:52,642 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:04:52,643 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:04:52,644 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:04:52,647 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:04:52,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:04:51" (1/3) ... [2019-11-15 22:04:52,651 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b87ee76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:04:52, skipping insertion in model container [2019-11-15 22:04:52,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:04:52" (2/3) ... [2019-11-15 22:04:52,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b87ee76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:04:52, skipping insertion in model container [2019-11-15 22:04:52,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:04:52" (3/3) ... [2019-11-15 22:04:52,654 INFO L109 eAbstractionObserver]: Analyzing ICFG cstrlen-alloca-2.i [2019-11-15 22:04:52,663 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:04:52,670 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-11-15 22:04:52,680 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-11-15 22:04:52,700 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:04:52,700 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 22:04:52,700 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:04:52,701 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:04:52,708 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:04:52,708 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:04:52,709 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:04:52,709 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:04:52,722 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-11-15 22:04:52,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 22:04:52,731 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:04:52,732 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:04:52,734 INFO L410 AbstractCegarLoop]: === Iteration 1 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2019-11-15 22:04:52,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:04:52,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1480341813, now seen corresponding path program 1 times [2019-11-15 22:04:52,746 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:04:52,746 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612734607] [2019-11-15 22:04:52,747 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:04:52,747 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:04:52,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:04:52,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:04:52,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:04:52,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:04:52,925 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612734607] [2019-11-15 22:04:52,925 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:04:52,926 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:04:52,926 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919908276] [2019-11-15 22:04:52,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:04:52,930 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:04:52,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:04:52,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:04:52,944 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 4 states. [2019-11-15 22:04:53,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:04:53,063 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-11-15 22:04:53,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:04:53,065 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-15 22:04:53,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:04:53,073 INFO L225 Difference]: With dead ends: 30 [2019-11-15 22:04:53,074 INFO L226 Difference]: Without dead ends: 27 [2019-11-15 22:04:53,075 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:04:53,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-15 22:04:53,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-15 22:04:53,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-15 22:04:53,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-11-15 22:04:53,116 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 10 [2019-11-15 22:04:53,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:04:53,117 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-11-15 22:04:53,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:04:53,117 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-11-15 22:04:53,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 22:04:53,118 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:04:53,118 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:04:53,119 INFO L410 AbstractCegarLoop]: === Iteration 2 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2019-11-15 22:04:53,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:04:53,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1480341814, now seen corresponding path program 1 times [2019-11-15 22:04:53,119 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:04:53,119 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389840923] [2019-11-15 22:04:53,120 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:04:53,120 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:04:53,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:04:53,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:04:53,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:04:53,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:04:53,221 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389840923] [2019-11-15 22:04:53,221 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:04:53,221 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:04:53,222 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857671535] [2019-11-15 22:04:53,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:04:53,223 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:04:53,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:04:53,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:04:53,223 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 5 states. [2019-11-15 22:04:53,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:04:53,306 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2019-11-15 22:04:53,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:04:53,306 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-11-15 22:04:53,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:04:53,307 INFO L225 Difference]: With dead ends: 26 [2019-11-15 22:04:53,307 INFO L226 Difference]: Without dead ends: 26 [2019-11-15 22:04:53,308 INFO L600 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-11-15 22:04:53,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-15 22:04:53,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-15 22:04:53,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-15 22:04:53,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-11-15 22:04:53,311 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 10 [2019-11-15 22:04:53,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:04:53,311 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-11-15 22:04:53,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:04:53,312 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-11-15 22:04:53,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 22:04:53,312 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:04:53,312 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:04:53,312 INFO L410 AbstractCegarLoop]: === Iteration 3 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2019-11-15 22:04:53,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:04:53,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1480341867, now seen corresponding path program 1 times [2019-11-15 22:04:53,313 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:04:53,313 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631062863] [2019-11-15 22:04:53,313 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:04:53,313 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:04:53,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:04:53,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:04:53,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:04:53,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:04:53,365 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631062863] [2019-11-15 22:04:53,365 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:04:53,365 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:04:53,365 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169694646] [2019-11-15 22:04:53,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:04:53,366 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:04:53,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:04:53,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:04:53,366 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 5 states. [2019-11-15 22:04:53,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:04:53,456 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2019-11-15 22:04:53,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:04:53,457 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-11-15 22:04:53,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:04:53,459 INFO L225 Difference]: With dead ends: 33 [2019-11-15 22:04:53,459 INFO L226 Difference]: Without dead ends: 33 [2019-11-15 22:04:53,459 INFO L600 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-11-15 22:04:53,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-15 22:04:53,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2019-11-15 22:04:53,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-15 22:04:53,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-11-15 22:04:53,475 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 10 [2019-11-15 22:04:53,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:04:53,476 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-11-15 22:04:53,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:04:53,476 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-11-15 22:04:53,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 22:04:53,478 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:04:53,479 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:04:53,479 INFO L410 AbstractCegarLoop]: === Iteration 4 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2019-11-15 22:04:53,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:04:53,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1480401449, now seen corresponding path program 1 times [2019-11-15 22:04:53,480 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:04:53,480 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671879149] [2019-11-15 22:04:53,480 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:04:53,480 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:04:53,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:04:53,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:04:53,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:04:53,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:04:53,573 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671879149] [2019-11-15 22:04:53,573 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:04:53,573 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:04:53,573 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018251196] [2019-11-15 22:04:53,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:04:53,574 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:04:53,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:04:53,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:04:53,574 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 5 states. [2019-11-15 22:04:53,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:04:53,687 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2019-11-15 22:04:53,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:04:53,687 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-11-15 22:04:53,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:04:53,688 INFO L225 Difference]: With dead ends: 37 [2019-11-15 22:04:53,688 INFO L226 Difference]: Without dead ends: 37 [2019-11-15 22:04:53,689 INFO L600 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-11-15 22:04:53,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-15 22:04:53,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2019-11-15 22:04:53,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-15 22:04:53,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-11-15 22:04:53,692 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 10 [2019-11-15 22:04:53,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:04:53,693 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-11-15 22:04:53,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:04:53,693 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-11-15 22:04:53,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-15 22:04:53,693 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:04:53,693 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:04:53,694 INFO L410 AbstractCegarLoop]: === Iteration 5 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2019-11-15 22:04:53,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:04:53,695 INFO L82 PathProgramCache]: Analyzing trace with hash 138789715, now seen corresponding path program 1 times [2019-11-15 22:04:53,696 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:04:53,696 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638254076] [2019-11-15 22:04:53,696 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:04:53,696 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:04:53,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:04:53,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:04:53,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:04:53,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:04:53,783 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638254076] [2019-11-15 22:04:53,783 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:04:53,783 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:04:53,783 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035156080] [2019-11-15 22:04:53,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:04:53,784 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:04:53,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:04:53,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:04:53,784 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 6 states. [2019-11-15 22:04:53,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:04:53,917 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2019-11-15 22:04:53,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:04:53,917 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-11-15 22:04:53,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:04:53,918 INFO L225 Difference]: With dead ends: 29 [2019-11-15 22:04:53,918 INFO L226 Difference]: Without dead ends: 29 [2019-11-15 22:04:53,919 INFO L600 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-11-15 22:04:53,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-15 22:04:53,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-11-15 22:04:53,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-15 22:04:53,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-11-15 22:04:53,923 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 13 [2019-11-15 22:04:53,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:04:53,923 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-11-15 22:04:53,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:04:53,923 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-11-15 22:04:53,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-15 22:04:53,924 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:04:53,924 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:04:53,924 INFO L410 AbstractCegarLoop]: === Iteration 6 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2019-11-15 22:04:53,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:04:53,925 INFO L82 PathProgramCache]: Analyzing trace with hash 138789716, now seen corresponding path program 1 times [2019-11-15 22:04:53,925 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:04:53,925 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748690601] [2019-11-15 22:04:53,925 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:04:53,925 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:04:53,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:04:53,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:04:54,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:04:54,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:04:54,035 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748690601] [2019-11-15 22:04:54,035 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:04:54,035 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:04:54,036 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708152883] [2019-11-15 22:04:54,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:04:54,036 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:04:54,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:04:54,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:04:54,037 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 8 states. [2019-11-15 22:04:54,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:04:54,207 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2019-11-15 22:04:54,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:04:54,208 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-11-15 22:04:54,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:04:54,210 INFO L225 Difference]: With dead ends: 34 [2019-11-15 22:04:54,210 INFO L226 Difference]: Without dead ends: 34 [2019-11-15 22:04:54,211 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-15 22:04:54,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-15 22:04:54,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2019-11-15 22:04:54,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-15 22:04:54,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-11-15 22:04:54,215 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 13 [2019-11-15 22:04:54,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:04:54,215 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-11-15 22:04:54,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:04:54,215 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-11-15 22:04:54,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 22:04:54,216 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:04:54,216 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:04:54,216 INFO L410 AbstractCegarLoop]: === Iteration 7 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2019-11-15 22:04:54,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:04:54,217 INFO L82 PathProgramCache]: Analyzing trace with hash 232930637, now seen corresponding path program 1 times [2019-11-15 22:04:54,217 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:04:54,217 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503308289] [2019-11-15 22:04:54,217 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:04:54,217 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:04:54,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:04:54,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:04:54,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:04:54,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:04:54,402 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503308289] [2019-11-15 22:04:54,402 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:04:54,402 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 22:04:54,402 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481165624] [2019-11-15 22:04:54,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 22:04:54,403 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:04:54,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:04:54,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:04:54,404 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 9 states. [2019-11-15 22:04:54,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:04:54,633 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2019-11-15 22:04:54,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:04:54,633 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-11-15 22:04:54,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:04:54,634 INFO L225 Difference]: With dead ends: 41 [2019-11-15 22:04:54,634 INFO L226 Difference]: Without dead ends: 41 [2019-11-15 22:04:54,635 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-11-15 22:04:54,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-15 22:04:54,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2019-11-15 22:04:54,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-15 22:04:54,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2019-11-15 22:04:54,640 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 15 [2019-11-15 22:04:54,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:04:54,641 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2019-11-15 22:04:54,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 22:04:54,641 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2019-11-15 22:04:54,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 22:04:54,642 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:04:54,642 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:04:54,642 INFO L410 AbstractCegarLoop]: === Iteration 8 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2019-11-15 22:04:54,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:04:54,642 INFO L82 PathProgramCache]: Analyzing trace with hash 912989007, now seen corresponding path program 1 times [2019-11-15 22:04:54,643 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:04:54,643 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131038368] [2019-11-15 22:04:54,643 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:04:54,643 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:04:54,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:04:54,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:04:54,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:04:54,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:04:54,792 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131038368] [2019-11-15 22:04:54,792 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:04:54,792 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 22:04:54,792 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640162738] [2019-11-15 22:04:54,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 22:04:54,793 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:04:54,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 22:04:54,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:04:54,793 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 10 states. [2019-11-15 22:04:55,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:04:55,041 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2019-11-15 22:04:55,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 22:04:55,042 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2019-11-15 22:04:55,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:04:55,043 INFO L225 Difference]: With dead ends: 51 [2019-11-15 22:04:55,043 INFO L226 Difference]: Without dead ends: 51 [2019-11-15 22:04:55,043 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2019-11-15 22:04:55,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-15 22:04:55,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 38. [2019-11-15 22:04:55,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-15 22:04:55,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2019-11-15 22:04:55,048 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 15 [2019-11-15 22:04:55,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:04:55,048 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2019-11-15 22:04:55,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 22:04:55,048 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2019-11-15 22:04:55,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-15 22:04:55,049 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:04:55,049 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:04:55,049 INFO L410 AbstractCegarLoop]: === Iteration 9 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2019-11-15 22:04:55,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:04:55,049 INFO L82 PathProgramCache]: Analyzing trace with hash -754029460, now seen corresponding path program 1 times [2019-11-15 22:04:55,050 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:04:55,050 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390655770] [2019-11-15 22:04:55,052 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:04:55,052 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:04:55,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:04:55,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:04:55,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:04:55,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:04:55,140 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390655770] [2019-11-15 22:04:55,140 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197419014] [2019-11-15 22:04:55,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2fc0728-dd6a-406e-9426-6a30e3eb128a/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:04:55,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:04:55,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-15 22:04:55,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:04:55,364 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 22:04:55,364 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:04:55,375 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:04:55,376 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:04:55,376 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-15 22:04:55,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:04:55,391 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:04:55,391 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 6 [2019-11-15 22:04:55,391 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003706543] [2019-11-15 22:04:55,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:04:55,392 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:04:55,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:04:55,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:04:55,392 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 7 states. [2019-11-15 22:04:55,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:04:55,486 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-11-15 22:04:55,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:04:55,486 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-11-15 22:04:55,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:04:55,487 INFO L225 Difference]: With dead ends: 42 [2019-11-15 22:04:55,487 INFO L226 Difference]: Without dead ends: 42 [2019-11-15 22:04:55,487 INFO L600 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-11-15 22:04:55,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-15 22:04:55,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2019-11-15 22:04:55,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-15 22:04:55,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2019-11-15 22:04:55,491 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 14 [2019-11-15 22:04:55,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:04:55,491 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2019-11-15 22:04:55,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:04:55,492 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2019-11-15 22:04:55,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 22:04:55,492 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:04:55,492 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:04:55,696 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:04:55,696 INFO L410 AbstractCegarLoop]: === Iteration 10 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2019-11-15 22:04:55,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:04:55,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1444358493, now seen corresponding path program 1 times [2019-11-15 22:04:55,696 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:04:55,697 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375408686] [2019-11-15 22:04:55,697 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:04:55,697 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:04:55,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:04:55,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:04:55,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:04:55,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:04:55,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:04:55,759 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375408686] [2019-11-15 22:04:55,759 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:04:55,759 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:04:55,759 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758265314] [2019-11-15 22:04:55,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:04:55,760 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:04:55,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:04:55,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:04:55,760 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 5 states. [2019-11-15 22:04:55,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:04:55,816 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2019-11-15 22:04:55,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:04:55,816 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-15 22:04:55,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:04:55,817 INFO L225 Difference]: With dead ends: 35 [2019-11-15 22:04:55,817 INFO L226 Difference]: Without dead ends: 20 [2019-11-15 22:04:55,817 INFO L600 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-11-15 22:04:55,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-11-15 22:04:55,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-15 22:04:55,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-15 22:04:55,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-11-15 22:04:55,819 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 19 [2019-11-15 22:04:55,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:04:55,820 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-11-15 22:04:55,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:04:55,820 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-11-15 22:04:55,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 22:04:55,821 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:04:55,821 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:04:55,821 INFO L410 AbstractCegarLoop]: === Iteration 11 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2019-11-15 22:04:55,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:04:55,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1892891924, now seen corresponding path program 1 times [2019-11-15 22:04:55,821 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:04:55,821 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575163127] [2019-11-15 22:04:55,821 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:04:55,822 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:04:55,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:04:55,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:04:55,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:04:55,945 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:04:55,945 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575163127] [2019-11-15 22:04:55,945 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707322537] [2019-11-15 22:04:55,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2fc0728-dd6a-406e-9426-6a30e3eb128a/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:04:56,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:04:56,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-15 22:04:56,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:04:56,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:04:56,170 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:04:56,170 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-11-15 22:04:56,170 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922858893] [2019-11-15 22:04:56,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 22:04:56,170 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:04:56,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 22:04:56,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-11-15 22:04:56,171 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 16 states. [2019-11-15 22:04:56,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:04:56,381 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-11-15 22:04:56,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:04:56,382 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 19 [2019-11-15 22:04:56,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:04:56,382 INFO L225 Difference]: With dead ends: 23 [2019-11-15 22:04:56,382 INFO L226 Difference]: Without dead ends: 23 [2019-11-15 22:04:56,383 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2019-11-15 22:04:56,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-15 22:04:56,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-11-15 22:04:56,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-15 22:04:56,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2019-11-15 22:04:56,385 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 19 [2019-11-15 22:04:56,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:04:56,385 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2019-11-15 22:04:56,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 22:04:56,386 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2019-11-15 22:04:56,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 22:04:56,386 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:04:56,386 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:04:56,592 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:04:56,592 INFO L410 AbstractCegarLoop]: === Iteration 12 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2019-11-15 22:04:56,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:04:56,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1996994277, now seen corresponding path program 2 times [2019-11-15 22:04:56,592 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:04:56,592 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155515870] [2019-11-15 22:04:56,592 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:04:56,592 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:04:56,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:04:56,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:04:56,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:04:56,901 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:04:56,902 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155515870] [2019-11-15 22:04:56,902 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215818368] [2019-11-15 22:04:56,902 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2fc0728-dd6a-406e-9426-6a30e3eb128a/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:04:57,004 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:04:57,005 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:04:57,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-15 22:04:57,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:04:57,077 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2019-11-15 22:04:57,077 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:04:57,081 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:04:57,082 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:04:57,082 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-11-15 22:04:57,237 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:04:57,237 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2019-11-15 22:04:57,237 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 22:04:57,248 INFO L567 ElimStorePlain]: treesize reduction 8, result has 55.6 percent of original size [2019-11-15 22:04:57,249 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:04:57,249 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:24, output treesize:3 [2019-11-15 22:04:57,272 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:04:57,273 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:04:57,273 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2019-11-15 22:04:57,273 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433636150] [2019-11-15 22:04:57,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-15 22:04:57,274 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:04:57,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-15 22:04:57,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2019-11-15 22:04:57,274 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 21 states. [2019-11-15 22:04:57,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:04:57,693 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2019-11-15 22:04:57,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 22:04:57,694 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-11-15 22:04:57,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:04:57,694 INFO L225 Difference]: With dead ends: 36 [2019-11-15 22:04:57,694 INFO L226 Difference]: Without dead ends: 29 [2019-11-15 22:04:57,695 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=123, Invalid=747, Unknown=0, NotChecked=0, Total=870 [2019-11-15 22:04:57,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-15 22:04:57,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2019-11-15 22:04:57,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-15 22:04:57,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-11-15 22:04:57,697 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 21 [2019-11-15 22:04:57,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:04:57,697 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-11-15 22:04:57,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-15 22:04:57,697 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-11-15 22:04:57,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-15 22:04:57,697 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:04:57,697 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:04:57,898 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:04:57,898 INFO L410 AbstractCegarLoop]: === Iteration 13 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2019-11-15 22:04:57,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:04:57,898 INFO L82 PathProgramCache]: Analyzing trace with hash 484603074, now seen corresponding path program 3 times [2019-11-15 22:04:57,898 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:04:57,899 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465384818] [2019-11-15 22:04:57,899 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:04:57,899 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:04:57,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:04:57,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:04:58,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:04:58,042 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:04:58,042 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465384818] [2019-11-15 22:04:58,042 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027302082] [2019-11-15 22:04:58,042 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2fc0728-dd6a-406e-9426-6a30e3eb128a/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:04:58,160 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-15 22:04:58,160 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:04:58,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-15 22:04:58,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:04:58,275 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:04:58,275 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:04:58,275 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2019-11-15 22:04:58,276 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109973173] [2019-11-15 22:04:58,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-15 22:04:58,276 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:04:58,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-15 22:04:58,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-11-15 22:04:58,277 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 18 states. [2019-11-15 22:04:58,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:04:58,532 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2019-11-15 22:04:58,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 22:04:58,533 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 25 [2019-11-15 22:04:58,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:04:58,533 INFO L225 Difference]: With dead ends: 29 [2019-11-15 22:04:58,533 INFO L226 Difference]: Without dead ends: 29 [2019-11-15 22:04:58,534 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2019-11-15 22:04:58,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-15 22:04:58,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-11-15 22:04:58,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-15 22:04:58,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2019-11-15 22:04:58,537 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 25 [2019-11-15 22:04:58,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:04:58,537 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-11-15 22:04:58,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-15 22:04:58,537 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2019-11-15 22:04:58,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 22:04:58,538 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:04:58,538 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:04:58,746 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:04:58,747 INFO L410 AbstractCegarLoop]: === Iteration 14 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2019-11-15 22:04:58,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:04:58,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1847085883, now seen corresponding path program 4 times [2019-11-15 22:04:58,747 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:04:58,747 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501650270] [2019-11-15 22:04:58,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:04:58,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:04:58,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:04:58,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:04:58,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:04:58,947 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:04:58,947 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501650270] [2019-11-15 22:04:58,948 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318077173] [2019-11-15 22:04:58,948 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2fc0728-dd6a-406e-9426-6a30e3eb128a/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:04:59,048 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 22:04:59,048 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:04:59,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-15 22:04:59,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:04:59,061 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 22:04:59,062 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:04:59,067 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:04:59,067 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:04:59,068 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-15 22:04:59,149 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-11-15 22:04:59,149 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:04:59,153 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:04:59,153 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:04:59,153 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-11-15 22:04:59,318 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2019-11-15 22:04:59,319 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:04:59,327 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:04:59,332 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:04:59,333 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:04:59,334 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2019-11-15 22:04:59,334 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:04:59,339 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:04:59,340 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:04:59,340 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:3 [2019-11-15 22:04:59,342 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:04:59,342 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:04:59,342 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2019-11-15 22:04:59,342 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219519561] [2019-11-15 22:04:59,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-15 22:04:59,343 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:04:59,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-15 22:04:59,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2019-11-15 22:04:59,344 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 24 states. [2019-11-15 22:04:59,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:04:59,855 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2019-11-15 22:04:59,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 22:04:59,856 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 27 [2019-11-15 22:04:59,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:04:59,856 INFO L225 Difference]: With dead ends: 44 [2019-11-15 22:04:59,856 INFO L226 Difference]: Without dead ends: 35 [2019-11-15 22:04:59,857 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=144, Invalid=1046, Unknown=0, NotChecked=0, Total=1190 [2019-11-15 22:04:59,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-15 22:04:59,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2019-11-15 22:04:59,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-15 22:04:59,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-11-15 22:04:59,860 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 27 [2019-11-15 22:04:59,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:04:59,860 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-11-15 22:04:59,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-15 22:04:59,860 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-11-15 22:04:59,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 22:04:59,861 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:04:59,861 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:05:00,062 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:05:00,062 INFO L410 AbstractCegarLoop]: === Iteration 15 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2019-11-15 22:05:00,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:05:00,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1827827544, now seen corresponding path program 5 times [2019-11-15 22:05:00,062 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:05:00,062 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473871536] [2019-11-15 22:05:00,062 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:05:00,062 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:05:00,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:05:00,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:05:00,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:05:00,254 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:05:00,254 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473871536] [2019-11-15 22:05:00,255 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673005571] [2019-11-15 22:05:00,255 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2fc0728-dd6a-406e-9426-6a30e3eb128a/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:05:00,345 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-11-15 22:05:00,345 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:05:00,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-15 22:05:00,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:05:00,354 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 22:05:00,354 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:05:00,359 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:05:00,359 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:05:00,359 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-15 22:05:00,564 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:05:00,565 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:05:00,565 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 23 [2019-11-15 22:05:00,565 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990094525] [2019-11-15 22:05:00,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-15 22:05:00,565 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:05:00,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-15 22:05:00,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2019-11-15 22:05:00,566 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 24 states. [2019-11-15 22:05:00,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:05:00,894 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2019-11-15 22:05:00,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 22:05:00,894 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 31 [2019-11-15 22:05:00,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:05:00,895 INFO L225 Difference]: With dead ends: 35 [2019-11-15 22:05:00,895 INFO L226 Difference]: Without dead ends: 35 [2019-11-15 22:05:00,896 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=746, Unknown=0, NotChecked=0, Total=870 [2019-11-15 22:05:00,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-15 22:05:00,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-11-15 22:05:00,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-15 22:05:00,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2019-11-15 22:05:00,898 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 31 [2019-11-15 22:05:00,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:05:00,899 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2019-11-15 22:05:00,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-15 22:05:00,899 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2019-11-15 22:05:00,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 22:05:00,900 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:05:00,900 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:05:01,100 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:05:01,100 INFO L410 AbstractCegarLoop]: === Iteration 16 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2019-11-15 22:05:01,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:05:01,101 INFO L82 PathProgramCache]: Analyzing trace with hash -99354543, now seen corresponding path program 6 times [2019-11-15 22:05:01,101 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:05:01,101 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906942394] [2019-11-15 22:05:01,101 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:05:01,101 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:05:01,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:05:01,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:05:01,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:05:01,337 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:05:01,337 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906942394] [2019-11-15 22:05:01,337 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547362398] [2019-11-15 22:05:01,337 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2fc0728-dd6a-406e-9426-6a30e3eb128a/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:05:01,447 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-11-15 22:05:01,447 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:05:01,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-15 22:05:01,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:05:01,562 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2019-11-15 22:05:01,563 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:05:01,567 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:05:01,568 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:05:01,568 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-11-15 22:05:01,682 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-15 22:05:01,683 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:05:01,684 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:05:01,685 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:05:01,685 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-15 22:05:01,688 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:05:01,688 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:05:01,689 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 25 [2019-11-15 22:05:01,689 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698469010] [2019-11-15 22:05:01,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-15 22:05:01,689 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:05:01,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-15 22:05:01,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2019-11-15 22:05:01,690 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 25 states. [2019-11-15 22:05:02,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:05:02,221 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2019-11-15 22:05:02,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 22:05:02,222 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 33 [2019-11-15 22:05:02,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:05:02,222 INFO L225 Difference]: With dead ends: 52 [2019-11-15 22:05:02,222 INFO L226 Difference]: Without dead ends: 41 [2019-11-15 22:05:02,223 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=125, Invalid=997, Unknown=0, NotChecked=0, Total=1122 [2019-11-15 22:05:02,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-15 22:05:02,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2019-11-15 22:05:02,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-15 22:05:02,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-11-15 22:05:02,226 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 33 [2019-11-15 22:05:02,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:05:02,226 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-11-15 22:05:02,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-15 22:05:02,226 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-11-15 22:05:02,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-15 22:05:02,227 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:05:02,227 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:05:02,430 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:05:02,430 INFO L410 AbstractCegarLoop]: === Iteration 17 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2019-11-15 22:05:02,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:05:02,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1272435374, now seen corresponding path program 7 times [2019-11-15 22:05:02,431 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:05:02,431 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335461471] [2019-11-15 22:05:02,431 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:05:02,431 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:05:02,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:05:02,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:05:02,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:05:02,665 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 17 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:05:02,665 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335461471] [2019-11-15 22:05:02,665 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104333357] [2019-11-15 22:05:02,666 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2fc0728-dd6a-406e-9426-6a30e3eb128a/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:05:02,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:05:02,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-15 22:05:02,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:05:02,994 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:05:02,994 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:05:02,994 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 24 [2019-11-15 22:05:02,995 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477321344] [2019-11-15 22:05:02,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-15 22:05:02,995 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:05:02,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-15 22:05:02,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2019-11-15 22:05:02,996 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 25 states. [2019-11-15 22:05:03,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:05:03,421 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2019-11-15 22:05:03,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 22:05:03,421 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 37 [2019-11-15 22:05:03,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:05:03,422 INFO L225 Difference]: With dead ends: 41 [2019-11-15 22:05:03,422 INFO L226 Difference]: Without dead ends: 41 [2019-11-15 22:05:03,422 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=139, Invalid=853, Unknown=0, NotChecked=0, Total=992 [2019-11-15 22:05:03,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-15 22:05:03,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-11-15 22:05:03,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-15 22:05:03,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2019-11-15 22:05:03,425 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 37 [2019-11-15 22:05:03,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:05:03,425 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2019-11-15 22:05:03,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-15 22:05:03,426 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2019-11-15 22:05:03,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 22:05:03,426 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:05:03,427 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:05:03,632 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:05:03,632 INFO L410 AbstractCegarLoop]: === Iteration 18 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2019-11-15 22:05:03,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:05:03,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1255285209, now seen corresponding path program 8 times [2019-11-15 22:05:03,632 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:05:03,633 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123410449] [2019-11-15 22:05:03,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:05:03,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:05:03,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:05:03,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:05:03,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:05:03,885 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 5 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:05:03,885 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123410449] [2019-11-15 22:05:03,885 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552342350] [2019-11-15 22:05:03,886 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2fc0728-dd6a-406e-9426-6a30e3eb128a/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:05:03,982 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:05:03,982 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:05:03,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 43 conjunts are in the unsatisfiable core [2019-11-15 22:05:03,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:05:04,139 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2019-11-15 22:05:04,140 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:05:04,144 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:05:04,144 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:05:04,145 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-11-15 22:05:04,289 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-15 22:05:04,290 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:05:04,291 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:05:04,291 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:05:04,291 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-15 22:05:04,294 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 5 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:05:04,294 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:05:04,294 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 28 [2019-11-15 22:05:04,294 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084532954] [2019-11-15 22:05:04,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-15 22:05:04,294 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:05:04,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-15 22:05:04,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=690, Unknown=0, NotChecked=0, Total=756 [2019-11-15 22:05:04,295 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 28 states. [2019-11-15 22:05:04,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:05:04,978 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2019-11-15 22:05:04,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 22:05:04,978 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 39 [2019-11-15 22:05:04,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:05:04,979 INFO L225 Difference]: With dead ends: 60 [2019-11-15 22:05:04,979 INFO L226 Difference]: Without dead ends: 47 [2019-11-15 22:05:04,980 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=139, Invalid=1267, Unknown=0, NotChecked=0, Total=1406 [2019-11-15 22:05:04,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-15 22:05:04,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2019-11-15 22:05:04,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-15 22:05:04,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-11-15 22:05:04,982 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 39 [2019-11-15 22:05:04,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:05:04,982 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-11-15 22:05:04,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-15 22:05:04,983 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-11-15 22:05:04,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-15 22:05:04,984 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:05:04,984 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:05:05,184 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:05:05,185 INFO L410 AbstractCegarLoop]: === Iteration 19 === [cstrlenErr0REQUIRES_VIOLATION, cstrlenErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2019-11-15 22:05:05,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:05:05,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1362510140, now seen corresponding path program 9 times [2019-11-15 22:05:05,185 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:05:05,185 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125150867] [2019-11-15 22:05:05,185 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:05:05,185 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:05:05,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:05:05,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:05:05,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:05:05,432 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 30 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:05:05,432 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125150867] [2019-11-15 22:05:05,432 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473583357] [2019-11-15 22:05:05,432 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2fc0728-dd6a-406e-9426-6a30e3eb128a/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:05:05,560 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-11-15 22:05:05,561 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:05:05,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-15 22:05:05,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:05:05,570 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 22:05:05,571 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:05:05,575 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:05:05,575 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:05:05,575 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-15 22:05:05,598 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-15 22:05:05,598 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:05:05,604 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:05:05,604 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:05:05,604 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2019-11-15 22:05:05,705 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:05:05,706 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2019-11-15 22:05:05,706 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 22:05:05,716 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:05:05,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:05:05,718 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:05:05,718 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:27 [2019-11-15 22:05:05,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:05:05,797 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-11-15 22:05:05,798 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:05:05,798 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 7] total 23 [2019-11-15 22:05:05,798 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088392845] [2019-11-15 22:05:05,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-15 22:05:05,798 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:05:05,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-15 22:05:05,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2019-11-15 22:05:05,799 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 24 states. [2019-11-15 22:05:06,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:05:06,486 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2019-11-15 22:05:06,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 22:05:06,487 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 43 [2019-11-15 22:05:06,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:05:06,487 INFO L225 Difference]: With dead ends: 44 [2019-11-15 22:05:06,487 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 22:05:06,488 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=177, Invalid=945, Unknown=0, NotChecked=0, Total=1122 [2019-11-15 22:05:06,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 22:05:06,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 22:05:06,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 22:05:06,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 22:05:06,488 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2019-11-15 22:05:06,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:05:06,489 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:05:06,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-15 22:05:06,489 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:05:06,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 22:05:06,689 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:05:06,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:05:06 BoogieIcfgContainer [2019-11-15 22:05:06,693 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 22:05:06,693 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:05:06,693 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:05:06,693 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:05:06,694 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:04:52" (3/4) ... [2019-11-15 22:05:06,696 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 22:05:06,702 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-15 22:05:06,702 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-15 22:05:06,702 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-15 22:05:06,702 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-11-15 22:05:06,702 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-11-15 22:05:06,702 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrlen [2019-11-15 22:05:06,702 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-15 22:05:06,702 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-11-15 22:05:06,706 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2019-11-15 22:05:06,706 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-15 22:05:06,706 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-15 22:05:06,738 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_c2fc0728-dd6a-406e-9426-6a30e3eb128a/bin/uautomizer/witness.graphml [2019-11-15 22:05:06,738 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:05:06,739 INFO L168 Benchmark]: Toolchain (without parser) took 15275.12 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 360.7 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -191.2 MB). Peak memory consumption was 169.5 MB. Max. memory is 11.5 GB. [2019-11-15 22:05:06,739 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:05:06,740 INFO L168 Benchmark]: CACSL2BoogieTranslator took 612.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -179.7 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:05:06,740 INFO L168 Benchmark]: Boogie Preprocessor took 44.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-15 22:05:06,741 INFO L168 Benchmark]: RCFGBuilder took 519.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:05:06,742 INFO L168 Benchmark]: TraceAbstraction took 14049.43 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 223.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -73.3 MB). Peak memory consumption was 150.6 MB. Max. memory is 11.5 GB. [2019-11-15 22:05:06,742 INFO L168 Benchmark]: Witness Printer took 45.01 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:05:06,744 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 612.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -179.7 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 519.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14049.43 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 223.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -73.3 MB). Peak memory consumption was 150.6 MB. Max. memory is 11.5 GB. * Witness Printer took 45.01 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 516]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 516]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 529]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 529]: 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: 520]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 532]: 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, 47 locations, 7 error locations. Result: SAFE, OverallTime: 13.9s, OverallIterations: 19, TraceHistogramMax: 5, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 282 SDtfs, 659 SDslu, 1119 SDs, 0 SdLazy, 3766 SolverSat, 220 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 579 GetRequests, 247 SyntacticMatches, 8 SemanticMatches, 324 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1272 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=18, 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, 19 MinimizatonAttempts, 54 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 693 NumberOfCodeBlocks, 690 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 664 ConstructedInterpolants, 24 QuantifiedInterpolants, 148015 SizeOfPredicates, 77 NumberOfNonLiveVariables, 1248 ConjunctsInSsa, 289 ConjunctsInUnsatCore, 29 InterpolantComputations, 9 PerfectInterpolantSequences, 178/514 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...