./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrcmp-alloca-1.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_b55077e7-56fe-4ddb-adad-612452c1bc30/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b55077e7-56fe-4ddb-adad-612452c1bc30/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b55077e7-56fe-4ddb-adad-612452c1bc30/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b55077e7-56fe-4ddb-adad-612452c1bc30/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrcmp-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_b55077e7-56fe-4ddb-adad-612452c1bc30/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b55077e7-56fe-4ddb-adad-612452c1bc30/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 f68b319d77fa756392ca29e618a1e0accd9b6c9e .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:31:54,668 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:31:54,669 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:31:54,685 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:31:54,685 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:31:54,687 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:31:54,689 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:31:54,698 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:31:54,702 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:31:54,707 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:31:54,708 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:31:54,709 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:31:54,709 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:31:54,711 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:31:54,712 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:31:54,713 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:31:54,714 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:31:54,714 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:31:54,717 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:31:54,720 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:31:54,723 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:31:54,725 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:31:54,727 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:31:54,729 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:31:54,733 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:31:54,734 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:31:54,734 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:31:54,735 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:31:54,736 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:31:54,736 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:31:54,737 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:31:54,737 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:31:54,738 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:31:54,738 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:31:54,740 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:31:54,740 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:31:54,741 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:31:54,741 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:31:54,741 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:31:54,742 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:31:54,742 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:31:54,743 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b55077e7-56fe-4ddb-adad-612452c1bc30/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-16 00:31:54,768 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:31:54,769 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:31:54,770 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:31:54,770 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:31:54,770 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:31:54,770 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:31:54,771 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:31:54,771 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:31:54,771 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:31:54,771 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:31:54,771 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:31:54,772 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-16 00:31:54,772 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-16 00:31:54,772 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-16 00:31:54,772 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:31:54,772 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:31:54,773 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:31:54,773 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:31:54,773 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:31:54,773 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:31:54,774 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:31:54,774 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:31:54,774 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:31:54,774 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:31:54,774 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:31:54,775 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:31:54,775 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_b55077e7-56fe-4ddb-adad-612452c1bc30/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 -> f68b319d77fa756392ca29e618a1e0accd9b6c9e [2019-11-16 00:31:54,820 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:31:54,836 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:31:54,841 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:31:54,842 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:31:54,843 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:31:54,843 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b55077e7-56fe-4ddb-adad-612452c1bc30/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstrcmp-alloca-1.i [2019-11-16 00:31:54,904 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b55077e7-56fe-4ddb-adad-612452c1bc30/bin/uautomizer/data/467819c95/78c18a385337423495f820f84786e1fb/FLAG0cb63f5e7 [2019-11-16 00:31:55,295 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:31:55,296 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b55077e7-56fe-4ddb-adad-612452c1bc30/sv-benchmarks/c/array-memsafety/openbsd_cstrcmp-alloca-1.i [2019-11-16 00:31:55,307 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b55077e7-56fe-4ddb-adad-612452c1bc30/bin/uautomizer/data/467819c95/78c18a385337423495f820f84786e1fb/FLAG0cb63f5e7 [2019-11-16 00:31:55,641 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b55077e7-56fe-4ddb-adad-612452c1bc30/bin/uautomizer/data/467819c95/78c18a385337423495f820f84786e1fb [2019-11-16 00:31:55,644 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:31:55,645 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-16 00:31:55,646 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:31:55,646 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:31:55,653 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:31:55,654 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:31:55" (1/1) ... [2019-11-16 00:31:55,657 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77cc66d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:55, skipping insertion in model container [2019-11-16 00:31:55,657 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:31:55" (1/1) ... [2019-11-16 00:31:55,665 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:31:55,721 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:31:56,099 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:31:56,108 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:31:56,147 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:31:56,193 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:31:56,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:56 WrapperNode [2019-11-16 00:31:56,193 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:31:56,194 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:31:56,194 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:31:56,194 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:31:56,207 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:56" (1/1) ... [2019-11-16 00:31:56,207 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:56" (1/1) ... [2019-11-16 00:31:56,220 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:56" (1/1) ... [2019-11-16 00:31:56,221 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:56" (1/1) ... [2019-11-16 00:31:56,238 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:56" (1/1) ... [2019-11-16 00:31:56,242 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:56" (1/1) ... [2019-11-16 00:31:56,245 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:56" (1/1) ... [2019-11-16 00:31:56,264 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:31:56,265 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:31:56,265 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:31:56,265 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:31:56,273 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b55077e7-56fe-4ddb-adad-612452c1bc30/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-16 00:31:56,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-16 00:31:56,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:31:56,329 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-16 00:31:56,330 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-16 00:31:56,330 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-16 00:31:56,330 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-16 00:31:56,330 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-16 00:31:56,330 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrcmp [2019-11-16 00:31:56,331 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-16 00:31:56,331 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-16 00:31:56,331 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-16 00:31:56,331 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-16 00:31:56,332 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-16 00:31:56,332 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-16 00:31:56,332 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-16 00:31:56,332 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-16 00:31:56,332 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-16 00:31:56,333 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-16 00:31:56,333 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-16 00:31:56,333 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-16 00:31:56,334 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-16 00:31:56,334 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-16 00:31:56,334 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-16 00:31:56,334 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-16 00:31:56,334 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-16 00:31:56,334 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-16 00:31:56,335 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-16 00:31:56,335 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-16 00:31:56,335 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-16 00:31:56,335 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-16 00:31:56,335 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-16 00:31:56,336 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-16 00:31:56,336 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-16 00:31:56,336 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-16 00:31:56,336 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-16 00:31:56,336 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-16 00:31:56,337 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-16 00:31:56,337 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-16 00:31:56,337 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-16 00:31:56,337 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-16 00:31:56,337 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-16 00:31:56,338 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-16 00:31:56,338 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-16 00:31:56,338 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-16 00:31:56,338 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-16 00:31:56,338 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-16 00:31:56,338 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-16 00:31:56,339 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-16 00:31:56,339 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-16 00:31:56,339 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-16 00:31:56,339 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-16 00:31:56,339 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-16 00:31:56,339 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-16 00:31:56,340 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-16 00:31:56,340 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-16 00:31:56,340 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-16 00:31:56,340 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-16 00:31:56,340 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-16 00:31:56,341 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-16 00:31:56,341 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-16 00:31:56,341 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-16 00:31:56,341 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-16 00:31:56,341 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-16 00:31:56,341 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-16 00:31:56,342 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-16 00:31:56,342 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-16 00:31:56,342 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-16 00:31:56,342 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-16 00:31:56,342 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-16 00:31:56,343 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-16 00:31:56,343 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-16 00:31:56,343 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-16 00:31:56,343 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-16 00:31:56,343 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-16 00:31:56,344 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-16 00:31:56,344 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-16 00:31:56,344 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-16 00:31:56,344 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-16 00:31:56,344 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-16 00:31:56,345 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-16 00:31:56,345 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-16 00:31:56,345 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-16 00:31:56,345 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-16 00:31:56,345 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-16 00:31:56,346 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-16 00:31:56,346 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-16 00:31:56,346 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-16 00:31:56,346 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-16 00:31:56,346 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-16 00:31:56,346 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-16 00:31:56,347 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-16 00:31:56,347 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-16 00:31:56,347 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-16 00:31:56,347 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-16 00:31:56,347 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-16 00:31:56,347 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-16 00:31:56,348 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-16 00:31:56,348 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-16 00:31:56,348 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-16 00:31:56,348 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-16 00:31:56,348 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-16 00:31:56,349 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-16 00:31:56,349 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-16 00:31:56,349 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-16 00:31:56,349 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-16 00:31:56,349 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-16 00:31:56,350 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-16 00:31:56,350 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-16 00:31:56,350 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-16 00:31:56,350 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-16 00:31:56,350 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-16 00:31:56,350 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-16 00:31:56,351 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-16 00:31:56,351 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-16 00:31:56,351 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-16 00:31:56,351 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-16 00:31:56,351 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-16 00:31:56,352 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-16 00:31:56,352 INFO L130 BoogieDeclarations]: Found specification of procedure cstrcmp [2019-11-16 00:31:56,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:31:56,352 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-16 00:31:56,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:31:56,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:31:56,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:31:56,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-16 00:31:56,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:31:56,979 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:31:56,979 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-16 00:31:56,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:31:56 BoogieIcfgContainer [2019-11-16 00:31:56,980 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:31:56,981 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:31:56,981 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:31:56,984 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:31:56,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:31:55" (1/3) ... [2019-11-16 00:31:56,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9a46a96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:31:56, skipping insertion in model container [2019-11-16 00:31:56,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:56" (2/3) ... [2019-11-16 00:31:56,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9a46a96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:31:56, skipping insertion in model container [2019-11-16 00:31:56,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:31:56" (3/3) ... [2019-11-16 00:31:56,987 INFO L109 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcmp-alloca-1.i [2019-11-16 00:31:56,996 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:31:57,004 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2019-11-16 00:31:57,014 INFO L249 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2019-11-16 00:31:57,033 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:31:57,033 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-16 00:31:57,033 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:31:57,033 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:31:57,034 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:31:57,034 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:31:57,034 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:31:57,034 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:31:57,048 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2019-11-16 00:31:57,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-16 00:31:57,057 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:31:57,057 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:31:57,059 INFO L410 AbstractCegarLoop]: === Iteration 1 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:31:57,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:57,065 INFO L82 PathProgramCache]: Analyzing trace with hash -568922052, now seen corresponding path program 1 times [2019-11-16 00:31:57,073 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:31:57,073 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494018194] [2019-11-16 00:31:57,073 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:57,074 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:57,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:31:57,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:57,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:57,282 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-16 00:31:57,283 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494018194] [2019-11-16 00:31:57,283 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:31:57,284 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:31:57,284 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994040499] [2019-11-16 00:31:57,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:31:57,288 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:31:57,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:31:57,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:31:57,304 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 4 states. [2019-11-16 00:31:57,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:31:57,494 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2019-11-16 00:31:57,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:31:57,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-16 00:31:57,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:31:57,505 INFO L225 Difference]: With dead ends: 56 [2019-11-16 00:31:57,505 INFO L226 Difference]: Without dead ends: 53 [2019-11-16 00:31:57,507 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-16 00:31:57,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-16 00:31:57,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-11-16 00:31:57,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-16 00:31:57,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2019-11-16 00:31:57,544 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 11 [2019-11-16 00:31:57,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:31:57,545 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2019-11-16 00:31:57,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:31:57,545 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2019-11-16 00:31:57,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-16 00:31:57,546 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:31:57,546 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:31:57,546 INFO L410 AbstractCegarLoop]: === Iteration 2 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:31:57,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:57,547 INFO L82 PathProgramCache]: Analyzing trace with hash -568922051, now seen corresponding path program 1 times [2019-11-16 00:31:57,547 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:31:57,548 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483859358] [2019-11-16 00:31:57,548 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:57,548 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:57,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:31:57,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:57,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:57,688 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-16 00:31:57,688 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483859358] [2019-11-16 00:31:57,689 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:31:57,689 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:31:57,689 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382724328] [2019-11-16 00:31:57,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:31:57,691 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:31:57,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:31:57,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:31:57,691 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 5 states. [2019-11-16 00:31:57,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:31:57,935 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2019-11-16 00:31:57,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:31:57,936 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-16 00:31:57,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:31:57,939 INFO L225 Difference]: With dead ends: 73 [2019-11-16 00:31:57,939 INFO L226 Difference]: Without dead ends: 73 [2019-11-16 00:31:57,940 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-16 00:31:57,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-16 00:31:57,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 55. [2019-11-16 00:31:57,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-16 00:31:57,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2019-11-16 00:31:57,958 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 11 [2019-11-16 00:31:57,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:31:57,958 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2019-11-16 00:31:57,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:31:57,959 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2019-11-16 00:31:57,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-16 00:31:57,959 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:31:57,960 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:31:57,960 INFO L410 AbstractCegarLoop]: === Iteration 3 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:31:57,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:57,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1273294668, now seen corresponding path program 1 times [2019-11-16 00:31:57,961 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:31:57,961 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104101554] [2019-11-16 00:31:57,961 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:57,961 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:57,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:31:57,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:58,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:58,095 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-16 00:31:58,096 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104101554] [2019-11-16 00:31:58,096 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:31:58,096 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:31:58,096 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197127932] [2019-11-16 00:31:58,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:31:58,097 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:31:58,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:31:58,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:31:58,097 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 5 states. [2019-11-16 00:31:58,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:31:58,269 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2019-11-16 00:31:58,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:31:58,270 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-16 00:31:58,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:31:58,271 INFO L225 Difference]: With dead ends: 54 [2019-11-16 00:31:58,271 INFO L226 Difference]: Without dead ends: 54 [2019-11-16 00:31:58,271 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-16 00:31:58,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-16 00:31:58,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-11-16 00:31:58,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-16 00:31:58,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2019-11-16 00:31:58,278 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 13 [2019-11-16 00:31:58,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:31:58,278 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2019-11-16 00:31:58,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:31:58,279 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2019-11-16 00:31:58,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-16 00:31:58,280 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:31:58,280 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:31:58,280 INFO L410 AbstractCegarLoop]: === Iteration 4 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:31:58,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:58,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1273294616, now seen corresponding path program 1 times [2019-11-16 00:31:58,281 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:31:58,282 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557914192] [2019-11-16 00:31:58,282 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:58,282 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:58,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:31:58,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:58,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:58,341 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-16 00:31:58,341 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557914192] [2019-11-16 00:31:58,342 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:31:58,342 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:31:58,342 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756123101] [2019-11-16 00:31:58,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:31:58,343 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:31:58,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:31:58,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:31:58,344 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 5 states. [2019-11-16 00:31:58,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:31:58,490 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2019-11-16 00:31:58,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:31:58,491 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-16 00:31:58,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:31:58,492 INFO L225 Difference]: With dead ends: 72 [2019-11-16 00:31:58,492 INFO L226 Difference]: Without dead ends: 72 [2019-11-16 00:31:58,493 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-16 00:31:58,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-16 00:31:58,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 63. [2019-11-16 00:31:58,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-16 00:31:58,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2019-11-16 00:31:58,499 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 13 [2019-11-16 00:31:58,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:31:58,500 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2019-11-16 00:31:58,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:31:58,500 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2019-11-16 00:31:58,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-16 00:31:58,501 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:31:58,501 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:31:58,501 INFO L410 AbstractCegarLoop]: === Iteration 5 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:31:58,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:58,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1216036314, now seen corresponding path program 1 times [2019-11-16 00:31:58,502 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:31:58,502 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717550292] [2019-11-16 00:31:58,503 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:58,503 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:58,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:31:58,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:58,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:58,550 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-16 00:31:58,551 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717550292] [2019-11-16 00:31:58,551 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:31:58,551 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:31:58,551 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491654614] [2019-11-16 00:31:58,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:31:58,552 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:31:58,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:31:58,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:31:58,552 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand 4 states. [2019-11-16 00:31:58,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:31:58,667 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2019-11-16 00:31:58,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:31:58,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-16 00:31:58,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:31:58,669 INFO L225 Difference]: With dead ends: 61 [2019-11-16 00:31:58,669 INFO L226 Difference]: Without dead ends: 61 [2019-11-16 00:31:58,670 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-16 00:31:58,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-16 00:31:58,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-11-16 00:31:58,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-16 00:31:58,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2019-11-16 00:31:58,674 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 13 [2019-11-16 00:31:58,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:31:58,675 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2019-11-16 00:31:58,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:31:58,675 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2019-11-16 00:31:58,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-16 00:31:58,676 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:31:58,676 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:31:58,676 INFO L410 AbstractCegarLoop]: === Iteration 6 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:31:58,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:58,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1216036313, now seen corresponding path program 1 times [2019-11-16 00:31:58,677 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:31:58,681 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093562858] [2019-11-16 00:31:58,681 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:58,681 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:58,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:31:58,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:58,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:58,801 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-16 00:31:58,801 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093562858] [2019-11-16 00:31:58,802 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:31:58,802 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:31:58,802 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245957916] [2019-11-16 00:31:58,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:31:58,803 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:31:58,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:31:58,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:31:58,804 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand 6 states. [2019-11-16 00:31:59,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:31:59,019 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2019-11-16 00:31:59,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:31:59,019 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-11-16 00:31:59,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:31:59,020 INFO L225 Difference]: With dead ends: 72 [2019-11-16 00:31:59,021 INFO L226 Difference]: Without dead ends: 72 [2019-11-16 00:31:59,021 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:31:59,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-16 00:31:59,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 63. [2019-11-16 00:31:59,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-16 00:31:59,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2019-11-16 00:31:59,026 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 73 transitions. Word has length 13 [2019-11-16 00:31:59,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:31:59,027 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 73 transitions. [2019-11-16 00:31:59,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:31:59,027 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2019-11-16 00:31:59,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-16 00:31:59,028 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:31:59,028 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:31:59,028 INFO L410 AbstractCegarLoop]: === Iteration 7 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:31:59,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:59,028 INFO L82 PathProgramCache]: Analyzing trace with hash -817429008, now seen corresponding path program 1 times [2019-11-16 00:31:59,029 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:31:59,029 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627427488] [2019-11-16 00:31:59,029 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:59,029 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:59,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:31:59,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:59,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:59,137 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-16 00:31:59,137 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627427488] [2019-11-16 00:31:59,137 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:31:59,137 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:31:59,138 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834800942] [2019-11-16 00:31:59,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:31:59,138 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:31:59,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:31:59,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:31:59,139 INFO L87 Difference]: Start difference. First operand 63 states and 73 transitions. Second operand 5 states. [2019-11-16 00:31:59,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:31:59,267 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2019-11-16 00:31:59,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:31:59,268 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-16 00:31:59,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:31:59,269 INFO L225 Difference]: With dead ends: 70 [2019-11-16 00:31:59,269 INFO L226 Difference]: Without dead ends: 70 [2019-11-16 00:31:59,269 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-16 00:31:59,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-16 00:31:59,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2019-11-16 00:31:59,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-16 00:31:59,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2019-11-16 00:31:59,275 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 14 [2019-11-16 00:31:59,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:31:59,275 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2019-11-16 00:31:59,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:31:59,276 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2019-11-16 00:31:59,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-16 00:31:59,276 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:31:59,276 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:31:59,277 INFO L410 AbstractCegarLoop]: === Iteration 8 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:31:59,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:59,277 INFO L82 PathProgramCache]: Analyzing trace with hash 957578354, now seen corresponding path program 1 times [2019-11-16 00:31:59,277 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:31:59,278 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566548608] [2019-11-16 00:31:59,278 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:59,278 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:59,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:31:59,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:59,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:59,357 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-16 00:31:59,357 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566548608] [2019-11-16 00:31:59,357 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:31:59,357 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:31:59,357 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115984569] [2019-11-16 00:31:59,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:31:59,358 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:31:59,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:31:59,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:31:59,358 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand 5 states. [2019-11-16 00:31:59,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:31:59,475 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2019-11-16 00:31:59,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:31:59,475 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-16 00:31:59,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:31:59,476 INFO L225 Difference]: With dead ends: 64 [2019-11-16 00:31:59,476 INFO L226 Difference]: Without dead ends: 64 [2019-11-16 00:31:59,476 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-16 00:31:59,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-16 00:31:59,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2019-11-16 00:31:59,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-16 00:31:59,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2019-11-16 00:31:59,481 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 14 [2019-11-16 00:31:59,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:31:59,481 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2019-11-16 00:31:59,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:31:59,482 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2019-11-16 00:31:59,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-16 00:31:59,482 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:31:59,483 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:31:59,483 INFO L410 AbstractCegarLoop]: === Iteration 9 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:31:59,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:59,483 INFO L82 PathProgramCache]: Analyzing trace with hash 478071552, now seen corresponding path program 1 times [2019-11-16 00:31:59,483 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:31:59,484 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984831978] [2019-11-16 00:31:59,484 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:59,484 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:31:59,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:31:59,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:59,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:59,573 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-16 00:31:59,573 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984831978] [2019-11-16 00:31:59,573 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80264658] [2019-11-16 00:31:59,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b55077e7-56fe-4ddb-adad-612452c1bc30/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-16 00:31:59,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:59,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-16 00:31:59,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:31:59,733 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_24|], 1=[|v_#valid_33|]} [2019-11-16 00:31:59,759 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:31:59,769 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-16 00:31:59,770 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:31:59,789 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:31:59,796 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 10 treesize of output 8 [2019-11-16 00:31:59,797 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:31:59,811 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:31:59,812 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:31:59,813 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2019-11-16 00:31:59,828 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-16 00:31:59,829 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:31:59,829 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 6 [2019-11-16 00:31:59,829 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667435510] [2019-11-16 00:31:59,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:31:59,829 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:31:59,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:31:59,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:31:59,830 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand 7 states. [2019-11-16 00:32:00,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:00,029 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2019-11-16 00:32:00,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:32:00,030 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-11-16 00:32:00,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:00,031 INFO L225 Difference]: With dead ends: 81 [2019-11-16 00:32:00,031 INFO L226 Difference]: Without dead ends: 81 [2019-11-16 00:32:00,031 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 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-16 00:32:00,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-11-16 00:32:00,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 57. [2019-11-16 00:32:00,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-16 00:32:00,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2019-11-16 00:32:00,036 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 15 [2019-11-16 00:32:00,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:00,037 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2019-11-16 00:32:00,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:32:00,037 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2019-11-16 00:32:00,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-16 00:32:00,038 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:00,038 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:32:00,249 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:32:00,249 INFO L410 AbstractCegarLoop]: === Iteration 10 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:32:00,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:00,249 INFO L82 PathProgramCache]: Analyzing trace with hash 437037254, now seen corresponding path program 1 times [2019-11-16 00:32:00,250 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:00,250 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547951452] [2019-11-16 00:32:00,250 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:00,250 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:00,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:00,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:00,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:00,332 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-16 00:32:00,332 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547951452] [2019-11-16 00:32:00,333 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:32:00,333 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:32:00,333 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711372152] [2019-11-16 00:32:00,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:32:00,333 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:00,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:32:00,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:32:00,334 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 6 states. [2019-11-16 00:32:00,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:00,472 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2019-11-16 00:32:00,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:32:00,472 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-11-16 00:32:00,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:00,473 INFO L225 Difference]: With dead ends: 55 [2019-11-16 00:32:00,473 INFO L226 Difference]: Without dead ends: 55 [2019-11-16 00:32:00,473 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-16 00:32:00,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-16 00:32:00,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-11-16 00:32:00,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-16 00:32:00,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2019-11-16 00:32:00,477 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 17 [2019-11-16 00:32:00,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:00,477 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2019-11-16 00:32:00,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:32:00,478 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2019-11-16 00:32:00,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-16 00:32:00,478 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:00,478 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:32:00,479 INFO L410 AbstractCegarLoop]: === Iteration 11 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:32:00,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:00,479 INFO L82 PathProgramCache]: Analyzing trace with hash 437037255, now seen corresponding path program 1 times [2019-11-16 00:32:00,479 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:00,479 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912712381] [2019-11-16 00:32:00,479 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:00,480 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:00,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:00,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:00,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:00,594 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-16 00:32:00,594 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912712381] [2019-11-16 00:32:00,594 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:32:00,594 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:32:00,595 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448487508] [2019-11-16 00:32:00,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:32:00,595 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:00,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:32:00,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:32:00,596 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand 8 states. [2019-11-16 00:32:00,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:00,853 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2019-11-16 00:32:00,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:32:00,853 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-11-16 00:32:00,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:00,854 INFO L225 Difference]: With dead ends: 69 [2019-11-16 00:32:00,855 INFO L226 Difference]: Without dead ends: 69 [2019-11-16 00:32:00,855 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:32:00,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-16 00:32:00,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2019-11-16 00:32:00,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-16 00:32:00,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2019-11-16 00:32:00,859 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 17 [2019-11-16 00:32:00,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:00,859 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2019-11-16 00:32:00,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:32:00,859 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2019-11-16 00:32:00,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-16 00:32:00,860 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:00,860 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:32:00,860 INFO L410 AbstractCegarLoop]: === Iteration 12 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:32:00,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:00,860 INFO L82 PathProgramCache]: Analyzing trace with hash 92671082, now seen corresponding path program 1 times [2019-11-16 00:32:00,861 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:00,861 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790384270] [2019-11-16 00:32:00,861 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:00,861 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:00,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:00,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:00,947 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-16 00:32:00,947 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790384270] [2019-11-16 00:32:00,947 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012220274] [2019-11-16 00:32:00,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b55077e7-56fe-4ddb-adad-612452c1bc30/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-16 00:32:01,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:01,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-16 00:32:01,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:32:01,079 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:32:01,079 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-16 00:32:01,080 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:32:01,098 INFO L567 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-16 00:32:01,099 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:32:01,099 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-11-16 00:32:01,115 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-16 00:32:01,115 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:32:01,116 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2019-11-16 00:32:01,116 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393028967] [2019-11-16 00:32:01,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:32:01,116 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:01,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:32:01,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:32:01,116 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand 7 states. [2019-11-16 00:32:01,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:01,288 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2019-11-16 00:32:01,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:32:01,289 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-11-16 00:32:01,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:01,290 INFO L225 Difference]: With dead ends: 67 [2019-11-16 00:32:01,290 INFO L226 Difference]: Without dead ends: 67 [2019-11-16 00:32:01,290 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 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-16 00:32:01,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-16 00:32:01,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 57. [2019-11-16 00:32:01,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-16 00:32:01,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2019-11-16 00:32:01,293 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 17 [2019-11-16 00:32:01,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:01,293 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2019-11-16 00:32:01,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:32:01,294 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2019-11-16 00:32:01,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-16 00:32:01,294 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:01,294 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-16 00:32:01,495 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:32:01,495 INFO L410 AbstractCegarLoop]: === Iteration 13 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:32:01,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:01,495 INFO L82 PathProgramCache]: Analyzing trace with hash -913994489, now seen corresponding path program 1 times [2019-11-16 00:32:01,495 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:01,496 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979856392] [2019-11-16 00:32:01,496 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:01,496 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:01,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:01,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:01,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:01,574 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-16 00:32:01,575 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979856392] [2019-11-16 00:32:01,575 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:32:01,575 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:32:01,575 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612714877] [2019-11-16 00:32:01,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:32:01,576 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:01,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:32:01,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:32:01,576 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand 7 states. [2019-11-16 00:32:01,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:01,759 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2019-11-16 00:32:01,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:32:01,760 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-11-16 00:32:01,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:01,760 INFO L225 Difference]: With dead ends: 56 [2019-11-16 00:32:01,761 INFO L226 Difference]: Without dead ends: 56 [2019-11-16 00:32:01,761 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:32:01,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-16 00:32:01,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-11-16 00:32:01,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-16 00:32:01,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2019-11-16 00:32:01,764 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 19 [2019-11-16 00:32:01,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:01,764 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2019-11-16 00:32:01,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:32:01,765 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2019-11-16 00:32:01,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-16 00:32:01,765 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:01,765 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-16 00:32:01,766 INFO L410 AbstractCegarLoop]: === Iteration 14 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:32:01,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:01,766 INFO L82 PathProgramCache]: Analyzing trace with hash -913994488, now seen corresponding path program 1 times [2019-11-16 00:32:01,766 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:01,766 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88016079] [2019-11-16 00:32:01,766 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:01,767 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:01,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:01,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:01,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:01,883 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-16 00:32:01,883 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88016079] [2019-11-16 00:32:01,883 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:32:01,883 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-16 00:32:01,883 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446786614] [2019-11-16 00:32:01,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:32:01,884 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:01,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:32:01,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:32:01,884 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand 9 states. [2019-11-16 00:32:02,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:02,134 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2019-11-16 00:32:02,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:32:02,134 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-11-16 00:32:02,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:02,135 INFO L225 Difference]: With dead ends: 56 [2019-11-16 00:32:02,135 INFO L226 Difference]: Without dead ends: 56 [2019-11-16 00:32:02,135 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:32:02,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-16 00:32:02,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-11-16 00:32:02,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-16 00:32:02,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2019-11-16 00:32:02,138 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 19 [2019-11-16 00:32:02,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:02,139 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2019-11-16 00:32:02,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:32:02,139 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2019-11-16 00:32:02,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-16 00:32:02,139 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:02,140 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:32:02,140 INFO L410 AbstractCegarLoop]: === Iteration 15 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:32:02,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:02,140 INFO L82 PathProgramCache]: Analyzing trace with hash 2119591432, now seen corresponding path program 1 times [2019-11-16 00:32:02,140 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:02,140 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712161160] [2019-11-16 00:32:02,140 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:02,141 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:02,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:02,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:02,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:02,192 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-16 00:32:02,192 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712161160] [2019-11-16 00:32:02,192 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:32:02,193 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:32:02,193 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577790961] [2019-11-16 00:32:02,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:32:02,193 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:02,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:32:02,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:32:02,194 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand 7 states. [2019-11-16 00:32:02,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:02,355 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2019-11-16 00:32:02,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:32:02,356 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-11-16 00:32:02,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:02,356 INFO L225 Difference]: With dead ends: 55 [2019-11-16 00:32:02,356 INFO L226 Difference]: Without dead ends: 55 [2019-11-16 00:32:02,357 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:32:02,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-16 00:32:02,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-11-16 00:32:02,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-16 00:32:02,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2019-11-16 00:32:02,359 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 21 [2019-11-16 00:32:02,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:02,359 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2019-11-16 00:32:02,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:32:02,360 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2019-11-16 00:32:02,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-16 00:32:02,360 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:02,361 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:32:02,361 INFO L410 AbstractCegarLoop]: === Iteration 16 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:32:02,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:02,361 INFO L82 PathProgramCache]: Analyzing trace with hash 2119591433, now seen corresponding path program 1 times [2019-11-16 00:32:02,361 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:02,361 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923256738] [2019-11-16 00:32:02,361 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:02,362 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:02,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:02,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:02,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:02,432 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-16 00:32:02,432 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923256738] [2019-11-16 00:32:02,433 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:32:02,433 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:32:02,433 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627911231] [2019-11-16 00:32:02,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:32:02,433 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:02,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:32:02,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:32:02,434 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand 8 states. [2019-11-16 00:32:02,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:02,637 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2019-11-16 00:32:02,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:32:02,638 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-11-16 00:32:02,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:02,639 INFO L225 Difference]: With dead ends: 64 [2019-11-16 00:32:02,639 INFO L226 Difference]: Without dead ends: 64 [2019-11-16 00:32:02,639 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:32:02,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-16 00:32:02,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 56. [2019-11-16 00:32:02,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-16 00:32:02,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2019-11-16 00:32:02,641 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 21 [2019-11-16 00:32:02,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:02,641 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2019-11-16 00:32:02,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:32:02,642 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2019-11-16 00:32:02,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-16 00:32:02,642 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:02,642 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:32:02,643 INFO L410 AbstractCegarLoop]: === Iteration 17 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:32:02,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:02,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1112818005, now seen corresponding path program 1 times [2019-11-16 00:32:02,643 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:02,643 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369685935] [2019-11-16 00:32:02,643 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:02,643 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:02,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:02,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:02,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:02,703 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-16 00:32:02,704 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369685935] [2019-11-16 00:32:02,704 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:32:02,704 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:32:02,704 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290618998] [2019-11-16 00:32:02,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:32:02,705 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:02,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:32:02,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:32:02,705 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand 7 states. [2019-11-16 00:32:02,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:02,834 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2019-11-16 00:32:02,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:32:02,834 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-11-16 00:32:02,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:02,835 INFO L225 Difference]: With dead ends: 55 [2019-11-16 00:32:02,835 INFO L226 Difference]: Without dead ends: 55 [2019-11-16 00:32:02,835 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:32:02,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-16 00:32:02,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-11-16 00:32:02,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-16 00:32:02,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2019-11-16 00:32:02,837 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 23 [2019-11-16 00:32:02,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:02,838 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2019-11-16 00:32:02,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:32:02,838 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2019-11-16 00:32:02,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-16 00:32:02,839 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:02,839 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:32:02,839 INFO L410 AbstractCegarLoop]: === Iteration 18 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:32:02,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:02,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1112818006, now seen corresponding path program 1 times [2019-11-16 00:32:02,839 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:02,839 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601635481] [2019-11-16 00:32:02,840 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:02,840 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:02,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:02,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:02,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:02,944 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-16 00:32:02,944 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601635481] [2019-11-16 00:32:02,945 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:32:02,945 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-16 00:32:02,945 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635566157] [2019-11-16 00:32:02,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:32:02,945 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:02,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:32:02,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:32:02,946 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand 9 states. [2019-11-16 00:32:03,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:03,264 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2019-11-16 00:32:03,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:32:03,264 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-11-16 00:32:03,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:03,265 INFO L225 Difference]: With dead ends: 63 [2019-11-16 00:32:03,265 INFO L226 Difference]: Without dead ends: 63 [2019-11-16 00:32:03,266 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:32:03,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-16 00:32:03,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2019-11-16 00:32:03,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-16 00:32:03,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2019-11-16 00:32:03,268 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 23 [2019-11-16 00:32:03,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:03,269 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2019-11-16 00:32:03,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:32:03,269 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2019-11-16 00:32:03,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-16 00:32:03,270 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:03,270 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:32:03,270 INFO L410 AbstractCegarLoop]: === Iteration 19 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:32:03,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:03,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1112867735, now seen corresponding path program 1 times [2019-11-16 00:32:03,270 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:03,270 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534472100] [2019-11-16 00:32:03,271 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:03,271 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:03,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:03,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:03,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:03,715 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-16 00:32:03,715 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534472100] [2019-11-16 00:32:03,716 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:32:03,716 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-11-16 00:32:03,718 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384064792] [2019-11-16 00:32:03,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-16 00:32:03,721 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:03,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-16 00:32:03,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:32:03,722 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 15 states. [2019-11-16 00:32:04,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:04,290 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2019-11-16 00:32:04,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-16 00:32:04,291 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2019-11-16 00:32:04,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:04,291 INFO L225 Difference]: With dead ends: 91 [2019-11-16 00:32:04,292 INFO L226 Difference]: Without dead ends: 91 [2019-11-16 00:32:04,292 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2019-11-16 00:32:04,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-16 00:32:04,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 82. [2019-11-16 00:32:04,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-16 00:32:04,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2019-11-16 00:32:04,295 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 23 [2019-11-16 00:32:04,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:04,296 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2019-11-16 00:32:04,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-16 00:32:04,296 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2019-11-16 00:32:04,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-16 00:32:04,297 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:04,297 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:32:04,297 INFO L410 AbstractCegarLoop]: === Iteration 20 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:32:04,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:04,297 INFO L82 PathProgramCache]: Analyzing trace with hash 590156061, now seen corresponding path program 1 times [2019-11-16 00:32:04,297 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:04,298 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825570513] [2019-11-16 00:32:04,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:04,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:04,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:04,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:04,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:04,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:04,388 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-16 00:32:04,388 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825570513] [2019-11-16 00:32:04,389 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:32:04,389 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:32:04,389 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429155993] [2019-11-16 00:32:04,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:32:04,390 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:04,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:32:04,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:32:04,390 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. Second operand 5 states. [2019-11-16 00:32:04,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:04,483 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2019-11-16 00:32:04,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:32:04,484 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-16 00:32:04,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:04,484 INFO L225 Difference]: With dead ends: 81 [2019-11-16 00:32:04,484 INFO L226 Difference]: Without dead ends: 50 [2019-11-16 00:32:04,485 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-16 00:32:04,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-16 00:32:04,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-11-16 00:32:04,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-16 00:32:04,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2019-11-16 00:32:04,487 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 26 [2019-11-16 00:32:04,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:04,487 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2019-11-16 00:32:04,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:32:04,487 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2019-11-16 00:32:04,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-16 00:32:04,488 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:04,488 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:32:04,489 INFO L410 AbstractCegarLoop]: === Iteration 21 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:32:04,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:04,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1603523034, now seen corresponding path program 1 times [2019-11-16 00:32:04,489 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:04,489 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993199652] [2019-11-16 00:32:04,490 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:04,490 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:04,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:04,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:04,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:04,589 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-16 00:32:04,589 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993199652] [2019-11-16 00:32:04,590 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043760249] [2019-11-16 00:32:04,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b55077e7-56fe-4ddb-adad-612452c1bc30/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-16 00:32:04,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:04,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-16 00:32:04,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:32:04,739 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 11 treesize of output 7 [2019-11-16 00:32:04,739 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:32:04,742 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:32:04,742 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:32:04,742 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-11-16 00:32:04,943 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:32:04,943 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 26 treesize of output 22 [2019-11-16 00:32:04,944 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:32:04,946 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:32:04,946 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:32:04,946 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-11-16 00:32:04,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:32:04,974 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:32:04,974 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 20 [2019-11-16 00:32:04,975 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274604545] [2019-11-16 00:32:04,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-16 00:32:04,975 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:04,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-16 00:32:04,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2019-11-16 00:32:04,976 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 11 states. [2019-11-16 00:32:05,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:05,265 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2019-11-16 00:32:05,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:32:05,266 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2019-11-16 00:32:05,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:05,267 INFO L225 Difference]: With dead ends: 60 [2019-11-16 00:32:05,267 INFO L226 Difference]: Without dead ends: 42 [2019-11-16 00:32:05,267 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=626, Unknown=0, NotChecked=0, Total=702 [2019-11-16 00:32:05,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-16 00:32:05,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-11-16 00:32:05,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-16 00:32:05,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2019-11-16 00:32:05,269 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 27 [2019-11-16 00:32:05,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:05,269 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2019-11-16 00:32:05,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-16 00:32:05,269 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2019-11-16 00:32:05,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-16 00:32:05,271 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:05,271 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:32:05,471 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:32:05,471 INFO L410 AbstractCegarLoop]: === Iteration 22 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:32:05,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:05,472 INFO L82 PathProgramCache]: Analyzing trace with hash 785874584, now seen corresponding path program 1 times [2019-11-16 00:32:05,472 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:05,472 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991705095] [2019-11-16 00:32:05,472 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:05,472 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:05,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:05,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:05,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:05,600 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-16 00:32:05,600 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991705095] [2019-11-16 00:32:05,600 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628254804] [2019-11-16 00:32:05,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b55077e7-56fe-4ddb-adad-612452c1bc30/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-16 00:32:05,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:05,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-16 00:32:05,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:32:05,845 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-16 00:32:05,845 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:32:05,845 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2019-11-16 00:32:05,845 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395645521] [2019-11-16 00:32:05,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-16 00:32:05,846 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:05,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-16 00:32:05,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-11-16 00:32:05,846 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 17 states. [2019-11-16 00:32:06,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:06,323 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2019-11-16 00:32:06,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:32:06,325 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2019-11-16 00:32:06,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:06,325 INFO L225 Difference]: With dead ends: 52 [2019-11-16 00:32:06,326 INFO L226 Difference]: Without dead ends: 52 [2019-11-16 00:32:06,327 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2019-11-16 00:32:06,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-16 00:32:06,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2019-11-16 00:32:06,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-16 00:32:06,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2019-11-16 00:32:06,328 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 27 [2019-11-16 00:32:06,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:06,329 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2019-11-16 00:32:06,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-16 00:32:06,329 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2019-11-16 00:32:06,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-16 00:32:06,329 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:06,329 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:32:06,535 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:32:06,536 INFO L410 AbstractCegarLoop]: === Iteration 23 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:32:06,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:06,536 INFO L82 PathProgramCache]: Analyzing trace with hash -688770407, now seen corresponding path program 1 times [2019-11-16 00:32:06,536 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:06,537 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234987719] [2019-11-16 00:32:06,537 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:06,537 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:06,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:06,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:06,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:06,752 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:32:06,752 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234987719] [2019-11-16 00:32:06,752 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:32:06,752 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-11-16 00:32:06,752 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147284074] [2019-11-16 00:32:06,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-16 00:32:06,753 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:06,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-16 00:32:06,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:32:06,753 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 15 states. [2019-11-16 00:32:07,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:07,057 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2019-11-16 00:32:07,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-16 00:32:07,057 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2019-11-16 00:32:07,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:07,058 INFO L225 Difference]: With dead ends: 62 [2019-11-16 00:32:07,058 INFO L226 Difference]: Without dead ends: 52 [2019-11-16 00:32:07,058 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2019-11-16 00:32:07,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-16 00:32:07,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2019-11-16 00:32:07,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-16 00:32:07,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2019-11-16 00:32:07,060 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 29 [2019-11-16 00:32:07,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:07,060 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2019-11-16 00:32:07,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-16 00:32:07,061 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2019-11-16 00:32:07,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-16 00:32:07,061 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:07,061 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:32:07,061 INFO L410 AbstractCegarLoop]: === Iteration 24 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:32:07,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:07,062 INFO L82 PathProgramCache]: Analyzing trace with hash -196593956, now seen corresponding path program 1 times [2019-11-16 00:32:07,062 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:07,062 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998470238] [2019-11-16 00:32:07,062 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:07,062 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:07,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:07,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:07,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:07,231 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:32:07,232 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998470238] [2019-11-16 00:32:07,232 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852100718] [2019-11-16 00:32:07,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b55077e7-56fe-4ddb-adad-612452c1bc30/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-16 00:32:07,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:07,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-16 00:32:07,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:32:07,455 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:32:07,456 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:32:07,456 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2019-11-16 00:32:07,456 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15732077] [2019-11-16 00:32:07,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-16 00:32:07,456 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:07,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-16 00:32:07,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-11-16 00:32:07,459 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 18 states. [2019-11-16 00:32:07,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:07,828 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2019-11-16 00:32:07,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-16 00:32:07,829 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 33 [2019-11-16 00:32:07,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:07,829 INFO L225 Difference]: With dead ends: 49 [2019-11-16 00:32:07,829 INFO L226 Difference]: Without dead ends: 49 [2019-11-16 00:32:07,830 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=594, Unknown=0, NotChecked=0, Total=702 [2019-11-16 00:32:07,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-16 00:32:07,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-11-16 00:32:07,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-16 00:32:07,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-11-16 00:32:07,832 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 33 [2019-11-16 00:32:07,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:07,832 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-11-16 00:32:07,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-16 00:32:07,832 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2019-11-16 00:32:07,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-16 00:32:07,832 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:07,833 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:32:08,033 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:32:08,033 INFO L410 AbstractCegarLoop]: === Iteration 25 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:32:08,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:08,033 INFO L82 PathProgramCache]: Analyzing trace with hash 51768029, now seen corresponding path program 1 times [2019-11-16 00:32:08,033 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:08,034 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922015917] [2019-11-16 00:32:08,034 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:08,034 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:08,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:08,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:08,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:08,172 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:32:08,172 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922015917] [2019-11-16 00:32:08,172 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108864560] [2019-11-16 00:32:08,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b55077e7-56fe-4ddb-adad-612452c1bc30/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-16 00:32:08,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:08,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-16 00:32:08,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:32:08,412 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:32:08,412 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:32:08,412 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2019-11-16 00:32:08,413 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784643030] [2019-11-16 00:32:08,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-16 00:32:08,413 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:08,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-16 00:32:08,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-11-16 00:32:08,414 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 18 states. [2019-11-16 00:32:09,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:09,005 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2019-11-16 00:32:09,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-16 00:32:09,005 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 35 [2019-11-16 00:32:09,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:09,006 INFO L225 Difference]: With dead ends: 54 [2019-11-16 00:32:09,006 INFO L226 Difference]: Without dead ends: 54 [2019-11-16 00:32:09,006 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=594, Unknown=0, NotChecked=0, Total=702 [2019-11-16 00:32:09,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-16 00:32:09,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2019-11-16 00:32:09,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-16 00:32:09,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-11-16 00:32:09,008 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 35 [2019-11-16 00:32:09,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:09,009 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-11-16 00:32:09,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-16 00:32:09,009 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-11-16 00:32:09,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-16 00:32:09,009 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:09,009 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:32:09,213 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:32:09,214 INFO L410 AbstractCegarLoop]: === Iteration 26 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:32:09,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:09,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1790582486, now seen corresponding path program 1 times [2019-11-16 00:32:09,214 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:09,214 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462068987] [2019-11-16 00:32:09,214 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:09,214 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:09,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:09,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:09,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:09,360 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:32:09,360 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462068987] [2019-11-16 00:32:09,361 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344946203] [2019-11-16 00:32:09,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b55077e7-56fe-4ddb-adad-612452c1bc30/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-16 00:32:09,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:09,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-16 00:32:09,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:32:09,561 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:32:09,561 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:32:09,561 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 18 [2019-11-16 00:32:09,561 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014007375] [2019-11-16 00:32:09,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-16 00:32:09,561 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:09,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-16 00:32:09,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-11-16 00:32:09,562 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 19 states. [2019-11-16 00:32:10,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:10,020 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2019-11-16 00:32:10,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:32:10,020 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 37 [2019-11-16 00:32:10,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:10,021 INFO L225 Difference]: With dead ends: 56 [2019-11-16 00:32:10,021 INFO L226 Difference]: Without dead ends: 53 [2019-11-16 00:32:10,021 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=693, Unknown=0, NotChecked=0, Total=812 [2019-11-16 00:32:10,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-16 00:32:10,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2019-11-16 00:32:10,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-16 00:32:10,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2019-11-16 00:32:10,023 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 37 [2019-11-16 00:32:10,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:10,023 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2019-11-16 00:32:10,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-16 00:32:10,023 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2019-11-16 00:32:10,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-16 00:32:10,023 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:10,023 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:32:10,224 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:32:10,224 INFO L410 AbstractCegarLoop]: === Iteration 27 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:32:10,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:10,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1790532757, now seen corresponding path program 1 times [2019-11-16 00:32:10,224 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:10,225 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941191410] [2019-11-16 00:32:10,225 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:10,225 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:10,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:10,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:10,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:10,580 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:32:10,580 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941191410] [2019-11-16 00:32:10,580 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331898422] [2019-11-16 00:32:10,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b55077e7-56fe-4ddb-adad-612452c1bc30/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-16 00:32:10,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:10,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 45 conjunts are in the unsatisfiable core [2019-11-16 00:32:10,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:32:10,802 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-16 00:32:10,802 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:32:10,808 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:32:10,809 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-16 00:32:10,809 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2019-11-16 00:32:11,227 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:32:11,243 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:32:11,243 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 40 [2019-11-16 00:32:11,243 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:32:11,252 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:32:11,253 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:32:11,253 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:46, output treesize:3 [2019-11-16 00:32:11,258 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:32:11,258 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:32:11,258 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 29 [2019-11-16 00:32:11,258 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608520427] [2019-11-16 00:32:11,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-16 00:32:11,259 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:11,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-16 00:32:11,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=739, Unknown=0, NotChecked=0, Total=812 [2019-11-16 00:32:11,259 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 29 states. [2019-11-16 00:32:13,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:13,208 INFO L93 Difference]: Finished difference Result 124 states and 128 transitions. [2019-11-16 00:32:13,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-11-16 00:32:13,208 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 37 [2019-11-16 00:32:13,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:13,209 INFO L225 Difference]: With dead ends: 124 [2019-11-16 00:32:13,209 INFO L226 Difference]: Without dead ends: 63 [2019-11-16 00:32:13,211 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1239 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=494, Invalid=4336, Unknown=0, NotChecked=0, Total=4830 [2019-11-16 00:32:13,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-16 00:32:13,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2019-11-16 00:32:13,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-16 00:32:13,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2019-11-16 00:32:13,213 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 37 [2019-11-16 00:32:13,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:13,213 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2019-11-16 00:32:13,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-16 00:32:13,213 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2019-11-16 00:32:13,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-16 00:32:13,214 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:13,214 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:32:13,417 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:32:13,417 INFO L410 AbstractCegarLoop]: === Iteration 28 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:32:13,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:13,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1666823887, now seen corresponding path program 2 times [2019-11-16 00:32:13,418 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:13,418 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681059526] [2019-11-16 00:32:13,418 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:13,418 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:13,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:13,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:13,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:13,633 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:32:13,634 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681059526] [2019-11-16 00:32:13,634 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802588734] [2019-11-16 00:32:13,634 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b55077e7-56fe-4ddb-adad-612452c1bc30/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-16 00:32:13,765 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:32:13,765 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:32:13,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-16 00:32:13,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:32:13,922 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:32:13,922 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:32:13,923 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 22 [2019-11-16 00:32:13,923 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570335225] [2019-11-16 00:32:13,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-16 00:32:13,923 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:13,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-16 00:32:13,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-11-16 00:32:13,924 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 23 states. [2019-11-16 00:32:14,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:14,434 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-11-16 00:32:14,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-16 00:32:14,435 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 45 [2019-11-16 00:32:14,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:14,436 INFO L225 Difference]: With dead ends: 67 [2019-11-16 00:32:14,436 INFO L226 Difference]: Without dead ends: 67 [2019-11-16 00:32:14,436 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=792, Unknown=0, NotChecked=0, Total=930 [2019-11-16 00:32:14,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-16 00:32:14,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2019-11-16 00:32:14,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-16 00:32:14,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2019-11-16 00:32:14,439 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 45 [2019-11-16 00:32:14,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:14,439 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2019-11-16 00:32:14,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-16 00:32:14,439 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2019-11-16 00:32:14,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-16 00:32:14,440 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:14,440 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:32:14,643 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:32:14,643 INFO L410 AbstractCegarLoop]: === Iteration 29 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:32:14,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:14,643 INFO L82 PathProgramCache]: Analyzing trace with hash 205044466, now seen corresponding path program 2 times [2019-11-16 00:32:14,643 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:14,643 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524138265] [2019-11-16 00:32:14,643 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:14,644 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:14,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:14,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:14,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:14,802 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:32:14,802 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524138265] [2019-11-16 00:32:14,802 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062467179] [2019-11-16 00:32:14,802 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b55077e7-56fe-4ddb-adad-612452c1bc30/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-16 00:32:14,922 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:32:14,922 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:32:14,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-16 00:32:14,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:32:14,939 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:32:14,939 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-16 00:32:14,939 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:32:14,953 INFO L567 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-16 00:32:14,954 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:32:14,954 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-11-16 00:32:15,156 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:32:15,157 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:32:15,157 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 23 [2019-11-16 00:32:15,157 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954616799] [2019-11-16 00:32:15,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-16 00:32:15,158 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:15,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-16 00:32:15,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=492, Unknown=0, NotChecked=0, Total=552 [2019-11-16 00:32:15,158 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 24 states. [2019-11-16 00:32:15,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:15,653 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2019-11-16 00:32:15,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-16 00:32:15,654 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 47 [2019-11-16 00:32:15,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:15,654 INFO L225 Difference]: With dead ends: 63 [2019-11-16 00:32:15,654 INFO L226 Difference]: Without dead ends: 63 [2019-11-16 00:32:15,655 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=143, Invalid=979, Unknown=0, NotChecked=0, Total=1122 [2019-11-16 00:32:15,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-16 00:32:15,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-11-16 00:32:15,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-16 00:32:15,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-11-16 00:32:15,657 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 47 [2019-11-16 00:32:15,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:15,657 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-11-16 00:32:15,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-16 00:32:15,658 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-11-16 00:32:15,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-16 00:32:15,658 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:15,658 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:32:15,862 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:32:15,862 INFO L410 AbstractCegarLoop]: === Iteration 30 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:32:15,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:15,862 INFO L82 PathProgramCache]: Analyzing trace with hash -520765069, now seen corresponding path program 2 times [2019-11-16 00:32:15,862 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:15,862 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825549357] [2019-11-16 00:32:15,863 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:15,863 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:15,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:15,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:15,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:15,951 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-16 00:32:15,951 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825549357] [2019-11-16 00:32:15,952 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101434352] [2019-11-16 00:32:15,952 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b55077e7-56fe-4ddb-adad-612452c1bc30/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:32:16,061 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-16 00:32:16,061 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:32:16,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:32:16,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:32:16,088 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-16 00:32:16,088 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:32:16,088 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2019-11-16 00:32:16,089 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408393174] [2019-11-16 00:32:16,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:32:16,089 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:16,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:32:16,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:32:16,090 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 4 states. [2019-11-16 00:32:16,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:16,118 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2019-11-16 00:32:16,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:32:16,118 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-16 00:32:16,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:16,119 INFO L225 Difference]: With dead ends: 61 [2019-11-16 00:32:16,119 INFO L226 Difference]: Without dead ends: 61 [2019-11-16 00:32:16,119 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:32:16,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-16 00:32:16,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-11-16 00:32:16,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-16 00:32:16,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2019-11-16 00:32:16,121 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 49 [2019-11-16 00:32:16,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:16,121 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2019-11-16 00:32:16,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:32:16,121 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2019-11-16 00:32:16,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-16 00:32:16,122 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:16,122 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:32:16,325 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:32:16,325 INFO L410 AbstractCegarLoop]: === Iteration 31 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:32:16,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:16,325 INFO L82 PathProgramCache]: Analyzing trace with hash 2055891520, now seen corresponding path program 2 times [2019-11-16 00:32:16,325 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:16,326 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745941907] [2019-11-16 00:32:16,326 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:16,326 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:16,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:16,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:16,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:16,522 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:32:16,522 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745941907] [2019-11-16 00:32:16,522 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9291697] [2019-11-16 00:32:16,522 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b55077e7-56fe-4ddb-adad-612452c1bc30/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:32:16,625 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-16 00:32:16,625 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:32:16,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-16 00:32:16,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:32:16,699 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-16 00:32:16,699 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:32:16,699 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [14] total 17 [2019-11-16 00:32:16,699 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163681228] [2019-11-16 00:32:16,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:32:16,700 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:16,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:32:16,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-11-16 00:32:16,700 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand 5 states. [2019-11-16 00:32:16,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:16,757 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2019-11-16 00:32:16,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:32:16,758 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-11-16 00:32:16,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:16,758 INFO L225 Difference]: With dead ends: 58 [2019-11-16 00:32:16,758 INFO L226 Difference]: Without dead ends: 55 [2019-11-16 00:32:16,759 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2019-11-16 00:32:16,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-16 00:32:16,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-11-16 00:32:16,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-16 00:32:16,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2019-11-16 00:32:16,761 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 51 [2019-11-16 00:32:16,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:16,761 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2019-11-16 00:32:16,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:32:16,761 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2019-11-16 00:32:16,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-16 00:32:16,761 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:16,762 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:32:16,965 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:32:16,965 INFO L410 AbstractCegarLoop]: === Iteration 32 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:32:16,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:16,966 INFO L82 PathProgramCache]: Analyzing trace with hash 2055941249, now seen corresponding path program 3 times [2019-11-16 00:32:16,966 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:16,966 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539125823] [2019-11-16 00:32:16,966 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:16,966 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:16,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:16,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:17,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:17,821 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:32:17,821 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539125823] [2019-11-16 00:32:17,821 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638155249] [2019-11-16 00:32:17,822 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b55077e7-56fe-4ddb-adad-612452c1bc30/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:32:17,960 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-16 00:32:17,960 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:32:17,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 61 conjunts are in the unsatisfiable core [2019-11-16 00:32:17,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:32:17,975 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:32:17,975 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-16 00:32:17,975 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:32:17,991 INFO L567 ElimStorePlain]: treesize reduction 10, result has 67.7 percent of original size [2019-11-16 00:32:17,991 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:32:17,991 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:12 [2019-11-16 00:32:18,169 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-16 00:32:18,169 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:32:18,175 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:32:18,176 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:32:18,176 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2019-11-16 00:32:18,624 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2019-11-16 00:32:18,624 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-16 00:32:18,637 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:32:18,638 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-16 00:32:18,638 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:44 [2019-11-16 00:32:18,773 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:32:18,774 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:32:18,785 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-11-16 00:32:18,785 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 21 [2019-11-16 00:32:18,785 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:32:18,800 INFO L567 ElimStorePlain]: treesize reduction 8, result has 71.4 percent of original size [2019-11-16 00:32:18,801 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:32:18,801 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:45, output treesize:3 [2019-11-16 00:32:18,810 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:32:18,811 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:32:18,811 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 19] total 41 [2019-11-16 00:32:18,811 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130130468] [2019-11-16 00:32:18,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-11-16 00:32:18,811 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:18,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-11-16 00:32:18,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1538, Unknown=0, NotChecked=0, Total=1640 [2019-11-16 00:32:18,812 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 41 states. [2019-11-16 00:32:19,863 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 29 [2019-11-16 00:32:22,290 WARN L191 SmtUtils]: Spent 402.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-11-16 00:32:22,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:22,517 INFO L93 Difference]: Finished difference Result 133 states and 138 transitions. [2019-11-16 00:32:22,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-11-16 00:32:22,517 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 51 [2019-11-16 00:32:22,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:22,518 INFO L225 Difference]: With dead ends: 133 [2019-11-16 00:32:22,518 INFO L226 Difference]: Without dead ends: 89 [2019-11-16 00:32:22,520 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1226 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=436, Invalid=5264, Unknown=0, NotChecked=0, Total=5700 [2019-11-16 00:32:22,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-16 00:32:22,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 59. [2019-11-16 00:32:22,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-16 00:32:22,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2019-11-16 00:32:22,522 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 51 [2019-11-16 00:32:22,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:22,522 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2019-11-16 00:32:22,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-11-16 00:32:22,522 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2019-11-16 00:32:22,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-16 00:32:22,522 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:22,523 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:32:22,727 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:32:22,727 INFO L410 AbstractCegarLoop]: === Iteration 33 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:32:22,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:22,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1781732220, now seen corresponding path program 4 times [2019-11-16 00:32:22,727 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:22,727 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510700165] [2019-11-16 00:32:22,727 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:22,728 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:22,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:22,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:23,615 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:32:23,616 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510700165] [2019-11-16 00:32:23,616 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868937835] [2019-11-16 00:32:23,616 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b55077e7-56fe-4ddb-adad-612452c1bc30/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:32:23,753 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-16 00:32:23,753 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:32:23,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 44 conjunts are in the unsatisfiable core [2019-11-16 00:32:23,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:32:23,760 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_28|], 1=[|v_#valid_34|]} [2019-11-16 00:32:23,763 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:32:23,764 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-16 00:32:23,764 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:32:23,771 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:32:23,775 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 10 treesize of output 8 [2019-11-16 00:32:23,775 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:32:23,782 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:32:23,782 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:32:23,782 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2019-11-16 00:32:23,912 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-11-16 00:32:23,912 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:32:23,918 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:32:23,918 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:32:23,918 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2019-11-16 00:32:23,961 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2019-11-16 00:32:23,962 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:32:23,968 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:32:23,969 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:32:23,969 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2019-11-16 00:32:24,259 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2019-11-16 00:32:24,260 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:32:24,269 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:32:24,270 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-16 00:32:24,270 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:35 [2019-11-16 00:32:24,388 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:32:24,389 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 10 [2019-11-16 00:32:24,389 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:32:24,396 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:32:24,396 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:32:24,397 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:42, output treesize:3 [2019-11-16 00:32:24,443 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-16 00:32:24,443 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:32:24,443 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 16] total 39 [2019-11-16 00:32:24,444 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059729032] [2019-11-16 00:32:24,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-11-16 00:32:24,444 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:24,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-11-16 00:32:24,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1385, Unknown=0, NotChecked=0, Total=1482 [2019-11-16 00:32:24,445 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand 39 states. [2019-11-16 00:32:25,737 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 49 [2019-11-16 00:32:26,299 WARN L191 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 54 [2019-11-16 00:32:26,501 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 65 [2019-11-16 00:32:28,900 WARN L191 SmtUtils]: Spent 2.34 s on a formula simplification. DAG size of input: 89 DAG size of output: 69 [2019-11-16 00:32:31,310 WARN L191 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-11-16 00:32:31,565 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2019-11-16 00:32:31,742 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 67 [2019-11-16 00:32:35,902 WARN L191 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 76 DAG size of output: 50 [2019-11-16 00:32:44,770 WARN L191 SmtUtils]: Spent 8.73 s on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2019-11-16 00:32:48,968 WARN L191 SmtUtils]: Spent 4.13 s on a formula simplification. DAG size of input: 83 DAG size of output: 63 [2019-11-16 00:32:49,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:49,000 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2019-11-16 00:32:49,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-16 00:32:49,001 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 55 [2019-11-16 00:32:49,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:49,001 INFO L225 Difference]: With dead ends: 105 [2019-11-16 00:32:49,001 INFO L226 Difference]: Without dead ends: 66 [2019-11-16 00:32:49,003 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 669 ImplicationChecksByTransitivity, 20.9s TimeCoverageRelationStatistics Valid=317, Invalid=3223, Unknown=0, NotChecked=0, Total=3540 [2019-11-16 00:32:49,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-16 00:32:49,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2019-11-16 00:32:49,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-16 00:32:49,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2019-11-16 00:32:49,007 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 55 [2019-11-16 00:32:49,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:49,007 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2019-11-16 00:32:49,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-11-16 00:32:49,008 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2019-11-16 00:32:49,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-16 00:32:49,008 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:49,008 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:32:49,208 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:32:49,209 INFO L410 AbstractCegarLoop]: === Iteration 34 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:32:49,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:49,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1410998329, now seen corresponding path program 5 times [2019-11-16 00:32:49,209 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:49,209 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420470066] [2019-11-16 00:32:49,209 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:49,209 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:49,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:49,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:49,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:49,457 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-16 00:32:49,458 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420470066] [2019-11-16 00:32:49,458 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545749821] [2019-11-16 00:32:49,458 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b55077e7-56fe-4ddb-adad-612452c1bc30/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:32:49,589 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-11-16 00:32:49,590 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:32:49,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-16 00:32:49,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:32:49,784 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-16 00:32:49,784 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:32:49,785 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 25 [2019-11-16 00:32:49,785 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526166768] [2019-11-16 00:32:49,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-16 00:32:49,785 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:49,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-16 00:32:49,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2019-11-16 00:32:49,786 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand 26 states. [2019-11-16 00:32:50,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:50,399 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2019-11-16 00:32:50,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-16 00:32:50,399 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 59 [2019-11-16 00:32:50,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:50,400 INFO L225 Difference]: With dead ends: 71 [2019-11-16 00:32:50,400 INFO L226 Difference]: Without dead ends: 71 [2019-11-16 00:32:50,400 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=184, Invalid=1076, Unknown=0, NotChecked=0, Total=1260 [2019-11-16 00:32:50,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-16 00:32:50,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2019-11-16 00:32:50,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-16 00:32:50,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2019-11-16 00:32:50,402 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 59 [2019-11-16 00:32:50,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:50,403 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2019-11-16 00:32:50,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-16 00:32:50,403 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2019-11-16 00:32:50,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-16 00:32:50,403 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:50,404 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:32:50,607 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:32:50,607 INFO L410 AbstractCegarLoop]: === Iteration 35 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:32:50,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:50,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1240269832, now seen corresponding path program 3 times [2019-11-16 00:32:50,608 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:50,608 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84752972] [2019-11-16 00:32:50,608 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:50,608 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:50,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:50,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:50,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:50,843 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 8 proven. 34 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-16 00:32:50,844 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84752972] [2019-11-16 00:32:50,844 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595651530] [2019-11-16 00:32:50,844 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b55077e7-56fe-4ddb-adad-612452c1bc30/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:32:51,028 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-16 00:32:51,029 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:32:51,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-16 00:32:51,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:32:51,047 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:32:51,047 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-16 00:32:51,048 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:32:51,066 INFO L567 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-16 00:32:51,067 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:32:51,067 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-11-16 00:32:51,381 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-16 00:32:51,381 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:32:51,381 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 27 [2019-11-16 00:32:51,381 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519581603] [2019-11-16 00:32:51,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-16 00:32:51,382 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:51,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-16 00:32:51,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=680, Unknown=0, NotChecked=0, Total=756 [2019-11-16 00:32:51,382 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand 28 states. [2019-11-16 00:32:52,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:52,173 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-11-16 00:32:52,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-16 00:32:52,173 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 61 [2019-11-16 00:32:52,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:52,174 INFO L225 Difference]: With dead ends: 70 [2019-11-16 00:32:52,174 INFO L226 Difference]: Without dead ends: 70 [2019-11-16 00:32:52,174 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=213, Invalid=1509, Unknown=0, NotChecked=0, Total=1722 [2019-11-16 00:32:52,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-16 00:32:52,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-11-16 00:32:52,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-16 00:32:52,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2019-11-16 00:32:52,176 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 61 [2019-11-16 00:32:52,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:52,176 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2019-11-16 00:32:52,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-16 00:32:52,177 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2019-11-16 00:32:52,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-16 00:32:52,177 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:52,177 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:32:52,377 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:32:52,378 INFO L410 AbstractCegarLoop]: === Iteration 36 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:32:52,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:52,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1003947369, now seen corresponding path program 6 times [2019-11-16 00:32:52,378 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:52,378 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303768196] [2019-11-16 00:32:52,378 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:52,378 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:52,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:52,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:52,681 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2019-11-16 00:32:52,810 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2019-11-16 00:32:53,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:53,689 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 4 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:32:53,689 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303768196] [2019-11-16 00:32:53,689 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156737481] [2019-11-16 00:32:53,690 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b55077e7-56fe-4ddb-adad-612452c1bc30/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:32:53,850 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-11-16 00:32:53,850 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:32:53,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 70 conjunts are in the unsatisfiable core [2019-11-16 00:32:53,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:32:53,858 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 10 treesize of output 8 [2019-11-16 00:32:53,858 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:32:53,864 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:32:53,864 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:32:53,864 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2019-11-16 00:32:54,173 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2019-11-16 00:32:54,173 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:32:54,182 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:32:54,182 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-16 00:32:54,183 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:27 [2019-11-16 00:32:54,245 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2019-11-16 00:32:54,246 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:32:54,256 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:32:54,256 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-16 00:32:54,257 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:33 [2019-11-16 00:32:54,798 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:32:54,799 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2019-11-16 00:32:54,800 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:32:54,811 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:32:54,812 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:32:54,812 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:36, output treesize:3 [2019-11-16 00:32:54,840 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 4 proven. 65 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:32:54,841 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:32:54,841 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 19] total 44 [2019-11-16 00:32:54,841 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833451915] [2019-11-16 00:32:54,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-11-16 00:32:54,842 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:54,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-11-16 00:32:54,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1777, Unknown=0, NotChecked=0, Total=1892 [2019-11-16 00:32:54,844 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand 44 states. [2019-11-16 00:32:58,652 WARN L191 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-11-16 00:33:02,481 WARN L191 SmtUtils]: Spent 3.65 s on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-11-16 00:33:06,725 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-11-16 00:33:10,918 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-11-16 00:33:14,944 WARN L191 SmtUtils]: Spent 3.91 s on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-11-16 00:33:19,130 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-11-16 00:33:23,068 WARN L191 SmtUtils]: Spent 3.83 s on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-11-16 00:33:25,774 WARN L191 SmtUtils]: Spent 2.61 s on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-11-16 00:33:29,947 WARN L191 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-11-16 00:33:30,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:33:30,321 INFO L93 Difference]: Finished difference Result 153 states and 157 transitions. [2019-11-16 00:33:30,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-11-16 00:33:30,321 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 65 [2019-11-16 00:33:30,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:33:30,322 INFO L225 Difference]: With dead ends: 153 [2019-11-16 00:33:30,322 INFO L226 Difference]: Without dead ends: 76 [2019-11-16 00:33:30,324 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1111 ImplicationChecksByTransitivity, 36.0s TimeCoverageRelationStatistics Valid=424, Invalid=5126, Unknown=0, NotChecked=0, Total=5550 [2019-11-16 00:33:30,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-16 00:33:30,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2019-11-16 00:33:30,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-16 00:33:30,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2019-11-16 00:33:30,326 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 65 [2019-11-16 00:33:30,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:33:30,326 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2019-11-16 00:33:30,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-11-16 00:33:30,326 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2019-11-16 00:33:30,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-16 00:33:30,327 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:33:30,327 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:33:30,530 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:33:30,531 INFO L410 AbstractCegarLoop]: === Iteration 37 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:33:30,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:30,531 INFO L82 PathProgramCache]: Analyzing trace with hash 701036058, now seen corresponding path program 7 times [2019-11-16 00:33:30,531 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:33:30,532 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519053997] [2019-11-16 00:33:30,532 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:30,532 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:30,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:33:30,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:30,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:30,781 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 17 proven. 51 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-16 00:33:30,781 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519053997] [2019-11-16 00:33:30,781 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377673784] [2019-11-16 00:33:30,782 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b55077e7-56fe-4ddb-adad-612452c1bc30/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:33:30,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:30,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 45 conjunts are in the unsatisfiable core [2019-11-16 00:33:30,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:31,220 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 15 proven. 53 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-16 00:33:31,221 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:33:31,221 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 30 [2019-11-16 00:33:31,221 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650556297] [2019-11-16 00:33:31,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-16 00:33:31,221 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:33:31,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-16 00:33:31,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=814, Unknown=0, NotChecked=0, Total=930 [2019-11-16 00:33:31,222 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 31 states. [2019-11-16 00:33:31,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:33:31,982 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2019-11-16 00:33:31,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-16 00:33:31,982 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 69 [2019-11-16 00:33:31,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:33:31,983 INFO L225 Difference]: With dead ends: 81 [2019-11-16 00:33:31,983 INFO L226 Difference]: Without dead ends: 81 [2019-11-16 00:33:31,984 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=247, Invalid=1559, Unknown=0, NotChecked=0, Total=1806 [2019-11-16 00:33:31,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-11-16 00:33:31,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2019-11-16 00:33:31,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-16 00:33:31,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2019-11-16 00:33:31,986 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 69 [2019-11-16 00:33:31,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:33:31,986 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2019-11-16 00:33:31,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-16 00:33:31,986 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2019-11-16 00:33:31,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-16 00:33:31,987 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:33:31,987 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:33:32,189 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:33:32,190 INFO L410 AbstractCegarLoop]: === Iteration 38 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:33:32,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:32,190 INFO L82 PathProgramCache]: Analyzing trace with hash -614215269, now seen corresponding path program 4 times [2019-11-16 00:33:32,191 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:33:32,191 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403882045] [2019-11-16 00:33:32,191 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:32,191 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:32,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:33:32,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:32,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:32,854 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 15 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:33:32,854 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403882045] [2019-11-16 00:33:32,854 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795508338] [2019-11-16 00:33:32,854 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b55077e7-56fe-4ddb-adad-612452c1bc30/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:33:32,992 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-16 00:33:32,992 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:33:32,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 74 conjunts are in the unsatisfiable core [2019-11-16 00:33:32,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:33,006 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:33:33,007 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-16 00:33:33,007 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:33:33,020 INFO L567 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-16 00:33:33,021 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:33:33,021 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-11-16 00:33:33,224 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-16 00:33:33,224 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:33:33,241 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:33:33,241 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:33:33,242 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-11-16 00:33:33,620 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-16 00:33:33,620 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-16 00:33:33,633 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:33:33,634 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-16 00:33:33,634 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:35 [2019-11-16 00:33:33,803 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:33:33,817 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:33:33,817 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 39 [2019-11-16 00:33:33,818 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:33:33,832 INFO L567 ElimStorePlain]: treesize reduction 26, result has 36.6 percent of original size [2019-11-16 00:33:33,832 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:33:33,832 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:39, output treesize:3 [2019-11-16 00:33:33,880 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 34 proven. 29 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-16 00:33:33,880 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:33:33,880 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 20] total 44 [2019-11-16 00:33:33,880 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937162868] [2019-11-16 00:33:33,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-11-16 00:33:33,881 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:33:33,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-11-16 00:33:33,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1755, Unknown=0, NotChecked=0, Total=1892 [2019-11-16 00:33:33,882 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 44 states. [2019-11-16 00:33:36,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:33:36,645 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2019-11-16 00:33:36,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-11-16 00:33:36,646 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 71 [2019-11-16 00:33:36,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:33:36,647 INFO L225 Difference]: With dead ends: 118 [2019-11-16 00:33:36,647 INFO L226 Difference]: Without dead ends: 90 [2019-11-16 00:33:36,650 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1726 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=526, Invalid=6280, Unknown=0, NotChecked=0, Total=6806 [2019-11-16 00:33:36,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-16 00:33:36,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 83. [2019-11-16 00:33:36,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-16 00:33:36,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2019-11-16 00:33:36,653 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 71 [2019-11-16 00:33:36,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:33:36,653 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2019-11-16 00:33:36,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-11-16 00:33:36,654 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2019-11-16 00:33:36,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-16 00:33:36,654 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:33:36,655 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:33:36,859 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:33:36,859 INFO L410 AbstractCegarLoop]: === Iteration 39 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:33:36,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:36,860 INFO L82 PathProgramCache]: Analyzing trace with hash -421352019, now seen corresponding path program 8 times [2019-11-16 00:33:36,860 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:33:36,860 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924660559] [2019-11-16 00:33:36,860 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:36,860 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:36,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:33:36,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:38,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:38,238 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 5 proven. 116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:33:38,238 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924660559] [2019-11-16 00:33:38,238 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736249318] [2019-11-16 00:33:38,238 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b55077e7-56fe-4ddb-adad-612452c1bc30/bin/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:33:38,407 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:33:38,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:33:38,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 107 conjunts are in the unsatisfiable core [2019-11-16 00:33:38,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:38,721 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-16 00:33:38,722 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:33:38,728 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:33:38,728 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-16 00:33:38,728 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2019-11-16 00:33:39,527 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:33:39,541 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:33:39,541 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 40 [2019-11-16 00:33:39,542 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:33:39,550 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:33:39,550 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:33:39,550 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:46, output treesize:3 [2019-11-16 00:33:39,570 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 5 proven. 88 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-16 00:33:39,570 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:33:39,570 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 23] total 51 [2019-11-16 00:33:39,570 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969397979] [2019-11-16 00:33:39,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-11-16 00:33:39,570 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:33:39,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-11-16 00:33:39,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=2396, Unknown=0, NotChecked=0, Total=2550 [2019-11-16 00:33:39,571 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand 51 states. [2019-11-16 00:33:42,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:33:42,938 INFO L93 Difference]: Finished difference Result 193 states and 198 transitions. [2019-11-16 00:33:42,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-11-16 00:33:42,939 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 79 [2019-11-16 00:33:42,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:33:42,940 INFO L225 Difference]: With dead ends: 193 [2019-11-16 00:33:42,940 INFO L226 Difference]: Without dead ends: 125 [2019-11-16 00:33:42,942 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1726 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=499, Invalid=7157, Unknown=0, NotChecked=0, Total=7656 [2019-11-16 00:33:42,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-16 00:33:42,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 87. [2019-11-16 00:33:42,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-16 00:33:42,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 90 transitions. [2019-11-16 00:33:42,944 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 90 transitions. Word has length 79 [2019-11-16 00:33:42,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:33:42,945 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 90 transitions. [2019-11-16 00:33:42,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-11-16 00:33:42,945 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2019-11-16 00:33:42,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-16 00:33:42,945 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:33:42,945 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:33:43,149 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:33:43,149 INFO L410 AbstractCegarLoop]: === Iteration 40 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:33:43,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:43,150 INFO L82 PathProgramCache]: Analyzing trace with hash 890985264, now seen corresponding path program 9 times [2019-11-16 00:33:43,150 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:33:43,150 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141145665] [2019-11-16 00:33:43,150 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:43,151 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:43,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:33:43,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:43,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:43,930 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 5 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:33:43,931 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141145665] [2019-11-16 00:33:43,931 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371972124] [2019-11-16 00:33:43,931 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b55077e7-56fe-4ddb-adad-612452c1bc30/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:33:44,156 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-11-16 00:33:44,156 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:33:44,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-16 00:33:44,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:44,162 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_31|], 1=[|v_#valid_36|]} [2019-11-16 00:33:44,165 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:33:44,166 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-16 00:33:44,166 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:33:44,172 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:33:44,175 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 10 treesize of output 8 [2019-11-16 00:33:44,176 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:33:44,181 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:33:44,181 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:33:44,182 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2019-11-16 00:33:44,218 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-11-16 00:33:44,219 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:33:44,223 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:33:44,224 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:33:44,224 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-11-16 00:33:44,258 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2019-11-16 00:33:44,259 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:33:44,267 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:33:44,267 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:33:44,268 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-11-16 00:33:44,461 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:33:44,461 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2019-11-16 00:33:44,461 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-16 00:33:44,469 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:33:44,469 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-16 00:33:44,470 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:23 [2019-11-16 00:33:44,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:33:44,573 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2019-11-16 00:33:44,573 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:33:44,573 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 9] total 33 [2019-11-16 00:33:44,573 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243216188] [2019-11-16 00:33:44,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-16 00:33:44,574 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:33:44,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-16 00:33:44,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=984, Unknown=0, NotChecked=0, Total=1056 [2019-11-16 00:33:44,574 INFO L87 Difference]: Start difference. First operand 87 states and 90 transitions. Second operand 33 states. [2019-11-16 00:33:47,756 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-11-16 00:33:49,937 WARN L191 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-11-16 00:33:50,442 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-11-16 00:33:53,915 WARN L191 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-11-16 00:33:57,995 WARN L191 SmtUtils]: Spent 4.04 s on a formula simplification that was a NOOP. DAG size: 56 [2019-11-16 00:33:58,196 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-11-16 00:33:59,123 WARN L191 SmtUtils]: Spent 571.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-11-16 00:34:01,264 WARN L191 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-11-16 00:34:01,506 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-11-16 00:34:02,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:34:02,070 INFO L93 Difference]: Finished difference Result 152 states and 156 transitions. [2019-11-16 00:34:02,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-11-16 00:34:02,070 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 83 [2019-11-16 00:34:02,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:34:02,071 INFO L225 Difference]: With dead ends: 152 [2019-11-16 00:34:02,071 INFO L226 Difference]: Without dead ends: 93 [2019-11-16 00:34:02,071 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 77 SyntacticMatches, 4 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 932 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=422, Invalid=4408, Unknown=0, NotChecked=0, Total=4830 [2019-11-16 00:34:02,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-16 00:34:02,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2019-11-16 00:34:02,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-16 00:34:02,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 93 transitions. [2019-11-16 00:34:02,074 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 93 transitions. Word has length 83 [2019-11-16 00:34:02,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:34:02,074 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 93 transitions. [2019-11-16 00:34:02,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-16 00:34:02,074 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 93 transitions. [2019-11-16 00:34:02,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-16 00:34:02,074 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:34:02,075 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:34:02,279 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:34:02,279 INFO L410 AbstractCegarLoop]: === Iteration 41 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:34:02,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:34:02,279 INFO L82 PathProgramCache]: Analyzing trace with hash 650863924, now seen corresponding path program 5 times [2019-11-16 00:34:02,279 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:34:02,280 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273360180] [2019-11-16 00:34:02,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:34:02,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:34:02,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:34:02,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:02,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:02,608 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 30 proven. 90 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-16 00:34:02,609 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273360180] [2019-11-16 00:34:02,609 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423941075] [2019-11-16 00:34:02,609 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b55077e7-56fe-4ddb-adad-612452c1bc30/bin/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:34:02,852 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-16 00:34:02,853 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:34:02,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 66 conjunts are in the unsatisfiable core [2019-11-16 00:34:02,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:34:02,872 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:34:02,872 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-16 00:34:02,872 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:34:02,901 INFO L567 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-16 00:34:02,901 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:34:02,901 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-11-16 00:34:03,368 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 28 proven. 92 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-16 00:34:03,368 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:34:03,369 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 31 [2019-11-16 00:34:03,369 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186198935] [2019-11-16 00:34:03,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-16 00:34:03,370 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:34:03,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-16 00:34:03,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=871, Unknown=0, NotChecked=0, Total=992 [2019-11-16 00:34:03,370 INFO L87 Difference]: Start difference. First operand 90 states and 93 transitions. Second operand 32 states. [2019-11-16 00:34:04,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:34:04,053 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2019-11-16 00:34:04,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-16 00:34:04,053 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 89 [2019-11-16 00:34:04,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:34:04,054 INFO L225 Difference]: With dead ends: 97 [2019-11-16 00:34:04,054 INFO L226 Difference]: Without dead ends: 97 [2019-11-16 00:34:04,054 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=198, Invalid=1524, Unknown=0, NotChecked=0, Total=1722 [2019-11-16 00:34:04,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-11-16 00:34:04,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2019-11-16 00:34:04,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-16 00:34:04,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 99 transitions. [2019-11-16 00:34:04,056 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 99 transitions. Word has length 89 [2019-11-16 00:34:04,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:34:04,056 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 99 transitions. [2019-11-16 00:34:04,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-16 00:34:04,056 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 99 transitions. [2019-11-16 00:34:04,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-16 00:34:04,057 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:34:04,057 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:34:04,257 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:34:04,257 INFO L410 AbstractCegarLoop]: === Iteration 42 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:34:04,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:34:04,258 INFO L82 PathProgramCache]: Analyzing trace with hash -264733948, now seen corresponding path program 6 times [2019-11-16 00:34:04,258 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:34:04,260 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166006706] [2019-11-16 00:34:04,260 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:34:04,260 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:34:04,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:34:04,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:04,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:04,684 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 82 proven. 71 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-16 00:34:04,685 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166006706] [2019-11-16 00:34:04,685 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540334844] [2019-11-16 00:34:04,685 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b55077e7-56fe-4ddb-adad-612452c1bc30/bin/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:34:05,014 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-11-16 00:34:05,015 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:34:05,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 57 conjunts are in the unsatisfiable core [2019-11-16 00:34:05,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:34:05,023 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_33|], 1=[|v_#valid_37|]} [2019-11-16 00:34:05,026 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:34:05,027 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-16 00:34:05,027 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:34:05,037 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:34:05,042 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 10 treesize of output 8 [2019-11-16 00:34:05,042 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:34:05,056 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:34:05,056 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:34:05,056 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2019-11-16 00:34:05,515 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 108 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-16 00:34:05,516 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:34:05,516 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 36 [2019-11-16 00:34:05,516 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144300298] [2019-11-16 00:34:05,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-11-16 00:34:05,516 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:34:05,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-11-16 00:34:05,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1071, Unknown=0, NotChecked=0, Total=1260 [2019-11-16 00:34:05,517 INFO L87 Difference]: Start difference. First operand 96 states and 99 transitions. Second operand 36 states. [2019-11-16 00:34:06,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:34:06,142 INFO L93 Difference]: Finished difference Result 166 states and 170 transitions. [2019-11-16 00:34:06,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-16 00:34:06,142 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 95 [2019-11-16 00:34:06,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:34:06,143 INFO L225 Difference]: With dead ends: 166 [2019-11-16 00:34:06,143 INFO L226 Difference]: Without dead ends: 103 [2019-11-16 00:34:06,144 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=345, Invalid=1817, Unknown=0, NotChecked=0, Total=2162 [2019-11-16 00:34:06,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-16 00:34:06,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2019-11-16 00:34:06,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-16 00:34:06,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 103 transitions. [2019-11-16 00:34:06,147 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 103 transitions. Word has length 95 [2019-11-16 00:34:06,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:34:06,147 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 103 transitions. [2019-11-16 00:34:06,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-11-16 00:34:06,147 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 103 transitions. [2019-11-16 00:34:06,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-16 00:34:06,148 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:34:06,148 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:34:06,353 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:34:06,353 INFO L410 AbstractCegarLoop]: === Iteration 43 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:34:06,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:34:06,353 INFO L82 PathProgramCache]: Analyzing trace with hash -452087993, now seen corresponding path program 7 times [2019-11-16 00:34:06,353 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:34:06,353 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227141356] [2019-11-16 00:34:06,354 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:34:06,354 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:34:06,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:34:06,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:07,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:07,426 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 18 proven. 201 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:34:07,426 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227141356] [2019-11-16 00:34:07,427 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030383435] [2019-11-16 00:34:07,427 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b55077e7-56fe-4ddb-adad-612452c1bc30/bin/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:34:07,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:07,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 117 conjunts are in the unsatisfiable core [2019-11-16 00:34:07,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:34:07,871 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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-16 00:34:07,871 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:34:07,877 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:34:07,878 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-16 00:34:07,878 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-11-16 00:34:08,156 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-16 00:34:08,157 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:34:08,161 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:34:08,161 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-16 00:34:08,162 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-16 00:34:08,174 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 18 proven. 135 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-16 00:34:08,174 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:34:08,174 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 23] total 44 [2019-11-16 00:34:08,174 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613546474] [2019-11-16 00:34:08,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-11-16 00:34:08,175 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:34:08,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-11-16 00:34:08,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1774, Unknown=0, NotChecked=0, Total=1892 [2019-11-16 00:34:08,176 INFO L87 Difference]: Start difference. First operand 100 states and 103 transitions. Second operand 44 states. [2019-11-16 00:34:10,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:34:10,771 INFO L93 Difference]: Finished difference Result 150 states and 153 transitions. [2019-11-16 00:34:10,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-11-16 00:34:10,772 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 99 [2019-11-16 00:34:10,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:34:10,773 INFO L225 Difference]: With dead ends: 150 [2019-11-16 00:34:10,773 INFO L226 Difference]: Without dead ends: 110 [2019-11-16 00:34:10,773 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 87 SyntacticMatches, 4 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 922 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=319, Invalid=4511, Unknown=0, NotChecked=0, Total=4830 [2019-11-16 00:34:10,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-11-16 00:34:10,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 104. [2019-11-16 00:34:10,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-16 00:34:10,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 107 transitions. [2019-11-16 00:34:10,775 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 107 transitions. Word has length 99 [2019-11-16 00:34:10,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:34:10,775 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 107 transitions. [2019-11-16 00:34:10,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-11-16 00:34:10,776 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 107 transitions. [2019-11-16 00:34:10,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-16 00:34:10,776 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:34:10,776 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:34:10,976 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:34:10,977 INFO L410 AbstractCegarLoop]: === Iteration 44 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:34:10,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:34:10,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1035648330, now seen corresponding path program 8 times [2019-11-16 00:34:10,977 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:34:10,977 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230334985] [2019-11-16 00:34:10,977 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:34:10,977 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:34:10,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:34:10,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:11,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:11,306 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 47 proven. 127 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-16 00:34:11,306 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230334985] [2019-11-16 00:34:11,306 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187564954] [2019-11-16 00:34:11,306 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b55077e7-56fe-4ddb-adad-612452c1bc30/bin/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:34:11,496 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:34:11,497 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:34:11,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 71 conjunts are in the unsatisfiable core [2019-11-16 00:34:11,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:34:11,512 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:34:11,512 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-16 00:34:11,512 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:34:11,526 INFO L567 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-16 00:34:11,527 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:34:11,527 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-11-16 00:34:12,050 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 45 proven. 129 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-16 00:34:12,050 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:34:12,051 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 39 [2019-11-16 00:34:12,051 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465161267] [2019-11-16 00:34:12,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-11-16 00:34:12,051 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:34:12,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-11-16 00:34:12,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1428, Unknown=0, NotChecked=0, Total=1560 [2019-11-16 00:34:12,052 INFO L87 Difference]: Start difference. First operand 104 states and 107 transitions. Second operand 40 states. [2019-11-16 00:34:13,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:34:13,208 INFO L93 Difference]: Finished difference Result 111 states and 114 transitions. [2019-11-16 00:34:13,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-16 00:34:13,208 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 103 [2019-11-16 00:34:13,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:34:13,209 INFO L225 Difference]: With dead ends: 111 [2019-11-16 00:34:13,209 INFO L226 Difference]: Without dead ends: 111 [2019-11-16 00:34:13,210 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 785 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=329, Invalid=2977, Unknown=0, NotChecked=0, Total=3306 [2019-11-16 00:34:13,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-16 00:34:13,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2019-11-16 00:34:13,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-16 00:34:13,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 113 transitions. [2019-11-16 00:34:13,212 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 113 transitions. Word has length 103 [2019-11-16 00:34:13,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:34:13,212 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 113 transitions. [2019-11-16 00:34:13,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-11-16 00:34:13,212 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 113 transitions. [2019-11-16 00:34:13,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-16 00:34:13,212 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:34:13,212 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:34:13,413 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:34:13,413 INFO L410 AbstractCegarLoop]: === Iteration 45 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:34:13,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:34:13,413 INFO L82 PathProgramCache]: Analyzing trace with hash -2012288358, now seen corresponding path program 9 times [2019-11-16 00:34:13,413 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:34:13,413 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401500644] [2019-11-16 00:34:13,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:34:13,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:34:13,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:34:13,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:13,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:13,770 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 116 proven. 97 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-16 00:34:13,770 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401500644] [2019-11-16 00:34:13,770 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96485310] [2019-11-16 00:34:13,770 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b55077e7-56fe-4ddb-adad-612452c1bc30/bin/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:34:14,164 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-11-16 00:34:14,164 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:34:14,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 99 conjunts are in the unsatisfiable core [2019-11-16 00:34:14,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:34:14,437 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-16 00:34:14,437 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:34:14,449 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:34:14,449 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-16 00:34:14,450 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2019-11-16 00:34:15,169 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:34:15,182 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:34:15,183 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 39 [2019-11-16 00:34:15,183 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:34:15,192 INFO L567 ElimStorePlain]: treesize reduction 14, result has 41.7 percent of original size [2019-11-16 00:34:15,193 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:34:15,193 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:34, output treesize:3 [2019-11-16 00:34:15,273 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 21 proven. 192 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-16 00:34:15,274 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:34:15,274 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 26] total 47 [2019-11-16 00:34:15,274 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849555485] [2019-11-16 00:34:15,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-11-16 00:34:15,274 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:34:15,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-11-16 00:34:15,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=2007, Unknown=0, NotChecked=0, Total=2162 [2019-11-16 00:34:15,275 INFO L87 Difference]: Start difference. First operand 110 states and 113 transitions. Second operand 47 states. [2019-11-16 00:34:19,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:34:19,091 INFO L93 Difference]: Finished difference Result 296 states and 300 transitions. [2019-11-16 00:34:19,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-11-16 00:34:19,092 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 109 [2019-11-16 00:34:19,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:34:19,092 INFO L225 Difference]: With dead ends: 296 [2019-11-16 00:34:19,092 INFO L226 Difference]: Without dead ends: 124 [2019-11-16 00:34:19,093 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3382 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=912, Invalid=11298, Unknown=0, NotChecked=0, Total=12210 [2019-11-16 00:34:19,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-11-16 00:34:19,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 118. [2019-11-16 00:34:19,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-16 00:34:19,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 121 transitions. [2019-11-16 00:34:19,096 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 121 transitions. Word has length 109 [2019-11-16 00:34:19,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:34:19,096 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 121 transitions. [2019-11-16 00:34:19,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-11-16 00:34:19,097 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 121 transitions. [2019-11-16 00:34:19,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-16 00:34:19,097 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:34:19,097 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:34:19,298 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:34:19,298 INFO L410 AbstractCegarLoop]: === Iteration 46 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:34:19,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:34:19,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1510450592, now seen corresponding path program 10 times [2019-11-16 00:34:19,299 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:34:19,299 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48837361] [2019-11-16 00:34:19,299 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:34:19,299 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:34:19,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:34:19,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:19,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:19,814 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 68 proven. 170 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-11-16 00:34:19,814 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48837361] [2019-11-16 00:34:19,814 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300816158] [2019-11-16 00:34:19,814 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b55077e7-56fe-4ddb-adad-612452c1bc30/bin/uautomizer/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:34:20,032 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-16 00:34:20,032 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:34:20,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 142 conjunts are in the unsatisfiable core [2019-11-16 00:34:20,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:34:20,057 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:34:20,057 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-16 00:34:20,057 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:34:20,071 INFO L567 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-16 00:34:20,071 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:34:20,071 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-11-16 00:34:20,328 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-16 00:34:20,328 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:34:20,333 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:34:20,333 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:34:20,333 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2019-11-16 00:34:20,947 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:34:20,948 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 54 [2019-11-16 00:34:20,948 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:34:20,964 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:34:20,964 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:34:20,964 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:42 [2019-11-16 00:34:21,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:34:21,189 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 72 proven. 166 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-11-16 00:34:21,189 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:34:21,189 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 27] total 49 [2019-11-16 00:34:21,189 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416253259] [2019-11-16 00:34:21,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-11-16 00:34:21,190 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:34:21,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-11-16 00:34:21,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=2251, Unknown=0, NotChecked=0, Total=2450 [2019-11-16 00:34:21,190 INFO L87 Difference]: Start difference. First operand 118 states and 121 transitions. Second operand 50 states. [2019-11-16 00:34:23,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:34:23,421 INFO L93 Difference]: Finished difference Result 125 states and 128 transitions. [2019-11-16 00:34:23,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-16 00:34:23,426 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 117 [2019-11-16 00:34:23,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:34:23,426 INFO L225 Difference]: With dead ends: 125 [2019-11-16 00:34:23,427 INFO L226 Difference]: Without dead ends: 125 [2019-11-16 00:34:23,427 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 999 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=418, Invalid=4274, Unknown=0, NotChecked=0, Total=4692 [2019-11-16 00:34:23,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-16 00:34:23,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2019-11-16 00:34:23,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-16 00:34:23,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 127 transitions. [2019-11-16 00:34:23,429 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 127 transitions. Word has length 117 [2019-11-16 00:34:23,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:34:23,429 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 127 transitions. [2019-11-16 00:34:23,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-11-16 00:34:23,430 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 127 transitions. [2019-11-16 00:34:23,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-16 00:34:23,430 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:34:23,430 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:34:23,631 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:34:23,631 INFO L410 AbstractCegarLoop]: === Iteration 47 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:34:23,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:34:23,632 INFO L82 PathProgramCache]: Analyzing trace with hash -861151440, now seen corresponding path program 11 times [2019-11-16 00:34:23,632 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:34:23,632 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657507073] [2019-11-16 00:34:23,632 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:34:23,632 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:34:23,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:34:23,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:24,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:24,131 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 156 proven. 127 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-11-16 00:34:24,131 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657507073] [2019-11-16 00:34:24,131 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882418956] [2019-11-16 00:34:24,131 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b55077e7-56fe-4ddb-adad-612452c1bc30/bin/uautomizer/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:34:24,601 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2019-11-16 00:34:24,602 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:34:24,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 71 conjunts are in the unsatisfiable core [2019-11-16 00:34:24,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:34:24,614 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_36|], 1=[|v_#valid_38|]} [2019-11-16 00:34:24,618 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:34:24,619 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-16 00:34:24,619 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:34:24,633 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:34:24,638 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 10 treesize of output 8 [2019-11-16 00:34:24,638 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:34:24,649 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:34:24,649 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:34:24,649 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2019-11-16 00:34:25,239 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 192 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-11-16 00:34:25,239 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:34:25,239 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21] total 43 [2019-11-16 00:34:25,239 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129559201] [2019-11-16 00:34:25,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-11-16 00:34:25,239 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:34:25,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-11-16 00:34:25,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=1525, Unknown=0, NotChecked=0, Total=1806 [2019-11-16 00:34:25,240 INFO L87 Difference]: Start difference. First operand 124 states and 127 transitions. Second operand 43 states. [2019-11-16 00:34:26,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:34:26,088 INFO L93 Difference]: Finished difference Result 214 states and 218 transitions. [2019-11-16 00:34:26,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-16 00:34:26,088 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 123 [2019-11-16 00:34:26,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:34:26,089 INFO L225 Difference]: With dead ends: 214 [2019-11-16 00:34:26,089 INFO L226 Difference]: Without dead ends: 131 [2019-11-16 00:34:26,090 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=468, Invalid=2502, Unknown=0, NotChecked=0, Total=2970 [2019-11-16 00:34:26,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-16 00:34:26,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 128. [2019-11-16 00:34:26,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-11-16 00:34:26,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 131 transitions. [2019-11-16 00:34:26,093 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 131 transitions. Word has length 123 [2019-11-16 00:34:26,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:34:26,093 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 131 transitions. [2019-11-16 00:34:26,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-11-16 00:34:26,093 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 131 transitions. [2019-11-16 00:34:26,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-16 00:34:26,094 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:34:26,094 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:34:26,294 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:34:26,295 INFO L410 AbstractCegarLoop]: === Iteration 48 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:34:26,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:34:26,295 INFO L82 PathProgramCache]: Analyzing trace with hash -363601677, now seen corresponding path program 12 times [2019-11-16 00:34:26,295 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:34:26,295 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518233961] [2019-11-16 00:34:26,295 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:34:26,295 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:34:26,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:34:26,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:27,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:27,636 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 91 proven. 312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:34:27,636 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518233961] [2019-11-16 00:34:27,636 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439760374] [2019-11-16 00:34:27,636 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b55077e7-56fe-4ddb-adad-612452c1bc30/bin/uautomizer/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:34:28,377 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-11-16 00:34:28,377 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:34:28,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 158 conjunts are in the unsatisfiable core [2019-11-16 00:34:28,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:34:29,532 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-16 00:34:29,532 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:34:29,538 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:34:29,538 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-16 00:34:29,538 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2019-11-16 00:34:30,588 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:34:30,606 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:34:30,607 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 39 [2019-11-16 00:34:30,607 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:34:30,612 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:34:30,613 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:34:30,613 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:34, output treesize:3 [2019-11-16 00:34:30,743 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 24 proven. 378 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:34:30,743 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:34:30,744 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 35] total 70 [2019-11-16 00:34:30,744 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404337608] [2019-11-16 00:34:30,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-11-16 00:34:30,744 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:34:30,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-11-16 00:34:30,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=4554, Unknown=0, NotChecked=0, Total=4830 [2019-11-16 00:34:30,745 INFO L87 Difference]: Start difference. First operand 128 states and 131 transitions. Second operand 70 states. [2019-11-16 00:34:34,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:34:34,942 INFO L93 Difference]: Finished difference Result 197 states and 200 transitions. [2019-11-16 00:34:34,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-11-16 00:34:34,943 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 127 [2019-11-16 00:34:34,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:34:34,943 INFO L225 Difference]: With dead ends: 197 [2019-11-16 00:34:34,944 INFO L226 Difference]: Without dead ends: 145 [2019-11-16 00:34:34,944 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3318 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=630, Invalid=11802, Unknown=0, NotChecked=0, Total=12432 [2019-11-16 00:34:34,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-11-16 00:34:34,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 138. [2019-11-16 00:34:34,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-11-16 00:34:34,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 141 transitions. [2019-11-16 00:34:34,947 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 141 transitions. Word has length 127 [2019-11-16 00:34:34,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:34:34,948 INFO L462 AbstractCegarLoop]: Abstraction has 138 states and 141 transitions. [2019-11-16 00:34:34,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-11-16 00:34:34,948 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 141 transitions. [2019-11-16 00:34:34,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-16 00:34:34,949 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:34:34,949 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:34:35,149 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:34:35,149 INFO L410 AbstractCegarLoop]: === Iteration 49 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:34:35,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:34:35,150 INFO L82 PathProgramCache]: Analyzing trace with hash -265684794, now seen corresponding path program 13 times [2019-11-16 00:34:35,150 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:34:35,150 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422557731] [2019-11-16 00:34:35,150 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:34:35,150 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:34:35,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:34:35,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:35,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:35,803 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 202 proven. 161 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-11-16 00:34:35,804 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422557731] [2019-11-16 00:34:35,804 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292278610] [2019-11-16 00:34:35,804 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b55077e7-56fe-4ddb-adad-612452c1bc30/bin/uautomizer/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:34:36,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:36,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 76 conjunts are in the unsatisfiable core [2019-11-16 00:34:36,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:34:36,078 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_37|], 1=[|v_#valid_39|]} [2019-11-16 00:34:36,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:34:36,082 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-16 00:34:36,082 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:34:36,090 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:34:36,095 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 10 treesize of output 8 [2019-11-16 00:34:36,095 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:34:36,103 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:34:36,103 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:34:36,103 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2019-11-16 00:34:36,911 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 235 proven. 128 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-11-16 00:34:36,911 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:34:36,911 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 24] total 49 [2019-11-16 00:34:36,911 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164522697] [2019-11-16 00:34:36,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-11-16 00:34:36,912 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:34:36,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-11-16 00:34:36,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=1998, Unknown=0, NotChecked=0, Total=2352 [2019-11-16 00:34:36,913 INFO L87 Difference]: Start difference. First operand 138 states and 141 transitions. Second operand 49 states. [2019-11-16 00:34:37,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:34:37,928 INFO L93 Difference]: Finished difference Result 238 states and 242 transitions. [2019-11-16 00:34:37,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-16 00:34:37,928 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 137 [2019-11-16 00:34:37,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:34:37,929 INFO L225 Difference]: With dead ends: 238 [2019-11-16 00:34:37,929 INFO L226 Difference]: Without dead ends: 145 [2019-11-16 00:34:37,930 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 978 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=800, Invalid=4030, Unknown=0, NotChecked=0, Total=4830 [2019-11-16 00:34:37,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-11-16 00:34:37,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 142. [2019-11-16 00:34:37,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-11-16 00:34:37,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 145 transitions. [2019-11-16 00:34:37,934 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 145 transitions. Word has length 137 [2019-11-16 00:34:37,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:34:37,934 INFO L462 AbstractCegarLoop]: Abstraction has 142 states and 145 transitions. [2019-11-16 00:34:37,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-11-16 00:34:37,934 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 145 transitions. [2019-11-16 00:34:37,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-16 00:34:37,935 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:34:37,935 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:34:38,135 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:34:38,135 INFO L410 AbstractCegarLoop]: === Iteration 50 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:34:38,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:34:38,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1432234313, now seen corresponding path program 14 times [2019-11-16 00:34:38,136 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:34:38,136 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177479474] [2019-11-16 00:34:38,136 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:34:38,136 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:34:38,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:34:38,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:39,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:39,639 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 120 proven. 396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:34:39,640 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177479474] [2019-11-16 00:34:39,640 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691476560] [2019-11-16 00:34:39,640 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b55077e7-56fe-4ddb-adad-612452c1bc30/bin/uautomizer/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:34:39,865 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:34:39,865 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:34:39,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 179 conjunts are in the unsatisfiable core [2019-11-16 00:34:39,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:34:40,395 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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-16 00:34:40,395 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:34:40,401 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:34:40,402 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-16 00:34:40,402 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2019-11-16 00:34:41,686 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:34:41,700 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:34:41,700 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 40 [2019-11-16 00:34:41,700 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:34:41,708 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:34:41,708 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:34:41,709 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:46, output treesize:3 [2019-11-16 00:34:41,818 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 27 proven. 336 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-11-16 00:34:41,818 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:34:41,818 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 31] total 70 [2019-11-16 00:34:41,818 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345015291] [2019-11-16 00:34:41,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-11-16 00:34:41,819 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:34:41,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-11-16 00:34:41,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=4583, Unknown=0, NotChecked=0, Total=4830 [2019-11-16 00:34:41,819 INFO L87 Difference]: Start difference. First operand 142 states and 145 transitions. Second operand 70 states. [2019-11-16 00:34:47,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:34:47,556 INFO L93 Difference]: Finished difference Result 217 states and 220 transitions. [2019-11-16 00:34:47,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-11-16 00:34:47,557 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 141 [2019-11-16 00:34:47,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:34:47,558 INFO L225 Difference]: With dead ends: 217 [2019-11-16 00:34:47,558 INFO L226 Difference]: Without dead ends: 159 [2019-11-16 00:34:47,559 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3471 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=699, Invalid=12873, Unknown=0, NotChecked=0, Total=13572 [2019-11-16 00:34:47,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-16 00:34:47,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 152. [2019-11-16 00:34:47,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-16 00:34:47,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 155 transitions. [2019-11-16 00:34:47,561 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 155 transitions. Word has length 141 [2019-11-16 00:34:47,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:34:47,561 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 155 transitions. [2019-11-16 00:34:47,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-11-16 00:34:47,562 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 155 transitions. [2019-11-16 00:34:47,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-16 00:34:47,562 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:34:47,562 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:34:47,767 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:34:47,767 INFO L410 AbstractCegarLoop]: === Iteration 51 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:34:47,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:34:47,767 INFO L82 PathProgramCache]: Analyzing trace with hash 679728988, now seen corresponding path program 15 times [2019-11-16 00:34:47,767 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:34:47,767 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747440791] [2019-11-16 00:34:47,767 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:34:47,768 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:34:47,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:34:47,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:48,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:48,335 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 254 proven. 199 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-11-16 00:34:48,335 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747440791] [2019-11-16 00:34:48,335 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839568820] [2019-11-16 00:34:48,335 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b55077e7-56fe-4ddb-adad-612452c1bc30/bin/uautomizer/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:34:49,560 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-11-16 00:34:49,561 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:34:49,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 676 conjuncts, 142 conjunts are in the unsatisfiable core [2019-11-16 00:34:49,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:34:49,572 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_38|], 1=[|v_#valid_40|]} [2019-11-16 00:34:49,575 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:34:49,576 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-16 00:34:49,576 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:34:49,584 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:34:49,588 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 10 treesize of output 8 [2019-11-16 00:34:49,588 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:34:49,595 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:34:49,596 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:34:49,596 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2019-11-16 00:34:51,174 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 164 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:34:51,174 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:34:51,174 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 39] total 66 [2019-11-16 00:34:51,174 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666349127] [2019-11-16 00:34:51,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-11-16 00:34:51,175 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:34:51,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-11-16 00:34:51,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=3881, Unknown=0, NotChecked=0, Total=4290 [2019-11-16 00:34:51,175 INFO L87 Difference]: Start difference. First operand 152 states and 155 transitions. Second operand 66 states. [2019-11-16 00:34:55,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:34:55,365 INFO L93 Difference]: Finished difference Result 334 states and 338 transitions. [2019-11-16 00:34:55,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-11-16 00:34:55,366 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 151 [2019-11-16 00:34:55,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:34:55,367 INFO L225 Difference]: With dead ends: 334 [2019-11-16 00:34:55,367 INFO L226 Difference]: Without dead ends: 159 [2019-11-16 00:34:55,367 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3713 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1103, Invalid=10239, Unknown=0, NotChecked=0, Total=11342 [2019-11-16 00:34:55,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-16 00:34:55,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 156. [2019-11-16 00:34:55,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-11-16 00:34:55,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 159 transitions. [2019-11-16 00:34:55,369 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 159 transitions. Word has length 151 [2019-11-16 00:34:55,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:34:55,370 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 159 transitions. [2019-11-16 00:34:55,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-11-16 00:34:55,370 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 159 transitions. [2019-11-16 00:34:55,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-16 00:34:55,371 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:34:55,371 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:34:55,571 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:34:55,571 INFO L410 AbstractCegarLoop]: === Iteration 52 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:34:55,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:34:55,572 INFO L82 PathProgramCache]: Analyzing trace with hash -2115279201, now seen corresponding path program 16 times [2019-11-16 00:34:55,572 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:34:55,572 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988958601] [2019-11-16 00:34:55,572 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:34:55,572 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:34:55,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:34:55,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:57,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:57,185 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 153 proven. 490 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:34:57,185 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988958601] [2019-11-16 00:34:57,186 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681053729] [2019-11-16 00:34:57,186 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b55077e7-56fe-4ddb-adad-612452c1bc30/bin/uautomizer/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:34:57,418 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-16 00:34:57,419 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:34:57,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 166 conjunts are in the unsatisfiable core [2019-11-16 00:34:57,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:34:57,435 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:34:57,435 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-16 00:34:57,436 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:34:57,449 INFO L567 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-16 00:34:57,449 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:34:57,449 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-11-16 00:34:58,032 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-16 00:34:58,033 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:34:58,037 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:34:58,037 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:34:58,037 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-11-16 00:34:58,913 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-16 00:34:58,914 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-16 00:34:58,931 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:34:58,932 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-16 00:34:58,932 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:35 [2019-11-16 00:34:59,101 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:34:59,114 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:34:59,114 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 39 [2019-11-16 00:34:59,115 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:34:59,129 INFO L567 ElimStorePlain]: treesize reduction 26, result has 36.6 percent of original size [2019-11-16 00:34:59,129 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:34:59,129 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:39, output treesize:3 [2019-11-16 00:34:59,242 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 256 proven. 197 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-11-16 00:34:59,242 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:34:59,242 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 32] total 74 [2019-11-16 00:34:59,242 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104973113] [2019-11-16 00:34:59,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-11-16 00:34:59,243 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:34:59,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-11-16 00:34:59,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=5070, Unknown=0, NotChecked=0, Total=5402 [2019-11-16 00:34:59,243 INFO L87 Difference]: Start difference. First operand 156 states and 159 transitions. Second operand 74 states. [2019-11-16 00:35:06,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:35:06,402 INFO L93 Difference]: Finished difference Result 237 states and 240 transitions. [2019-11-16 00:35:06,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-11-16 00:35:06,402 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 155 [2019-11-16 00:35:06,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:35:06,403 INFO L225 Difference]: With dead ends: 237 [2019-11-16 00:35:06,403 INFO L226 Difference]: Without dead ends: 173 [2019-11-16 00:35:06,405 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5523 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=1200, Invalid=19392, Unknown=0, NotChecked=0, Total=20592 [2019-11-16 00:35:06,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-11-16 00:35:06,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 166. [2019-11-16 00:35:06,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-11-16 00:35:06,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 169 transitions. [2019-11-16 00:35:06,407 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 169 transitions. Word has length 155 [2019-11-16 00:35:06,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:35:06,408 INFO L462 AbstractCegarLoop]: Abstraction has 166 states and 169 transitions. [2019-11-16 00:35:06,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-11-16 00:35:06,408 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 169 transitions. [2019-11-16 00:35:06,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-16 00:35:06,409 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:35:06,409 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:35:06,609 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:35:06,610 INFO L410 AbstractCegarLoop]: === Iteration 53 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:35:06,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:06,610 INFO L82 PathProgramCache]: Analyzing trace with hash -845931790, now seen corresponding path program 17 times [2019-11-16 00:35:06,610 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:06,610 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55198252] [2019-11-16 00:35:06,610 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:06,610 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:06,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:06,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:07,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:07,262 INFO L134 CoverageAnalysis]: Checked inductivity of 743 backedges. 312 proven. 241 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-11-16 00:35:07,262 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55198252] [2019-11-16 00:35:07,263 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951794282] [2019-11-16 00:35:07,263 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b55077e7-56fe-4ddb-adad-612452c1bc30/bin/uautomizer/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:35:07,791 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-11-16 00:35:07,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:35:07,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 735 conjuncts, 96 conjunts are in the unsatisfiable core [2019-11-16 00:35:07,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:35:07,806 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_40|], 1=[|v_#valid_41|]} [2019-11-16 00:35:07,819 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:35:07,819 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-16 00:35:07,819 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:35:07,827 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:35:07,837 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 10 treesize of output 8 [2019-11-16 00:35:07,838 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:35:07,846 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:35:07,847 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:35:07,847 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2019-11-16 00:35:08,280 INFO L134 CoverageAnalysis]: Checked inductivity of 743 backedges. 363 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-11-16 00:35:08,280 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:35:08,280 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 27] total 45 [2019-11-16 00:35:08,280 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129053979] [2019-11-16 00:35:08,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-11-16 00:35:08,281 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:35:08,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-11-16 00:35:08,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=1626, Unknown=0, NotChecked=0, Total=1980 [2019-11-16 00:35:08,282 INFO L87 Difference]: Start difference. First operand 166 states and 169 transitions. Second operand 45 states. [2019-11-16 00:35:09,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:35:09,833 INFO L93 Difference]: Finished difference Result 286 states and 290 transitions. [2019-11-16 00:35:09,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-16 00:35:09,833 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 165 [2019-11-16 00:35:09,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:35:09,834 INFO L225 Difference]: With dead ends: 286 [2019-11-16 00:35:09,834 INFO L226 Difference]: Without dead ends: 173 [2019-11-16 00:35:09,835 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 786 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=688, Invalid=2972, Unknown=0, NotChecked=0, Total=3660 [2019-11-16 00:35:09,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-11-16 00:35:09,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 170. [2019-11-16 00:35:09,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-11-16 00:35:09,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 173 transitions. [2019-11-16 00:35:09,837 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 173 transitions. Word has length 165 [2019-11-16 00:35:09,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:35:09,837 INFO L462 AbstractCegarLoop]: Abstraction has 170 states and 173 transitions. [2019-11-16 00:35:09,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-11-16 00:35:09,837 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 173 transitions. [2019-11-16 00:35:09,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-11-16 00:35:09,838 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:35:09,838 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:35:10,038 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:35:10,039 INFO L410 AbstractCegarLoop]: === Iteration 54 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:35:10,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:10,039 INFO L82 PathProgramCache]: Analyzing trace with hash 998390005, now seen corresponding path program 18 times [2019-11-16 00:35:10,039 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:10,039 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255392635] [2019-11-16 00:35:10,039 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:10,039 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:10,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:10,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:12,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:12,201 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 190 proven. 594 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:35:12,202 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255392635] [2019-11-16 00:35:12,202 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59728961] [2019-11-16 00:35:12,202 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b55077e7-56fe-4ddb-adad-612452c1bc30/bin/uautomizer/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:35:13,827 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2019-11-16 00:35:13,827 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:35:13,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 746 conjuncts, 243 conjunts are in the unsatisfiable core [2019-11-16 00:35:13,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:35:14,541 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-16 00:35:14,542 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:35:14,547 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:35:14,548 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-16 00:35:14,548 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2019-11-16 00:35:16,643 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:35:16,643 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 48 [2019-11-16 00:35:16,643 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:35:16,654 INFO L567 ElimStorePlain]: treesize reduction 23, result has 30.3 percent of original size [2019-11-16 00:35:16,654 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:35:16,654 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:35, output treesize:3 [2019-11-16 00:35:16,798 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 33 proven. 520 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-11-16 00:35:16,798 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:35:16,798 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 44] total 89 [2019-11-16 00:35:16,798 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393927580] [2019-11-16 00:35:16,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-11-16 00:35:16,799 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:35:16,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-11-16 00:35:16,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=7530, Unknown=0, NotChecked=0, Total=7832 [2019-11-16 00:35:16,800 INFO L87 Difference]: Start difference. First operand 170 states and 173 transitions. Second operand 89 states. [2019-11-16 00:35:24,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:35:24,321 INFO L93 Difference]: Finished difference Result 257 states and 260 transitions. [2019-11-16 00:35:24,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-11-16 00:35:24,321 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 169 [2019-11-16 00:35:24,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:35:24,323 INFO L225 Difference]: With dead ends: 257 [2019-11-16 00:35:24,323 INFO L226 Difference]: Without dead ends: 187 [2019-11-16 00:35:24,324 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7742 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=1019, Invalid=25713, Unknown=0, NotChecked=0, Total=26732 [2019-11-16 00:35:24,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-11-16 00:35:24,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 180. [2019-11-16 00:35:24,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-16 00:35:24,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 183 transitions. [2019-11-16 00:35:24,327 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 183 transitions. Word has length 169 [2019-11-16 00:35:24,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:35:24,327 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 183 transitions. [2019-11-16 00:35:24,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-11-16 00:35:24,328 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 183 transitions. [2019-11-16 00:35:24,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-11-16 00:35:24,329 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:35:24,329 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:35:24,529 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:35:24,529 INFO L410 AbstractCegarLoop]: === Iteration 55 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:35:24,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:24,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1997890440, now seen corresponding path program 19 times [2019-11-16 00:35:24,530 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:24,530 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033791627] [2019-11-16 00:35:24,530 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:24,530 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:24,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:24,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:25,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:25,197 INFO L134 CoverageAnalysis]: Checked inductivity of 894 backedges. 376 proven. 287 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-11-16 00:35:25,197 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033791627] [2019-11-16 00:35:25,197 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104262161] [2019-11-16 00:35:25,198 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b55077e7-56fe-4ddb-adad-612452c1bc30/bin/uautomizer/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:35:25,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:25,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 97 conjunts are in the unsatisfiable core [2019-11-16 00:35:25,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:35:25,479 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_41|], 1=[|v_#valid_42|]} [2019-11-16 00:35:25,481 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:35:25,482 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-16 00:35:25,482 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:35:25,488 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:35:25,491 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 10 treesize of output 8 [2019-11-16 00:35:25,492 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:35:25,497 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:35:25,498 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:35:25,498 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2019-11-16 00:35:26,431 INFO L134 CoverageAnalysis]: Checked inductivity of 894 backedges. 421 proven. 242 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-11-16 00:35:26,431 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:35:26,431 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 30] total 61 [2019-11-16 00:35:26,432 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327623047] [2019-11-16 00:35:26,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-11-16 00:35:26,432 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:35:26,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-11-16 00:35:26,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=570, Invalid=3090, Unknown=0, NotChecked=0, Total=3660 [2019-11-16 00:35:26,433 INFO L87 Difference]: Start difference. First operand 180 states and 183 transitions. Second operand 61 states. [2019-11-16 00:35:28,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:35:28,545 INFO L93 Difference]: Finished difference Result 310 states and 314 transitions. [2019-11-16 00:35:28,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-11-16 00:35:28,545 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 179 [2019-11-16 00:35:28,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:35:28,546 INFO L225 Difference]: With dead ends: 310 [2019-11-16 00:35:28,546 INFO L226 Difference]: Without dead ends: 187 [2019-11-16 00:35:28,547 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1587 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1283, Invalid=6373, Unknown=0, NotChecked=0, Total=7656 [2019-11-16 00:35:28,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-11-16 00:35:28,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 184. [2019-11-16 00:35:28,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-11-16 00:35:28,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 187 transitions. [2019-11-16 00:35:28,550 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 187 transitions. Word has length 179 [2019-11-16 00:35:28,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:35:28,550 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 187 transitions. [2019-11-16 00:35:28,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-11-16 00:35:28,550 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 187 transitions. [2019-11-16 00:35:28,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-11-16 00:35:28,551 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:35:28,551 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:35:28,756 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:35:28,756 INFO L410 AbstractCegarLoop]: === Iteration 56 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:35:28,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:28,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1333182389, now seen corresponding path program 20 times [2019-11-16 00:35:28,757 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:28,757 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256425389] [2019-11-16 00:35:28,757 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:28,758 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:28,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:28,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:30,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:30,798 INFO L134 CoverageAnalysis]: Checked inductivity of 939 backedges. 231 proven. 708 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:35:30,799 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256425389] [2019-11-16 00:35:30,799 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454398920] [2019-11-16 00:35:30,799 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b55077e7-56fe-4ddb-adad-612452c1bc30/bin/uautomizer/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:35:31,068 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:35:31,069 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:35:31,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 233 conjunts are in the unsatisfiable core [2019-11-16 00:35:31,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:35:31,921 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-16 00:35:31,922 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:35:31,927 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:35:31,928 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-16 00:35:31,928 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2019-11-16 00:35:33,601 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:35:33,623 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:35:33,623 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 40 [2019-11-16 00:35:33,624 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:35:33,631 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:35:33,632 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:35:33,632 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:46, output treesize:3 [2019-11-16 00:35:33,812 INFO L134 CoverageAnalysis]: Checked inductivity of 939 backedges. 36 proven. 627 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-11-16 00:35:33,812 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:35:33,812 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 37] total 85 [2019-11-16 00:35:33,812 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223813527] [2019-11-16 00:35:33,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-11-16 00:35:33,813 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:35:33,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-11-16 00:35:33,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=6815, Unknown=0, NotChecked=0, Total=7140 [2019-11-16 00:35:33,814 INFO L87 Difference]: Start difference. First operand 184 states and 187 transitions. Second operand 85 states. [2019-11-16 00:35:40,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:35:40,767 INFO L93 Difference]: Finished difference Result 277 states and 280 transitions. [2019-11-16 00:35:40,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-11-16 00:35:40,767 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 183 [2019-11-16 00:35:40,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:35:40,768 INFO L225 Difference]: With dead ends: 277 [2019-11-16 00:35:40,769 INFO L226 Difference]: Without dead ends: 201 [2019-11-16 00:35:40,770 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 149 SyntacticMatches, 1 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5067 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=885, Invalid=18855, Unknown=0, NotChecked=0, Total=19740 [2019-11-16 00:35:40,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-11-16 00:35:40,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 194. [2019-11-16 00:35:40,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-11-16 00:35:40,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 197 transitions. [2019-11-16 00:35:40,773 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 197 transitions. Word has length 183 [2019-11-16 00:35:40,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:35:40,773 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 197 transitions. [2019-11-16 00:35:40,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-11-16 00:35:40,773 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 197 transitions. [2019-11-16 00:35:40,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-16 00:35:40,774 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:35:40,774 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:35:40,982 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:35:40,983 INFO L410 AbstractCegarLoop]: === Iteration 57 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:35:40,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:40,983 INFO L82 PathProgramCache]: Analyzing trace with hash 446845214, now seen corresponding path program 21 times [2019-11-16 00:35:40,983 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:40,983 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449385243] [2019-11-16 00:35:40,983 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:40,983 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:40,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:41,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:41,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:41,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1059 backedges. 446 proven. 337 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-11-16 00:35:41,949 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449385243] [2019-11-16 00:35:41,949 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737845679] [2019-11-16 00:35:41,949 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b55077e7-56fe-4ddb-adad-612452c1bc30/bin/uautomizer/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:35:48,373 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-11-16 00:35:48,373 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:35:48,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 853 conjuncts, 155 conjunts are in the unsatisfiable core [2019-11-16 00:35:48,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:35:48,389 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_42|], 1=[|v_#valid_43|]} [2019-11-16 00:35:48,395 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:35:48,396 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-16 00:35:48,396 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:35:48,410 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:35:48,418 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 10 treesize of output 8 [2019-11-16 00:35:48,418 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:35:48,431 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:35:48,431 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:35:48,432 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2019-11-16 00:35:50,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1059 backedges. 507 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:35:50,907 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:35:50,907 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 47] total 80 [2019-11-16 00:35:50,907 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29342187] [2019-11-16 00:35:50,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-11-16 00:35:50,907 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:35:50,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-11-16 00:35:50,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=636, Invalid=5684, Unknown=0, NotChecked=0, Total=6320 [2019-11-16 00:35:50,908 INFO L87 Difference]: Start difference. First operand 194 states and 197 transitions. Second operand 80 states. [2019-11-16 00:35:56,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:35:56,471 INFO L93 Difference]: Finished difference Result 424 states and 428 transitions. [2019-11-16 00:35:56,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-11-16 00:35:56,471 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 193 [2019-11-16 00:35:56,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:35:56,472 INFO L225 Difference]: With dead ends: 424 [2019-11-16 00:35:56,472 INFO L226 Difference]: Without dead ends: 201 [2019-11-16 00:35:56,473 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5566 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1613, Invalid=15157, Unknown=0, NotChecked=0, Total=16770 [2019-11-16 00:35:56,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-11-16 00:35:56,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 198. [2019-11-16 00:35:56,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-11-16 00:35:56,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 201 transitions. [2019-11-16 00:35:56,476 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 201 transitions. Word has length 193 [2019-11-16 00:35:56,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:35:56,476 INFO L462 AbstractCegarLoop]: Abstraction has 198 states and 201 transitions. [2019-11-16 00:35:56,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-11-16 00:35:56,476 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 201 transitions. [2019-11-16 00:35:56,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-11-16 00:35:56,477 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:35:56,477 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:35:56,685 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:35:56,685 INFO L410 AbstractCegarLoop]: === Iteration 58 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:35:56,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:56,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1346837665, now seen corresponding path program 22 times [2019-11-16 00:35:56,686 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:35:56,686 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749869015] [2019-11-16 00:35:56,686 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:56,686 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:35:56,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:35:56,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:58,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:59,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1108 backedges. 39 proven. 1069 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:35:59,092 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749869015] [2019-11-16 00:35:59,092 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550245093] [2019-11-16 00:35:59,092 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b55077e7-56fe-4ddb-adad-612452c1bc30/bin/uautomizer/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:35:59,396 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-16 00:35:59,397 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:35:59,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 781 conjuncts, 209 conjunts are in the unsatisfiable core [2019-11-16 00:35:59,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:35:59,419 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:35:59,420 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-16 00:35:59,420 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:35:59,438 INFO L567 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-16 00:35:59,438 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:35:59,438 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-11-16 00:36:00,388 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-16 00:36:00,388 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:36:00,391 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:36:00,392 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:36:00,392 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-11-16 00:36:01,996 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-16 00:36:01,997 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-16 00:36:02,013 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:36:02,014 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-16 00:36:02,014 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:35 [2019-11-16 00:36:02,280 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:36:02,293 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:36:02,294 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 39 [2019-11-16 00:36:02,294 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:36:02,299 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:36:02,300 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:36:02,300 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:39, output treesize:3 [2019-11-16 00:36:02,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1108 backedges. 448 proven. 335 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-11-16 00:36:02,403 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:36:02,404 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 38] total 89 [2019-11-16 00:36:02,404 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145373694] [2019-11-16 00:36:02,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-11-16 00:36:02,404 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:36:02,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-11-16 00:36:02,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=398, Invalid=7434, Unknown=0, NotChecked=0, Total=7832 [2019-11-16 00:36:02,405 INFO L87 Difference]: Start difference. First operand 198 states and 201 transitions. Second operand 89 states. [2019-11-16 00:36:08,184 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 88 [2019-11-16 00:36:12,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:36:12,862 INFO L93 Difference]: Finished difference Result 290 states and 293 transitions. [2019-11-16 00:36:12,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-11-16 00:36:12,862 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 197 [2019-11-16 00:36:12,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:36:12,863 INFO L225 Difference]: With dead ends: 290 [2019-11-16 00:36:12,864 INFO L226 Difference]: Without dead ends: 208 [2019-11-16 00:36:12,865 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 164 SyntacticMatches, 1 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5365 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=1443, Invalid=24963, Unknown=0, NotChecked=0, Total=26406 [2019-11-16 00:36:12,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-11-16 00:36:12,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 202. [2019-11-16 00:36:12,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-11-16 00:36:12,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 205 transitions. [2019-11-16 00:36:12,868 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 205 transitions. Word has length 197 [2019-11-16 00:36:12,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:36:12,868 INFO L462 AbstractCegarLoop]: Abstraction has 202 states and 205 transitions. [2019-11-16 00:36:12,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-11-16 00:36:12,869 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 205 transitions. [2019-11-16 00:36:12,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-11-16 00:36:12,870 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:36:12,870 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:36:13,070 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:36:13,070 INFO L410 AbstractCegarLoop]: === Iteration 59 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:36:13,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:13,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1646834148, now seen corresponding path program 23 times [2019-11-16 00:36:13,071 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:13,071 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936358191] [2019-11-16 00:36:13,071 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:13,071 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:13,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:13,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:13,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:14,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1157 backedges. 278 proven. 554 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-11-16 00:36:14,037 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936358191] [2019-11-16 00:36:14,037 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360170905] [2019-11-16 00:36:14,037 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b55077e7-56fe-4ddb-adad-612452c1bc30/bin/uautomizer/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:36:15,311 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2019-11-16 00:36:15,311 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:36:15,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 138 conjunts are in the unsatisfiable core [2019-11-16 00:36:15,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:36:15,331 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:36:15,332 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-16 00:36:15,332 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:36:15,345 INFO L567 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-16 00:36:15,345 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:36:15,346 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-11-16 00:36:16,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1157 backedges. 276 proven. 556 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-11-16 00:36:16,595 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:36:16,596 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 32] total 63 [2019-11-16 00:36:16,596 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55292716] [2019-11-16 00:36:16,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-11-16 00:36:16,596 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:36:16,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-11-16 00:36:16,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=429, Invalid=3603, Unknown=0, NotChecked=0, Total=4032 [2019-11-16 00:36:16,597 INFO L87 Difference]: Start difference. First operand 202 states and 205 transitions. Second operand 64 states. [2019-11-16 00:36:18,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:36:18,891 INFO L93 Difference]: Finished difference Result 209 states and 212 transitions. [2019-11-16 00:36:18,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-16 00:36:18,892 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 201 [2019-11-16 00:36:18,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:36:18,893 INFO L225 Difference]: With dead ends: 209 [2019-11-16 00:36:18,893 INFO L226 Difference]: Without dead ends: 209 [2019-11-16 00:36:18,893 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1778 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=578, Invalid=6064, Unknown=0, NotChecked=0, Total=6642 [2019-11-16 00:36:18,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-11-16 00:36:18,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 208. [2019-11-16 00:36:18,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-11-16 00:36:18,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 211 transitions. [2019-11-16 00:36:18,897 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 211 transitions. Word has length 201 [2019-11-16 00:36:18,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:36:18,897 INFO L462 AbstractCegarLoop]: Abstraction has 208 states and 211 transitions. [2019-11-16 00:36:18,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-11-16 00:36:18,897 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 211 transitions. [2019-11-16 00:36:18,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-11-16 00:36:18,898 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:36:18,899 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:36:19,099 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:36:19,099 INFO L410 AbstractCegarLoop]: === Iteration 60 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:36:19,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:19,099 INFO L82 PathProgramCache]: Analyzing trace with hash 699761588, now seen corresponding path program 24 times [2019-11-16 00:36:19,099 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:19,100 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145894840] [2019-11-16 00:36:19,100 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:19,100 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:19,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:19,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:19,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:19,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1238 backedges. 522 proven. 391 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-11-16 00:36:19,866 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145894840] [2019-11-16 00:36:19,867 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177498369] [2019-11-16 00:36:19,867 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b55077e7-56fe-4ddb-adad-612452c1bc30/bin/uautomizer/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:36:27,662 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2019-11-16 00:36:27,662 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:36:27,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 912 conjuncts, 221 conjunts are in the unsatisfiable core [2019-11-16 00:36:27,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:36:28,109 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-16 00:36:28,109 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:36:28,114 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:36:28,114 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-16 00:36:28,114 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-11-16 00:36:29,650 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:36:29,650 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 48 [2019-11-16 00:36:29,650 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:36:29,661 INFO L567 ElimStorePlain]: treesize reduction 23, result has 30.3 percent of original size [2019-11-16 00:36:29,662 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:36:29,662 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:35, output treesize:3 [2019-11-16 00:36:29,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1238 backedges. 42 proven. 871 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-11-16 00:36:29,801 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:36:29,802 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 39] total 74 [2019-11-16 00:36:29,802 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091752789] [2019-11-16 00:36:29,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-11-16 00:36:29,803 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:36:29,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-11-16 00:36:29,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=5056, Unknown=0, NotChecked=0, Total=5402 [2019-11-16 00:36:29,803 INFO L87 Difference]: Start difference. First operand 208 states and 211 transitions. Second operand 74 states. [2019-11-16 00:36:41,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:36:41,316 INFO L93 Difference]: Finished difference Result 548 states and 552 transitions. [2019-11-16 00:36:41,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2019-11-16 00:36:41,316 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 207 [2019-11-16 00:36:41,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:36:41,317 INFO L225 Difference]: With dead ends: 548 [2019-11-16 00:36:41,317 INFO L226 Difference]: Without dead ends: 222 [2019-11-16 00:36:41,318 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6385 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=1779, Invalid=25611, Unknown=0, NotChecked=0, Total=27390 [2019-11-16 00:36:41,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-11-16 00:36:41,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 216. [2019-11-16 00:36:41,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-16 00:36:41,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 219 transitions. [2019-11-16 00:36:41,321 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 219 transitions. Word has length 207 [2019-11-16 00:36:41,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:36:41,322 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 219 transitions. [2019-11-16 00:36:41,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-11-16 00:36:41,322 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 219 transitions. [2019-11-16 00:36:41,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-11-16 00:36:41,323 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:36:41,324 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:36:41,532 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:36:41,532 INFO L410 AbstractCegarLoop]: === Iteration 61 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:36:41,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:41,532 INFO L82 PathProgramCache]: Analyzing trace with hash 412332538, now seen corresponding path program 25 times [2019-11-16 00:36:41,532 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:41,533 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990363266] [2019-11-16 00:36:41,533 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:41,533 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:41,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:42,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:42,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 327 proven. 639 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-11-16 00:36:42,356 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990363266] [2019-11-16 00:36:42,357 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531646071] [2019-11-16 00:36:42,357 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b55077e7-56fe-4ddb-adad-612452c1bc30/bin/uautomizer/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:36:42,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:42,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 934 conjuncts, 139 conjunts are in the unsatisfiable core [2019-11-16 00:36:42,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:36:43,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 325 proven. 641 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-11-16 00:36:43,266 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:36:43,266 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 35] total 56 [2019-11-16 00:36:43,266 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939182420] [2019-11-16 00:36:43,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-11-16 00:36:43,295 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:36:43,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-11-16 00:36:43,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=2773, Unknown=0, NotChecked=0, Total=3192 [2019-11-16 00:36:43,296 INFO L87 Difference]: Start difference. First operand 216 states and 219 transitions. Second operand 57 states. [2019-11-16 00:36:45,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:36:45,600 INFO L93 Difference]: Finished difference Result 223 states and 226 transitions. [2019-11-16 00:36:45,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-11-16 00:36:45,601 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 215 [2019-11-16 00:36:45,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:36:45,602 INFO L225 Difference]: With dead ends: 223 [2019-11-16 00:36:45,602 INFO L226 Difference]: Without dead ends: 223 [2019-11-16 00:36:45,603 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1689 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=616, Invalid=5236, Unknown=0, NotChecked=0, Total=5852 [2019-11-16 00:36:45,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-11-16 00:36:45,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 222. [2019-11-16 00:36:45,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-11-16 00:36:45,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 225 transitions. [2019-11-16 00:36:45,606 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 225 transitions. Word has length 215 [2019-11-16 00:36:45,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:36:45,606 INFO L462 AbstractCegarLoop]: Abstraction has 222 states and 225 transitions. [2019-11-16 00:36:45,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-11-16 00:36:45,606 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 225 transitions. [2019-11-16 00:36:45,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-11-16 00:36:45,607 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:36:45,607 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:36:45,812 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:36:45,812 INFO L410 AbstractCegarLoop]: === Iteration 62 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:36:45,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:45,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1347839158, now seen corresponding path program 26 times [2019-11-16 00:36:45,812 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:45,813 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612768935] [2019-11-16 00:36:45,813 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:45,813 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:45,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:45,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:46,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:46,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 604 proven. 449 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-11-16 00:36:46,681 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612768935] [2019-11-16 00:36:46,681 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326792510] [2019-11-16 00:36:46,681 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b55077e7-56fe-4ddb-adad-612452c1bc30/bin/uautomizer/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:36:47,021 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:36:47,021 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:36:47,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 971 conjuncts, 118 conjunts are in the unsatisfiable core [2019-11-16 00:36:47,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:36:47,032 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_45|], 1=[|v_#valid_44|]} [2019-11-16 00:36:47,039 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:36:47,040 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-16 00:36:47,040 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:36:47,048 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:36:47,053 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 10 treesize of output 8 [2019-11-16 00:36:47,053 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:36:47,060 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:36:47,061 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:36:47,061 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2019-11-16 00:36:48,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 661 proven. 392 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-11-16 00:36:48,535 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:36:48,536 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 36] total 73 [2019-11-16 00:36:48,536 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789835660] [2019-11-16 00:36:48,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-11-16 00:36:48,536 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:36:48,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-11-16 00:36:48,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=840, Invalid=4416, Unknown=0, NotChecked=0, Total=5256 [2019-11-16 00:36:48,537 INFO L87 Difference]: Start difference. First operand 222 states and 225 transitions. Second operand 73 states. [2019-11-16 00:36:50,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:36:50,589 INFO L93 Difference]: Finished difference Result 382 states and 386 transitions. [2019-11-16 00:36:50,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-11-16 00:36:50,589 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 221 [2019-11-16 00:36:50,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:36:50,590 INFO L225 Difference]: With dead ends: 382 [2019-11-16 00:36:50,590 INFO L226 Difference]: Without dead ends: 229 [2019-11-16 00:36:50,591 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2340 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1883, Invalid=9247, Unknown=0, NotChecked=0, Total=11130 [2019-11-16 00:36:50,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-11-16 00:36:50,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2019-11-16 00:36:50,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-11-16 00:36:50,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 229 transitions. [2019-11-16 00:36:50,593 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 229 transitions. Word has length 221 [2019-11-16 00:36:50,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:36:50,593 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 229 transitions. [2019-11-16 00:36:50,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-11-16 00:36:50,593 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 229 transitions. [2019-11-16 00:36:50,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-11-16 00:36:50,594 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:36:50,594 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:36:50,794 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:36:50,795 INFO L410 AbstractCegarLoop]: === Iteration 63 === [cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-16 00:36:50,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:50,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1164039245, now seen corresponding path program 27 times [2019-11-16 00:36:50,795 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:50,795 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360245280] [2019-11-16 00:36:50,795 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:50,795 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:50,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:50,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:51,472 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 24 [2019-11-16 00:36:54,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:54,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1488 backedges. 45 proven. 1443 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:36:54,253 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360245280] [2019-11-16 00:36:54,253 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539985175] [2019-11-16 00:36:54,253 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b55077e7-56fe-4ddb-adad-612452c1bc30/bin/uautomizer/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:37:01,485 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-11-16 00:37:01,485 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:37:01,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 982 conjuncts, 94 conjunts are in the unsatisfiable core [2019-11-16 00:37:01,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:37:01,514 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:37:01,515 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-16 00:37:01,515 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:37:01,528 INFO L567 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-16 00:37:01,528 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:37:01,528 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-11-16 00:37:01,599 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-16 00:37:01,599 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:37:01,600 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:37:01,600 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:37:01,601 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-16 00:37:02,189 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:37:02,189 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 54 [2019-11-16 00:37:02,189 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:37:02,203 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:37:02,204 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:37:02,204 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:39 [2019-11-16 00:37:02,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:02,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1488 backedges. 56 proven. 59 refuted. 0 times theorem prover too weak. 1373 trivial. 0 not checked. [2019-11-16 00:37:02,595 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:37:02,595 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 12] total 71 [2019-11-16 00:37:02,595 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145267371] [2019-11-16 00:37:02,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-11-16 00:37:02,596 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:02,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-11-16 00:37:02,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=4783, Unknown=0, NotChecked=0, Total=4970 [2019-11-16 00:37:02,596 INFO L87 Difference]: Start difference. First operand 226 states and 229 transitions. Second operand 71 states. [2019-11-16 00:37:09,292 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 100 [2019-11-16 00:37:09,809 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 106 [2019-11-16 00:37:21,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:21,167 INFO L93 Difference]: Finished difference Result 326 states and 329 transitions. [2019-11-16 00:37:21,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2019-11-16 00:37:21,168 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 225 [2019-11-16 00:37:21,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:21,168 INFO L225 Difference]: With dead ends: 326 [2019-11-16 00:37:21,168 INFO L226 Difference]: Without dead ends: 0 [2019-11-16 00:37:21,169 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 216 SyntacticMatches, 1 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12242 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=2178, Invalid=46884, Unknown=0, NotChecked=0, Total=49062 [2019-11-16 00:37:21,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-16 00:37:21,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-16 00:37:21,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-16 00:37:21,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:37:21,170 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 225 [2019-11-16 00:37:21,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:21,170 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:37:21,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-11-16 00:37:21,170 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:37:21,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-16 00:37:21,371 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:37:21,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:37:21 BoogieIcfgContainer [2019-11-16 00:37:21,375 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:37:21,376 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:37:21,376 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:37:21,376 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:37:21,377 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:31:56" (3/4) ... [2019-11-16 00:37:21,380 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-16 00:37:21,387 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-16 00:37:21,388 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrcmp [2019-11-16 00:37:21,388 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-16 00:37:21,388 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-16 00:37:21,388 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-11-16 00:37:21,389 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-11-16 00:37:21,389 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-16 00:37:21,389 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-11-16 00:37:21,394 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2019-11-16 00:37:21,394 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-11-16 00:37:21,395 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-16 00:37:21,437 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_b55077e7-56fe-4ddb-adad-612452c1bc30/bin/uautomizer/witness.graphml [2019-11-16 00:37:21,437 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:37:21,438 INFO L168 Benchmark]: Toolchain (without parser) took 325793.92 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 260.6 MB). Free memory was 944.7 MB in the beginning and 896.1 MB in the end (delta: 48.6 MB). Peak memory consumption was 309.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:37:21,439 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:37:21,439 INFO L168 Benchmark]: CACSL2BoogieTranslator took 547.82 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -150.6 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:37:21,439 INFO L168 Benchmark]: Boogie Preprocessor took 70.52 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:37:21,440 INFO L168 Benchmark]: RCFGBuilder took 715.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:37:21,440 INFO L168 Benchmark]: TraceAbstraction took 324394.34 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 147.8 MB). Free memory was 1.0 GB in the beginning and 907.8 MB in the end (delta: 131.5 MB). Peak memory consumption was 279.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:37:21,440 INFO L168 Benchmark]: Witness Printer took 61.46 ms. Allocated memory is still 1.3 GB. Free memory was 907.8 MB in the beginning and 896.1 MB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:37:21,442 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 547.82 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -150.6 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 70.52 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 715.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 324394.34 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 147.8 MB). Free memory was 1.0 GB in the beginning and 907.8 MB in the end (delta: 131.5 MB). Peak memory consumption was 279.3 MB. Max. memory is 11.5 GB. * Witness Printer took 61.46 ms. Allocated memory is still 1.3 GB. Free memory was 907.8 MB in the beginning and 896.1 MB in the end (delta: 11.7 MB). Peak memory consumption was 11.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: 519]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 517]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 519]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 519]: 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: 519]: 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: 517]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 539]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 521]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 539]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 535]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 535]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 19 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 73 locations, 19 error locations. Result: SAFE, OverallTime: 324.3s, OverallIterations: 63, TraceHistogramMax: 16, AutomataDifference: 204.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2133 SDtfs, 9379 SDslu, 21430 SDs, 0 SdLazy, 112538 SolverSat, 2084 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 62.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7300 GetRequests, 3916 SyntacticMatches, 30 SemanticMatches, 3354 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86024 ImplicationChecksByTransitivity, 197.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=226occurred in iteration=62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 63 MinimizatonAttempts, 317 StatesRemovedByMinimization, 49 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 28.8s SatisfiabilityAnalysisTime, 73.0s InterpolantComputationTime, 9568 NumberOfCodeBlocks, 9437 NumberOfCodeBlocksAsserted, 253 NumberOfCheckSat, 9461 ConstructedInterpolants, 746 QuantifiedInterpolants, 15607926 SizeOfPredicates, 1089 NumberOfNonLiveVariables, 20364 ConjunctsInSsa, 3885 ConjunctsInUnsatCore, 107 InterpolantComputations, 22 PerfectInterpolantSequences, 17404/34925 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...