./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/cstrncpy-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_386360c7-50d5-4ed3-9db5-3f24e55aa46d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_386360c7-50d5-4ed3-9db5-3f24e55aa46d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_386360c7-50d5-4ed3-9db5-3f24e55aa46d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_386360c7-50d5-4ed3-9db5-3f24e55aa46d/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/cstrncpy-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_386360c7-50d5-4ed3-9db5-3f24e55aa46d/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_386360c7-50d5-4ed3-9db5-3f24e55aa46d/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 836fc197f01e8142cd1fe75cc7c363600c112d62 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 16:43:43,853 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:43:43,854 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:43:43,862 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:43:43,862 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:43:43,863 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:43:43,864 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:43:43,865 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:43:43,866 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:43:43,867 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:43:43,867 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:43:43,868 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:43:43,868 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:43:43,869 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:43:43,869 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:43:43,870 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:43:43,871 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:43:43,871 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:43:43,873 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:43:43,874 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:43:43,875 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:43:43,876 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:43:43,877 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:43:43,877 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:43:43,879 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:43:43,879 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:43:43,879 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:43:43,879 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:43:43,880 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:43:43,880 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:43:43,880 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:43:43,881 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:43:43,881 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:43:43,882 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:43:43,882 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:43:43,882 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:43:43,883 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:43:43,883 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:43:43,883 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:43:43,884 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:43:43,884 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:43:43,885 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_386360c7-50d5-4ed3-9db5-3f24e55aa46d/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-12-07 16:43:43,894 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:43:43,894 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:43:43,895 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 16:43:43,895 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 16:43:43,895 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 16:43:43,895 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:43:43,895 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:43:43,895 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 16:43:43,896 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 16:43:43,896 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:43:43,896 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:43:43,896 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 16:43:43,896 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 16:43:43,896 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 16:43:43,896 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:43:43,896 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 16:43:43,897 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:43:43,897 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:43:43,897 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:43:43,897 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 16:43:43,897 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:43:43,897 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:43:43,897 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:43:43,897 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:43:43,898 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:43:43,898 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 16:43:43,898 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 16:43:43,898 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:43:43,898 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_386360c7-50d5-4ed3-9db5-3f24e55aa46d/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 -> 836fc197f01e8142cd1fe75cc7c363600c112d62 [2019-12-07 16:43:44,004 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:43:44,012 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:43:44,015 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:43:44,016 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:43:44,016 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:43:44,017 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_386360c7-50d5-4ed3-9db5-3f24e55aa46d/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/cstrncpy-alloca-2.i [2019-12-07 16:43:44,064 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_386360c7-50d5-4ed3-9db5-3f24e55aa46d/bin/uautomizer/data/a51b1665d/6daf4f38e0c241d3a8d4d50eb33b8106/FLAGfaeb3f163 [2019-12-07 16:43:44,508 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:43:44,509 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_386360c7-50d5-4ed3-9db5-3f24e55aa46d/sv-benchmarks/c/array-memsafety/cstrncpy-alloca-2.i [2019-12-07 16:43:44,519 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_386360c7-50d5-4ed3-9db5-3f24e55aa46d/bin/uautomizer/data/a51b1665d/6daf4f38e0c241d3a8d4d50eb33b8106/FLAGfaeb3f163 [2019-12-07 16:43:44,528 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_386360c7-50d5-4ed3-9db5-3f24e55aa46d/bin/uautomizer/data/a51b1665d/6daf4f38e0c241d3a8d4d50eb33b8106 [2019-12-07 16:43:44,529 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:43:44,530 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-07 16:43:44,531 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:43:44,531 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:43:44,533 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:43:44,534 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:43:44" (1/1) ... [2019-12-07 16:43:44,535 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@168b5bf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:43:44, skipping insertion in model container [2019-12-07 16:43:44,536 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:43:44" (1/1) ... [2019-12-07 16:43:44,540 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:43:44,565 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:43:44,778 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:43:44,784 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 16:43:44,813 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:43:44,848 INFO L208 MainTranslator]: Completed translation [2019-12-07 16:43:44,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:43:44 WrapperNode [2019-12-07 16:43:44,849 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:43:44,849 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 16:43:44,849 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 16:43:44,849 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 16:43:44,858 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:43:44" (1/1) ... [2019-12-07 16:43:44,858 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:43:44" (1/1) ... [2019-12-07 16:43:44,868 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:43:44" (1/1) ... [2019-12-07 16:43:44,868 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:43:44" (1/1) ... [2019-12-07 16:43:44,878 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:43:44" (1/1) ... [2019-12-07 16:43:44,882 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:43:44" (1/1) ... [2019-12-07 16:43:44,884 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:43:44" (1/1) ... [2019-12-07 16:43:44,888 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 16:43:44,889 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 16:43:44,889 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 16:43:44,889 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 16:43:44,889 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:43:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_386360c7-50d5-4ed3-9db5-3f24e55aa46d/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:43:44,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-12-07 16:43:44,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 16:43:44,929 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-12-07 16:43:44,929 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-12-07 16:43:44,929 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-12-07 16:43:44,929 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-12-07 16:43:44,929 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-12-07 16:43:44,929 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrncpy [2019-12-07 16:43:44,929 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-12-07 16:43:44,929 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-12-07 16:43:44,929 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-12-07 16:43:44,929 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-12-07 16:43:44,930 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-12-07 16:43:44,930 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-12-07 16:43:44,930 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-12-07 16:43:44,930 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-12-07 16:43:44,930 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-12-07 16:43:44,930 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-12-07 16:43:44,930 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-12-07 16:43:44,930 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-12-07 16:43:44,930 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-12-07 16:43:44,930 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-12-07 16:43:44,930 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-12-07 16:43:44,930 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-12-07 16:43:44,931 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-12-07 16:43:44,931 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-12-07 16:43:44,931 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-12-07 16:43:44,931 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-12-07 16:43:44,931 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-12-07 16:43:44,931 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-12-07 16:43:44,931 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-12-07 16:43:44,931 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-12-07 16:43:44,931 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-12-07 16:43:44,931 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-12-07 16:43:44,931 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-12-07 16:43:44,931 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-12-07 16:43:44,932 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-12-07 16:43:44,932 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-12-07 16:43:44,932 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-12-07 16:43:44,932 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-12-07 16:43:44,932 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-12-07 16:43:44,932 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-12-07 16:43:44,932 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-12-07 16:43:44,932 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-12-07 16:43:44,932 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-12-07 16:43:44,932 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-12-07 16:43:44,932 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-12-07 16:43:44,932 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-12-07 16:43:44,932 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-12-07 16:43:44,932 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-12-07 16:43:44,933 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-12-07 16:43:44,933 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-12-07 16:43:44,933 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-12-07 16:43:44,933 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-12-07 16:43:44,933 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-12-07 16:43:44,933 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-12-07 16:43:44,933 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-12-07 16:43:44,933 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-12-07 16:43:44,933 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-12-07 16:43:44,933 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-12-07 16:43:44,933 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-12-07 16:43:44,933 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-12-07 16:43:44,933 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-12-07 16:43:44,934 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-12-07 16:43:44,934 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-12-07 16:43:44,934 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-12-07 16:43:44,934 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-12-07 16:43:44,934 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-12-07 16:43:44,934 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-12-07 16:43:44,934 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-12-07 16:43:44,934 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-12-07 16:43:44,934 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-12-07 16:43:44,934 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-12-07 16:43:44,934 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-12-07 16:43:44,934 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-12-07 16:43:44,934 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-12-07 16:43:44,934 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-12-07 16:43:44,935 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-12-07 16:43:44,935 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-12-07 16:43:44,935 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-12-07 16:43:44,935 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-12-07 16:43:44,935 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-12-07 16:43:44,935 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-12-07 16:43:44,935 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-12-07 16:43:44,935 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-12-07 16:43:44,935 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-12-07 16:43:44,935 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-12-07 16:43:44,936 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-12-07 16:43:44,936 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-12-07 16:43:44,936 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-12-07 16:43:44,936 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-12-07 16:43:44,936 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-12-07 16:43:44,936 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-12-07 16:43:44,936 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-12-07 16:43:44,936 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-12-07 16:43:44,936 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-12-07 16:43:44,936 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-12-07 16:43:44,936 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-12-07 16:43:44,937 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-12-07 16:43:44,937 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-12-07 16:43:44,937 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-12-07 16:43:44,937 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-12-07 16:43:44,937 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-12-07 16:43:44,937 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-12-07 16:43:44,937 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-12-07 16:43:44,937 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-12-07 16:43:44,937 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-12-07 16:43:44,937 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-12-07 16:43:44,937 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-12-07 16:43:44,938 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-12-07 16:43:44,938 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-12-07 16:43:44,938 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-12-07 16:43:44,938 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-12-07 16:43:44,938 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-12-07 16:43:44,938 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-12-07 16:43:44,938 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-12-07 16:43:44,938 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-12-07 16:43:44,938 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-12-07 16:43:44,938 INFO L130 BoogieDeclarations]: Found specification of procedure cstrncpy [2019-12-07 16:43:44,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 16:43:44,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 16:43:44,938 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-12-07 16:43:44,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 16:43:44,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 16:43:44,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-12-07 16:43:44,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 16:43:45,188 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 16:43:45,188 INFO L287 CfgBuilder]: Removed 3 assume(true) statements. [2019-12-07 16:43:45,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:43:45 BoogieIcfgContainer [2019-12-07 16:43:45,189 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 16:43:45,189 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 16:43:45,189 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 16:43:45,191 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 16:43:45,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 04:43:44" (1/3) ... [2019-12-07 16:43:45,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cd60cbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:43:45, skipping insertion in model container [2019-12-07 16:43:45,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:43:44" (2/3) ... [2019-12-07 16:43:45,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cd60cbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:43:45, skipping insertion in model container [2019-12-07 16:43:45,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:43:45" (3/3) ... [2019-12-07 16:43:45,193 INFO L109 eAbstractionObserver]: Analyzing ICFG cstrncpy-alloca-2.i [2019-12-07 16:43:45,199 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 16:43:45,204 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2019-12-07 16:43:45,211 INFO L249 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2019-12-07 16:43:45,223 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 16:43:45,223 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 16:43:45,223 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 16:43:45,223 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 16:43:45,223 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 16:43:45,223 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 16:43:45,223 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 16:43:45,223 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 16:43:45,233 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2019-12-07 16:43:45,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 16:43:45,240 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:43:45,240 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:43:45,240 INFO L410 AbstractCegarLoop]: === Iteration 1 === [cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 16:43:45,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:43:45,244 INFO L82 PathProgramCache]: Analyzing trace with hash -17457139, now seen corresponding path program 1 times [2019-12-07 16:43:45,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:43:45,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365614683] [2019-12-07 16:43:45,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:43:45,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:45,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:45,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:45,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365614683] [2019-12-07 16:43:45,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:43:45,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:43:45,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057520579] [2019-12-07 16:43:45,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:43:45,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:43:45,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:43:45,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:43:45,388 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 3 states. [2019-12-07 16:43:45,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:43:45,441 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2019-12-07 16:43:45,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:43:45,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-07 16:43:45,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:43:45,449 INFO L225 Difference]: With dead ends: 43 [2019-12-07 16:43:45,449 INFO L226 Difference]: Without dead ends: 40 [2019-12-07 16:43:45,451 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:43:45,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-12-07 16:43:45,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-12-07 16:43:45,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-12-07 16:43:45,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2019-12-07 16:43:45,477 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 11 [2019-12-07 16:43:45,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:43:45,477 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2019-12-07 16:43:45,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:43:45,477 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2019-12-07 16:43:45,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 16:43:45,478 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:43:45,478 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:43:45,478 INFO L410 AbstractCegarLoop]: === Iteration 2 === [cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 16:43:45,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:43:45,478 INFO L82 PathProgramCache]: Analyzing trace with hash -17457449, now seen corresponding path program 1 times [2019-12-07 16:43:45,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:43:45,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469042029] [2019-12-07 16:43:45,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:43:45,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:45,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:45,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:45,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469042029] [2019-12-07 16:43:45,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:43:45,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:43:45,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951739525] [2019-12-07 16:43:45,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:43:45,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:43:45,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:43:45,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:43:45,540 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 4 states. [2019-12-07 16:43:45,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:43:45,599 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2019-12-07 16:43:45,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:43:45,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 16:43:45,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:43:45,600 INFO L225 Difference]: With dead ends: 38 [2019-12-07 16:43:45,600 INFO L226 Difference]: Without dead ends: 38 [2019-12-07 16:43:45,600 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:43:45,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-12-07 16:43:45,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-12-07 16:43:45,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-12-07 16:43:45,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2019-12-07 16:43:45,604 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 11 [2019-12-07 16:43:45,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:43:45,604 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2019-12-07 16:43:45,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:43:45,604 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2019-12-07 16:43:45,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 16:43:45,605 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:43:45,605 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:43:45,605 INFO L410 AbstractCegarLoop]: === Iteration 3 === [cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 16:43:45,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:43:45,605 INFO L82 PathProgramCache]: Analyzing trace with hash -17457448, now seen corresponding path program 1 times [2019-12-07 16:43:45,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:43:45,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237246921] [2019-12-07 16:43:45,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:43:45,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:45,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:45,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:45,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237246921] [2019-12-07 16:43:45,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:43:45,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:43:45,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760077628] [2019-12-07 16:43:45,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:43:45,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:43:45,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:43:45,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:43:45,656 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 5 states. [2019-12-07 16:43:45,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:43:45,739 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2019-12-07 16:43:45,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:43:45,739 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-07 16:43:45,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:43:45,740 INFO L225 Difference]: With dead ends: 37 [2019-12-07 16:43:45,740 INFO L226 Difference]: Without dead ends: 37 [2019-12-07 16:43:45,741 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:43:45,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-12-07 16:43:45,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-12-07 16:43:45,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-12-07 16:43:45,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2019-12-07 16:43:45,746 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 11 [2019-12-07 16:43:45,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:43:45,746 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2019-12-07 16:43:45,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:43:45,747 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2019-12-07 16:43:45,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 16:43:45,747 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:43:45,747 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:43:45,747 INFO L410 AbstractCegarLoop]: === Iteration 4 === [cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 16:43:45,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:43:45,748 INFO L82 PathProgramCache]: Analyzing trace with hash -17457395, now seen corresponding path program 1 times [2019-12-07 16:43:45,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:43:45,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948459989] [2019-12-07 16:43:45,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:43:45,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:45,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:45,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:45,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948459989] [2019-12-07 16:43:45,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:43:45,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 16:43:45,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345913135] [2019-12-07 16:43:45,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:43:45,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:43:45,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:43:45,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:43:45,797 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 5 states. [2019-12-07 16:43:45,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:43:45,863 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2019-12-07 16:43:45,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:43:45,864 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-07 16:43:45,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:43:45,865 INFO L225 Difference]: With dead ends: 45 [2019-12-07 16:43:45,865 INFO L226 Difference]: Without dead ends: 45 [2019-12-07 16:43:45,866 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:43:45,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-12-07 16:43:45,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2019-12-07 16:43:45,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-12-07 16:43:45,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2019-12-07 16:43:45,872 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 11 [2019-12-07 16:43:45,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:43:45,872 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2019-12-07 16:43:45,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:43:45,872 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2019-12-07 16:43:45,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 16:43:45,872 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:43:45,873 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:43:45,873 INFO L410 AbstractCegarLoop]: === Iteration 5 === [cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 16:43:45,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:43:45,873 INFO L82 PathProgramCache]: Analyzing trace with hash -15610353, now seen corresponding path program 1 times [2019-12-07 16:43:45,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:43:45,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453944509] [2019-12-07 16:43:45,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:43:45,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:45,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:45,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:45,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453944509] [2019-12-07 16:43:45,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:43:45,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:43:45,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891533024] [2019-12-07 16:43:45,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:43:45,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:43:45,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:43:45,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:43:45,918 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 5 states. [2019-12-07 16:43:46,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:43:46,001 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2019-12-07 16:43:46,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:43:46,002 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-07 16:43:46,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:43:46,002 INFO L225 Difference]: With dead ends: 49 [2019-12-07 16:43:46,003 INFO L226 Difference]: Without dead ends: 49 [2019-12-07 16:43:46,003 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:43:46,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-12-07 16:43:46,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2019-12-07 16:43:46,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-07 16:43:46,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2019-12-07 16:43:46,006 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 11 [2019-12-07 16:43:46,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:43:46,006 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2019-12-07 16:43:46,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:43:46,007 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2019-12-07 16:43:46,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 16:43:46,007 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:43:46,007 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:43:46,007 INFO L410 AbstractCegarLoop]: === Iteration 6 === [cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 16:43:46,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:43:46,008 INFO L82 PathProgramCache]: Analyzing trace with hash 988415904, now seen corresponding path program 1 times [2019-12-07 16:43:46,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:43:46,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201496238] [2019-12-07 16:43:46,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:43:46,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:46,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:46,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:46,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201496238] [2019-12-07 16:43:46,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:43:46,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 16:43:46,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209399319] [2019-12-07 16:43:46,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 16:43:46,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:43:46,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 16:43:46,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:43:46,055 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 7 states. [2019-12-07 16:43:46,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:43:46,158 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2019-12-07 16:43:46,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 16:43:46,158 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-07 16:43:46,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:43:46,159 INFO L225 Difference]: With dead ends: 41 [2019-12-07 16:43:46,159 INFO L226 Difference]: Without dead ends: 41 [2019-12-07 16:43:46,159 INFO L630 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-12-07 16:43:46,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-12-07 16:43:46,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-12-07 16:43:46,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-12-07 16:43:46,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2019-12-07 16:43:46,162 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 15 [2019-12-07 16:43:46,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:43:46,162 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2019-12-07 16:43:46,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 16:43:46,163 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2019-12-07 16:43:46,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 16:43:46,163 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:43:46,163 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:43:46,163 INFO L410 AbstractCegarLoop]: === Iteration 7 === [cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 16:43:46,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:43:46,164 INFO L82 PathProgramCache]: Analyzing trace with hash 988415905, now seen corresponding path program 1 times [2019-12-07 16:43:46,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:43:46,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305940563] [2019-12-07 16:43:46,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:43:46,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:46,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:46,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:46,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305940563] [2019-12-07 16:43:46,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:43:46,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 16:43:46,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383712723] [2019-12-07 16:43:46,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 16:43:46,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:43:46,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 16:43:46,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-07 16:43:46,241 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand 9 states. [2019-12-07 16:43:46,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:43:46,402 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2019-12-07 16:43:46,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 16:43:46,402 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-12-07 16:43:46,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:43:46,404 INFO L225 Difference]: With dead ends: 50 [2019-12-07 16:43:46,404 INFO L226 Difference]: Without dead ends: 50 [2019-12-07 16:43:46,404 INFO L630 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-12-07 16:43:46,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-12-07 16:43:46,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2019-12-07 16:43:46,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-12-07 16:43:46,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2019-12-07 16:43:46,407 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 15 [2019-12-07 16:43:46,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:43:46,407 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2019-12-07 16:43:46,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 16:43:46,407 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2019-12-07 16:43:46,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 16:43:46,408 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:43:46,408 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:43:46,408 INFO L410 AbstractCegarLoop]: === Iteration 8 === [cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 16:43:46,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:43:46,408 INFO L82 PathProgramCache]: Analyzing trace with hash 576121943, now seen corresponding path program 1 times [2019-12-07 16:43:46,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:43:46,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31509464] [2019-12-07 16:43:46,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:43:46,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:46,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:46,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:46,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31509464] [2019-12-07 16:43:46,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:43:46,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 16:43:46,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814612452] [2019-12-07 16:43:46,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 16:43:46,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:43:46,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 16:43:46,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:43:46,464 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand 8 states. [2019-12-07 16:43:46,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:43:46,552 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2019-12-07 16:43:46,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 16:43:46,552 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-12-07 16:43:46,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:43:46,553 INFO L225 Difference]: With dead ends: 42 [2019-12-07 16:43:46,553 INFO L226 Difference]: Without dead ends: 42 [2019-12-07 16:43:46,553 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-07 16:43:46,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-12-07 16:43:46,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-12-07 16:43:46,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-07 16:43:46,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2019-12-07 16:43:46,555 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 16 [2019-12-07 16:43:46,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:43:46,556 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2019-12-07 16:43:46,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 16:43:46,556 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2019-12-07 16:43:46,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 16:43:46,556 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:43:46,556 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:43:46,556 INFO L410 AbstractCegarLoop]: === Iteration 9 === [cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 16:43:46,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:43:46,556 INFO L82 PathProgramCache]: Analyzing trace with hash 576121944, now seen corresponding path program 1 times [2019-12-07 16:43:46,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:43:46,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392345069] [2019-12-07 16:43:46,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:43:46,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:46,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:46,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:46,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392345069] [2019-12-07 16:43:46,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:43:46,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 16:43:46,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861204280] [2019-12-07 16:43:46,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 16:43:46,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:43:46,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 16:43:46,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:43:46,614 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand 8 states. [2019-12-07 16:43:46,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:43:46,736 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2019-12-07 16:43:46,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 16:43:46,736 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-12-07 16:43:46,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:43:46,737 INFO L225 Difference]: With dead ends: 47 [2019-12-07 16:43:46,737 INFO L226 Difference]: Without dead ends: 47 [2019-12-07 16:43:46,737 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-07 16:43:46,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-12-07 16:43:46,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2019-12-07 16:43:46,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-12-07 16:43:46,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2019-12-07 16:43:46,740 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 16 [2019-12-07 16:43:46,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:43:46,740 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2019-12-07 16:43:46,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 16:43:46,740 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2019-12-07 16:43:46,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 16:43:46,741 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:43:46,741 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:43:46,741 INFO L410 AbstractCegarLoop]: === Iteration 10 === [cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 16:43:46,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:43:46,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1716894098, now seen corresponding path program 1 times [2019-12-07 16:43:46,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:43:46,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550982868] [2019-12-07 16:43:46,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:43:46,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:46,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:46,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:46,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550982868] [2019-12-07 16:43:46,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876633070] [2019-12-07 16:43:46,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_386360c7-50d5-4ed3-9db5-3f24e55aa46d/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:43:46,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:46,857 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 16:43:46,861 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:43:46,904 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:46,904 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 16:43:46,905 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:46,918 INFO L614 ElimStorePlain]: treesize reduction 10, result has 67.7 percent of original size [2019-12-07 16:43:46,918 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:43:46,919 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:12 [2019-12-07 16:43:46,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:46,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:43:46,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 6 [2019-12-07 16:43:46,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916450259] [2019-12-07 16:43:46,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 16:43:46,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:43:46,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 16:43:46,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:43:46,933 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand 7 states. [2019-12-07 16:43:47,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:43:47,025 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2019-12-07 16:43:47,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:43:47,026 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-07 16:43:47,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:43:47,026 INFO L225 Difference]: With dead ends: 49 [2019-12-07 16:43:47,026 INFO L226 Difference]: Without dead ends: 49 [2019-12-07 16:43:47,027 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:43:47,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-12-07 16:43:47,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 40. [2019-12-07 16:43:47,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-12-07 16:43:47,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2019-12-07 16:43:47,030 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 15 [2019-12-07 16:43:47,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:43:47,030 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2019-12-07 16:43:47,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 16:43:47,031 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2019-12-07 16:43:47,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 16:43:47,031 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:43:47,031 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:43:47,232 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:43:47,233 INFO L410 AbstractCegarLoop]: === Iteration 11 === [cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 16:43:47,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:43:47,233 INFO L82 PathProgramCache]: Analyzing trace with hash 559503098, now seen corresponding path program 1 times [2019-12-07 16:43:47,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:43:47,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525260046] [2019-12-07 16:43:47,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:43:47,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:47,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:47,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:47,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525260046] [2019-12-07 16:43:47,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:43:47,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 16:43:47,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116388639] [2019-12-07 16:43:47,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 16:43:47,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:43:47,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 16:43:47,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:43:47,302 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand 7 states. [2019-12-07 16:43:47,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:43:47,436 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2019-12-07 16:43:47,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 16:43:47,437 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-07 16:43:47,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:43:47,438 INFO L225 Difference]: With dead ends: 70 [2019-12-07 16:43:47,438 INFO L226 Difference]: Without dead ends: 70 [2019-12-07 16:43:47,438 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-12-07 16:43:47,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-12-07 16:43:47,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 62. [2019-12-07 16:43:47,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-07 16:43:47,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2019-12-07 16:43:47,442 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 19 [2019-12-07 16:43:47,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:43:47,443 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2019-12-07 16:43:47,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 16:43:47,443 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2019-12-07 16:43:47,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 16:43:47,444 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:43:47,444 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:43:47,444 INFO L410 AbstractCegarLoop]: === Iteration 12 === [cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 16:43:47,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:43:47,444 INFO L82 PathProgramCache]: Analyzing trace with hash 531790065, now seen corresponding path program 1 times [2019-12-07 16:43:47,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:43:47,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540360285] [2019-12-07 16:43:47,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:43:47,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:47,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:47,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:47,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:47,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540360285] [2019-12-07 16:43:47,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:43:47,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 16:43:47,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339643137] [2019-12-07 16:43:47,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 16:43:47,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:43:47,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 16:43:47,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:43:47,496 INFO L87 Difference]: Start difference. First operand 62 states and 75 transitions. Second operand 7 states. [2019-12-07 16:43:47,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:43:47,617 INFO L93 Difference]: Finished difference Result 74 states and 87 transitions. [2019-12-07 16:43:47,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 16:43:47,617 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-07 16:43:47,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:43:47,618 INFO L225 Difference]: With dead ends: 74 [2019-12-07 16:43:47,618 INFO L226 Difference]: Without dead ends: 68 [2019-12-07 16:43:47,618 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-12-07 16:43:47,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-12-07 16:43:47,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 62. [2019-12-07 16:43:47,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-07 16:43:47,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2019-12-07 16:43:47,623 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 73 transitions. Word has length 19 [2019-12-07 16:43:47,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:43:47,624 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 73 transitions. [2019-12-07 16:43:47,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 16:43:47,624 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2019-12-07 16:43:47,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 16:43:47,625 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:43:47,625 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:43:47,625 INFO L410 AbstractCegarLoop]: === Iteration 13 === [cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 16:43:47,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:43:47,625 INFO L82 PathProgramCache]: Analyzing trace with hash 817668536, now seen corresponding path program 1 times [2019-12-07 16:43:47,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:43:47,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619003942] [2019-12-07 16:43:47,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:43:47,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:47,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:47,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:47,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619003942] [2019-12-07 16:43:47,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:43:47,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 16:43:47,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356000496] [2019-12-07 16:43:47,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 16:43:47,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:43:47,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 16:43:47,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-07 16:43:47,723 INFO L87 Difference]: Start difference. First operand 62 states and 73 transitions. Second operand 10 states. [2019-12-07 16:43:47,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:43:47,896 INFO L93 Difference]: Finished difference Result 95 states and 109 transitions. [2019-12-07 16:43:47,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 16:43:47,896 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-12-07 16:43:47,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:43:47,897 INFO L225 Difference]: With dead ends: 95 [2019-12-07 16:43:47,897 INFO L226 Difference]: Without dead ends: 95 [2019-12-07 16:43:47,897 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2019-12-07 16:43:47,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-12-07 16:43:47,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 74. [2019-12-07 16:43:47,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-12-07 16:43:47,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 88 transitions. [2019-12-07 16:43:47,901 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 88 transitions. Word has length 19 [2019-12-07 16:43:47,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:43:47,901 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 88 transitions. [2019-12-07 16:43:47,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 16:43:47,901 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 88 transitions. [2019-12-07 16:43:47,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 16:43:47,902 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:43:47,902 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:43:47,902 INFO L410 AbstractCegarLoop]: === Iteration 14 === [cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 16:43:47,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:43:47,902 INFO L82 PathProgramCache]: Analyzing trace with hash 230862522, now seen corresponding path program 1 times [2019-12-07 16:43:47,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:43:47,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746977671] [2019-12-07 16:43:47,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:43:47,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:47,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:47,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:47,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746977671] [2019-12-07 16:43:47,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:43:47,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 16:43:47,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007953437] [2019-12-07 16:43:47,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 16:43:47,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:43:47,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 16:43:47,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-07 16:43:47,996 INFO L87 Difference]: Start difference. First operand 74 states and 88 transitions. Second operand 11 states. [2019-12-07 16:43:48,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:43:48,170 INFO L93 Difference]: Finished difference Result 115 states and 134 transitions. [2019-12-07 16:43:48,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 16:43:48,170 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-12-07 16:43:48,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:43:48,171 INFO L225 Difference]: With dead ends: 115 [2019-12-07 16:43:48,171 INFO L226 Difference]: Without dead ends: 115 [2019-12-07 16:43:48,171 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2019-12-07 16:43:48,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-12-07 16:43:48,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 76. [2019-12-07 16:43:48,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-12-07 16:43:48,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 92 transitions. [2019-12-07 16:43:48,175 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 92 transitions. Word has length 19 [2019-12-07 16:43:48,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:43:48,175 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 92 transitions. [2019-12-07 16:43:48,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 16:43:48,175 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 92 transitions. [2019-12-07 16:43:48,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 16:43:48,176 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:43:48,176 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:43:48,176 INFO L410 AbstractCegarLoop]: === Iteration 15 === [cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 16:43:48,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:43:48,176 INFO L82 PathProgramCache]: Analyzing trace with hash 164174813, now seen corresponding path program 1 times [2019-12-07 16:43:48,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:43:48,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142438080] [2019-12-07 16:43:48,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:43:48,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:48,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:48,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:48,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142438080] [2019-12-07 16:43:48,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:43:48,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 16:43:48,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10170513] [2019-12-07 16:43:48,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 16:43:48,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:43:48,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 16:43:48,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:43:48,216 INFO L87 Difference]: Start difference. First operand 76 states and 92 transitions. Second operand 7 states. [2019-12-07 16:43:48,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:43:48,318 INFO L93 Difference]: Finished difference Result 81 states and 95 transitions. [2019-12-07 16:43:48,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 16:43:48,319 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-12-07 16:43:48,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:43:48,320 INFO L225 Difference]: With dead ends: 81 [2019-12-07 16:43:48,320 INFO L226 Difference]: Without dead ends: 81 [2019-12-07 16:43:48,320 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-12-07 16:43:48,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-12-07 16:43:48,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 75. [2019-12-07 16:43:48,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-12-07 16:43:48,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 89 transitions. [2019-12-07 16:43:48,323 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 89 transitions. Word has length 20 [2019-12-07 16:43:48,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:43:48,324 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 89 transitions. [2019-12-07 16:43:48,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 16:43:48,324 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 89 transitions. [2019-12-07 16:43:48,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 16:43:48,325 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:43:48,325 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:43:48,325 INFO L410 AbstractCegarLoop]: === Iteration 16 === [cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 16:43:48,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:43:48,325 INFO L82 PathProgramCache]: Analyzing trace with hash 164174814, now seen corresponding path program 1 times [2019-12-07 16:43:48,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:43:48,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194891329] [2019-12-07 16:43:48,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:43:48,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:48,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:48,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:48,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194891329] [2019-12-07 16:43:48,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:43:48,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 16:43:48,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601179520] [2019-12-07 16:43:48,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 16:43:48,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:43:48,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 16:43:48,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-12-07 16:43:48,394 INFO L87 Difference]: Start difference. First operand 75 states and 89 transitions. Second operand 9 states. [2019-12-07 16:43:48,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:43:48,547 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2019-12-07 16:43:48,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 16:43:48,547 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-12-07 16:43:48,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:43:48,548 INFO L225 Difference]: With dead ends: 90 [2019-12-07 16:43:48,548 INFO L226 Difference]: Without dead ends: 90 [2019-12-07 16:43:48,548 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-12-07 16:43:48,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-12-07 16:43:48,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2019-12-07 16:43:48,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-12-07 16:43:48,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 99 transitions. [2019-12-07 16:43:48,551 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 99 transitions. Word has length 20 [2019-12-07 16:43:48,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:43:48,551 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 99 transitions. [2019-12-07 16:43:48,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 16:43:48,551 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 99 transitions. [2019-12-07 16:43:48,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 16:43:48,552 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:43:48,552 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:43:48,552 INFO L410 AbstractCegarLoop]: === Iteration 17 === [cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 16:43:48,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:43:48,552 INFO L82 PathProgramCache]: Analyzing trace with hash -422631200, now seen corresponding path program 1 times [2019-12-07 16:43:48,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:43:48,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349224266] [2019-12-07 16:43:48,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:43:48,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:48,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:48,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:48,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349224266] [2019-12-07 16:43:48,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:43:48,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 16:43:48,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338815971] [2019-12-07 16:43:48,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 16:43:48,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:43:48,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 16:43:48,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-12-07 16:43:48,673 INFO L87 Difference]: Start difference. First operand 87 states and 99 transitions. Second operand 12 states. [2019-12-07 16:43:48,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:43:48,979 INFO L93 Difference]: Finished difference Result 96 states and 111 transitions. [2019-12-07 16:43:48,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 16:43:48,980 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-12-07 16:43:48,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:43:48,981 INFO L225 Difference]: With dead ends: 96 [2019-12-07 16:43:48,982 INFO L226 Difference]: Without dead ends: 96 [2019-12-07 16:43:48,982 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2019-12-07 16:43:48,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-12-07 16:43:48,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 93. [2019-12-07 16:43:48,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-12-07 16:43:48,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2019-12-07 16:43:48,991 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 107 transitions. Word has length 20 [2019-12-07 16:43:48,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:43:48,991 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 107 transitions. [2019-12-07 16:43:48,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 16:43:48,991 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2019-12-07 16:43:48,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 16:43:48,993 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:43:48,993 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:43:48,993 INFO L410 AbstractCegarLoop]: === Iteration 18 === [cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 16:43:48,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:43:48,993 INFO L82 PathProgramCache]: Analyzing trace with hash -424617923, now seen corresponding path program 1 times [2019-12-07 16:43:48,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:43:48,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759244302] [2019-12-07 16:43:48,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:43:49,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:49,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:49,089 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:49,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759244302] [2019-12-07 16:43:49,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495133007] [2019-12-07 16:43:49,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_386360c7-50d5-4ed3-9db5-3f24e55aa46d/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:43:49,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:49,148 INFO L264 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 27 conjunts are in the unsatisfiable core [2019-12-07 16:43:49,149 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:43:49,211 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:49,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:43:49,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2019-12-07 16:43:49,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964619217] [2019-12-07 16:43:49,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 16:43:49,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:43:49,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 16:43:49,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-12-07 16:43:49,212 INFO L87 Difference]: Start difference. First operand 93 states and 107 transitions. Second operand 18 states. [2019-12-07 16:43:49,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:43:49,584 INFO L93 Difference]: Finished difference Result 114 states and 131 transitions. [2019-12-07 16:43:49,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 16:43:49,584 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 23 [2019-12-07 16:43:49,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:43:49,585 INFO L225 Difference]: With dead ends: 114 [2019-12-07 16:43:49,585 INFO L226 Difference]: Without dead ends: 114 [2019-12-07 16:43:49,585 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=594, Unknown=0, NotChecked=0, Total=702 [2019-12-07 16:43:49,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-12-07 16:43:49,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 96. [2019-12-07 16:43:49,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-12-07 16:43:49,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 112 transitions. [2019-12-07 16:43:49,588 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 112 transitions. Word has length 23 [2019-12-07 16:43:49,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:43:49,588 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 112 transitions. [2019-12-07 16:43:49,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 16:43:49,588 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 112 transitions. [2019-12-07 16:43:49,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 16:43:49,589 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:43:49,589 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:43:49,789 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:43:49,789 INFO L410 AbstractCegarLoop]: === Iteration 19 === [cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 16:43:49,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:43:49,790 INFO L82 PathProgramCache]: Analyzing trace with hash -2093520869, now seen corresponding path program 1 times [2019-12-07 16:43:49,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:43:49,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835364811] [2019-12-07 16:43:49,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:43:49,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:49,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:49,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:49,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:49,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835364811] [2019-12-07 16:43:49,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:43:49,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 16:43:49,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027975813] [2019-12-07 16:43:49,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:43:49,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:43:49,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:43:49,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:43:49,831 INFO L87 Difference]: Start difference. First operand 96 states and 112 transitions. Second operand 6 states. [2019-12-07 16:43:49,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:43:49,898 INFO L93 Difference]: Finished difference Result 97 states and 113 transitions. [2019-12-07 16:43:49,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 16:43:49,898 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-07 16:43:49,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:43:49,898 INFO L225 Difference]: With dead ends: 97 [2019-12-07 16:43:49,899 INFO L226 Difference]: Without dead ends: 55 [2019-12-07 16:43:49,899 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:43:49,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-12-07 16:43:49,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2019-12-07 16:43:49,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-12-07 16:43:49,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2019-12-07 16:43:49,900 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 24 [2019-12-07 16:43:49,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:43:49,901 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2019-12-07 16:43:49,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:43:49,901 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2019-12-07 16:43:49,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 16:43:49,901 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:43:49,901 INFO L410 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] [2019-12-07 16:43:49,901 INFO L410 AbstractCegarLoop]: === Iteration 20 === [cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 16:43:49,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:43:49,902 INFO L82 PathProgramCache]: Analyzing trace with hash 658911640, now seen corresponding path program 1 times [2019-12-07 16:43:49,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:43:49,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116232285] [2019-12-07 16:43:49,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:43:49,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:50,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:50,057 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:50,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116232285] [2019-12-07 16:43:50,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102499614] [2019-12-07 16:43:50,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_386360c7-50d5-4ed3-9db5-3f24e55aa46d/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:43:50,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:50,115 INFO L264 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 58 conjunts are in the unsatisfiable core [2019-12-07 16:43:50,117 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:43:50,140 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:50,140 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 16:43:50,140 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:50,152 INFO L614 ElimStorePlain]: treesize reduction 10, result has 67.7 percent of original size [2019-12-07 16:43:50,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:43:50,155 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:43:50,155 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:18 [2019-12-07 16:43:50,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:43:50,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:43:50,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:43:50,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:43:50,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:43:50,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:43:50,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:43:50,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:43:50,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:43:50,672 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:50,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:43:50,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2019-12-07 16:43:50,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695652069] [2019-12-07 16:43:50,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-07 16:43:50,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:43:50,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-07 16:43:50,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=597, Unknown=0, NotChecked=0, Total=650 [2019-12-07 16:43:50,674 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 26 states. [2019-12-07 16:43:51,543 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2019-12-07 16:43:52,016 WARN L192 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 55 [2019-12-07 16:43:52,386 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-12-07 16:43:52,690 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-12-07 16:43:53,328 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-12-07 16:43:53,742 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-12-07 16:43:54,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:43:54,218 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2019-12-07 16:43:54,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-07 16:43:54,218 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 24 [2019-12-07 16:43:54,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:43:54,218 INFO L225 Difference]: With dead ends: 66 [2019-12-07 16:43:54,218 INFO L226 Difference]: Without dead ends: 29 [2019-12-07 16:43:54,219 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=338, Invalid=2212, Unknown=0, NotChecked=0, Total=2550 [2019-12-07 16:43:54,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-12-07 16:43:54,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-12-07 16:43:54,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-12-07 16:43:54,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-12-07 16:43:54,220 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 24 [2019-12-07 16:43:54,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:43:54,220 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-12-07 16:43:54,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-07 16:43:54,221 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-12-07 16:43:54,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 16:43:54,221 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:43:54,221 INFO L410 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] [2019-12-07 16:43:54,422 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:43:54,422 INFO L410 AbstractCegarLoop]: === Iteration 21 === [cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 16:43:54,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:43:54,423 INFO L82 PathProgramCache]: Analyzing trace with hash -278253764, now seen corresponding path program 1 times [2019-12-07 16:43:54,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:43:54,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587333937] [2019-12-07 16:43:54,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:43:54,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:54,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:54,495 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 16:43:54,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587333937] [2019-12-07 16:43:54,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788253830] [2019-12-07 16:43:54,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_386360c7-50d5-4ed3-9db5-3f24e55aa46d/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:43:54,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:54,557 INFO L264 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 33 conjunts are in the unsatisfiable core [2019-12-07 16:43:54,559 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:43:54,564 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_18|], 1=[|v_#valid_25|]} [2019-12-07 16:43:54,567 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:43:54,568 INFO L377 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-12-07 16:43:54,568 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:54,574 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:54,578 INFO L377 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-12-07 16:43:54,579 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:54,583 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:54,584 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:43:54,584 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2019-12-07 16:43:54,662 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 16:43:54,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:43:54,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2019-12-07 16:43:54,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497007594] [2019-12-07 16:43:54,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 16:43:54,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:43:54,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 16:43:54,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-07 16:43:54,664 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 15 states. [2019-12-07 16:43:54,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:43:54,870 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-12-07 16:43:54,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 16:43:54,870 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2019-12-07 16:43:54,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:43:54,870 INFO L225 Difference]: With dead ends: 30 [2019-12-07 16:43:54,870 INFO L226 Difference]: Without dead ends: 30 [2019-12-07 16:43:54,871 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2019-12-07 16:43:54,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-12-07 16:43:54,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2019-12-07 16:43:54,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-07 16:43:54,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2019-12-07 16:43:54,871 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 24 [2019-12-07 16:43:54,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:43:54,872 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-12-07 16:43:54,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 16:43:54,872 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2019-12-07 16:43:54,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 16:43:54,872 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:43:54,872 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:43:55,073 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:43:55,074 INFO L410 AbstractCegarLoop]: === Iteration 22 === [cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 16:43:55,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:43:55,074 INFO L82 PathProgramCache]: Analyzing trace with hash -171017834, now seen corresponding path program 2 times [2019-12-07 16:43:55,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:43:55,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521894560] [2019-12-07 16:43:55,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:43:55,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:55,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:55,321 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:55,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521894560] [2019-12-07 16:43:55,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581521496] [2019-12-07 16:43:55,321 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_386360c7-50d5-4ed3-9db5-3f24e55aa46d/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:43:55,383 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 16:43:55,383 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 16:43:55,385 INFO L264 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 54 conjunts are in the unsatisfiable core [2019-12-07 16:43:55,386 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:43:55,390 INFO L377 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-12-07 16:43:55,391 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:55,394 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:55,394 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:43:55,394 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-12-07 16:43:55,422 INFO L377 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-12-07 16:43:55,423 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:55,428 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:55,428 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:43:55,428 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2019-12-07 16:43:55,583 INFO L377 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 22 treesize of output 21 [2019-12-07 16:43:55,584 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:55,595 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:55,595 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 16:43:55,596 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:44, output treesize:29 [2019-12-07 16:43:55,677 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:55,678 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2019-12-07 16:43:55,678 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 16:43:55,686 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:55,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:43:55,687 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:43:55,688 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:27 [2019-12-07 16:43:55,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:43:55,780 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:55,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:43:55,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 27 [2019-12-07 16:43:55,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943149944] [2019-12-07 16:43:55,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-07 16:43:55,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:43:55,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-07 16:43:55,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=643, Unknown=0, NotChecked=0, Total=702 [2019-12-07 16:43:55,781 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 27 states. [2019-12-07 16:43:57,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:43:57,748 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2019-12-07 16:43:57,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-07 16:43:57,749 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-12-07 16:43:57,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:43:57,749 INFO L225 Difference]: With dead ends: 52 [2019-12-07 16:43:57,749 INFO L226 Difference]: Without dead ends: 41 [2019-12-07 16:43:57,750 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=242, Invalid=2410, Unknown=0, NotChecked=0, Total=2652 [2019-12-07 16:43:57,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-12-07 16:43:57,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2019-12-07 16:43:57,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-12-07 16:43:57,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2019-12-07 16:43:57,752 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 27 [2019-12-07 16:43:57,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:43:57,752 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2019-12-07 16:43:57,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-07 16:43:57,752 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2019-12-07 16:43:57,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 16:43:57,752 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:43:57,753 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:43:57,953 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:43:57,954 INFO L410 AbstractCegarLoop]: === Iteration 23 === [cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 16:43:57,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:43:57,954 INFO L82 PathProgramCache]: Analyzing trace with hash -48315534, now seen corresponding path program 3 times [2019-12-07 16:43:57,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:43:57,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483373973] [2019-12-07 16:43:57,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:43:57,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:58,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:58,209 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:58,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483373973] [2019-12-07 16:43:58,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375657259] [2019-12-07 16:43:58,209 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_386360c7-50d5-4ed3-9db5-3f24e55aa46d/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:43:58,288 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-07 16:43:58,289 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 16:43:58,290 INFO L264 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 69 conjunts are in the unsatisfiable core [2019-12-07 16:43:58,293 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:43:58,297 INFO L377 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-12-07 16:43:58,298 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:58,302 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:58,302 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:43:58,302 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-12-07 16:43:58,336 INFO L377 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-12-07 16:43:58,337 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:58,344 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:58,345 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:43:58,345 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2019-12-07 16:43:58,388 INFO L377 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 19 treesize of output 18 [2019-12-07 16:43:58,388 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:58,394 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:58,394 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:43:58,394 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:15 [2019-12-07 16:43:58,443 INFO L377 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 19 treesize of output 18 [2019-12-07 16:43:58,443 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:58,448 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:58,449 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:43:58,449 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:11 [2019-12-07 16:43:58,486 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 16:43:58,486 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:58,487 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:58,487 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:43:58,487 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-12-07 16:43:58,490 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:58,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:43:58,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 25 [2019-12-07 16:43:58,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885131055] [2019-12-07 16:43:58,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-07 16:43:58,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:43:58,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-07 16:43:58,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=536, Unknown=0, NotChecked=0, Total=600 [2019-12-07 16:43:58,492 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 25 states. [2019-12-07 16:43:59,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:43:59,132 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2019-12-07 16:43:59,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 16:43:59,132 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 35 [2019-12-07 16:43:59,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:43:59,133 INFO L225 Difference]: With dead ends: 58 [2019-12-07 16:43:59,133 INFO L226 Difference]: Without dead ends: 43 [2019-12-07 16:43:59,134 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 27 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=136, Invalid=1124, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 16:43:59,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-12-07 16:43:59,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2019-12-07 16:43:59,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-12-07 16:43:59,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2019-12-07 16:43:59,137 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 35 [2019-12-07 16:43:59,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:43:59,138 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2019-12-07 16:43:59,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-07 16:43:59,138 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2019-12-07 16:43:59,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 16:43:59,139 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:43:59,139 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:43:59,340 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:43:59,341 INFO L410 AbstractCegarLoop]: === Iteration 24 === [cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 16:43:59,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:43:59,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1249409291, now seen corresponding path program 4 times [2019-12-07 16:43:59,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:43:59,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865212486] [2019-12-07 16:43:59,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:43:59,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:59,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:43:59,488 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:43:59,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865212486] [2019-12-07 16:43:59,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287006909] [2019-12-07 16:43:59,489 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_386360c7-50d5-4ed3-9db5-3f24e55aa46d/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:43:59,559 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 16:43:59,559 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 16:43:59,560 INFO L264 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 73 conjunts are in the unsatisfiable core [2019-12-07 16:43:59,562 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:43:59,565 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_19|], 1=[|v_#valid_28|]} [2019-12-07 16:43:59,567 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:43:59,568 INFO L377 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-12-07 16:43:59,568 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:59,575 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:59,578 INFO L377 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-12-07 16:43:59,578 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:59,584 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:59,584 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:43:59,584 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:16 [2019-12-07 16:43:59,657 INFO L377 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 16 treesize of output 12 [2019-12-07 16:43:59,657 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:59,662 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:59,662 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:43:59,662 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-12-07 16:43:59,788 INFO L377 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 23 treesize of output 22 [2019-12-07 16:43:59,788 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:59,796 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:59,797 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:43:59,797 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:27 [2019-12-07 16:43:59,854 INFO L377 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 23 treesize of output 22 [2019-12-07 16:43:59,855 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:43:59,862 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:59,863 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:43:59,863 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:38, output treesize:23 [2019-12-07 16:43:59,930 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:59,931 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2019-12-07 16:43:59,931 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 16:43:59,938 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:43:59,938 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:43:59,938 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2019-12-07 16:43:59,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:00,029 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:44:00,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:44:00,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 31 [2019-12-07 16:44:00,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60355485] [2019-12-07 16:44:00,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-07 16:44:00,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:44:00,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-07 16:44:00,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2019-12-07 16:44:00,030 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 32 states. [2019-12-07 16:44:00,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:44:00,930 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2019-12-07 16:44:00,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 16:44:00,930 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 39 [2019-12-07 16:44:00,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:44:00,931 INFO L225 Difference]: With dead ends: 46 [2019-12-07 16:44:00,931 INFO L226 Difference]: Without dead ends: 46 [2019-12-07 16:44:00,931 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=229, Invalid=1933, Unknown=0, NotChecked=0, Total=2162 [2019-12-07 16:44:00,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-12-07 16:44:00,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2019-12-07 16:44:00,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-12-07 16:44:00,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-12-07 16:44:00,933 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 39 [2019-12-07 16:44:00,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:44:00,933 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-12-07 16:44:00,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-07 16:44:00,933 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-12-07 16:44:00,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 16:44:00,933 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:44:00,933 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:44:01,134 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:44:01,134 INFO L410 AbstractCegarLoop]: === Iteration 25 === [cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 16:44:01,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:44:01,135 INFO L82 PathProgramCache]: Analyzing trace with hash 129961038, now seen corresponding path program 5 times [2019-12-07 16:44:01,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:44:01,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141590492] [2019-12-07 16:44:01,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:44:01,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:44:01,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:44:01,496 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:44:01,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141590492] [2019-12-07 16:44:01,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743196718] [2019-12-07 16:44:01,497 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_386360c7-50d5-4ed3-9db5-3f24e55aa46d/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:44:01,600 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-12-07 16:44:01,600 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 16:44:01,603 INFO L264 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 107 conjunts are in the unsatisfiable core [2019-12-07 16:44:01,605 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:44:01,607 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_20|], 1=[|v_#valid_29|]} [2019-12-07 16:44:01,609 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:44:01,610 INFO L377 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-12-07 16:44:01,610 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:01,617 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:01,620 INFO L377 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-12-07 16:44:01,620 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:01,626 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:01,627 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:44:01,627 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:19 [2019-12-07 16:44:01,726 INFO L377 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 16 treesize of output 12 [2019-12-07 16:44:01,726 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:01,732 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:01,732 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:44:01,732 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2019-12-07 16:44:01,866 INFO L377 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 23 treesize of output 22 [2019-12-07 16:44:01,867 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:01,874 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:01,874 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:44:01,874 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:27 [2019-12-07 16:44:01,948 INFO L377 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 23 treesize of output 22 [2019-12-07 16:44:01,948 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:01,955 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:01,955 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:44:01,955 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:24 [2019-12-07 16:44:02,028 INFO L377 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 23 treesize of output 22 [2019-12-07 16:44:02,028 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:02,034 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:02,034 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:44:02,035 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:20 [2019-12-07 16:44:02,119 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:02,120 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2019-12-07 16:44:02,120 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 16:44:02,126 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:02,126 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:44:02,126 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2019-12-07 16:44:02,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:02,238 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:44:02,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:44:02,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 18] total 40 [2019-12-07 16:44:02,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506799302] [2019-12-07 16:44:02,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-12-07 16:44:02,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:44:02,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-12-07 16:44:02,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1470, Unknown=0, NotChecked=0, Total=1560 [2019-12-07 16:44:02,239 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 40 states. [2019-12-07 16:44:03,997 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-12-07 16:44:05,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:44:05,810 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2019-12-07 16:44:05,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-07 16:44:05,810 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 43 [2019-12-07 16:44:05,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:44:05,811 INFO L225 Difference]: With dead ends: 76 [2019-12-07 16:44:05,811 INFO L226 Difference]: Without dead ends: 57 [2019-12-07 16:44:05,812 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 794 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=339, Invalid=4773, Unknown=0, NotChecked=0, Total=5112 [2019-12-07 16:44:05,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-12-07 16:44:05,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 52. [2019-12-07 16:44:05,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-12-07 16:44:05,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2019-12-07 16:44:05,814 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 43 [2019-12-07 16:44:05,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:44:05,814 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2019-12-07 16:44:05,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-12-07 16:44:05,814 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2019-12-07 16:44:05,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 16:44:05,814 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:44:05,814 INFO L410 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:44:06,015 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:44:06,016 INFO L410 AbstractCegarLoop]: === Iteration 26 === [cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 16:44:06,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:44:06,016 INFO L82 PathProgramCache]: Analyzing trace with hash -184888278, now seen corresponding path program 6 times [2019-12-07 16:44:06,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:44:06,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703037579] [2019-12-07 16:44:06,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:44:06,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:44:06,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:44:06,659 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:44:06,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703037579] [2019-12-07 16:44:06,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029040837] [2019-12-07 16:44:06,660 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_386360c7-50d5-4ed3-9db5-3f24e55aa46d/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:44:06,767 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2019-12-07 16:44:06,767 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 16:44:06,770 INFO L264 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 131 conjunts are in the unsatisfiable core [2019-12-07 16:44:06,772 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:44:06,775 INFO L377 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-12-07 16:44:06,776 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:06,780 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:06,781 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:44:06,781 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2019-12-07 16:44:07,183 INFO L377 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-12-07 16:44:07,183 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:07,207 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:07,208 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:44:07,208 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:27 [2019-12-07 16:44:07,643 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-12-07 16:44:07,643 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:07,668 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:07,668 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:44:07,669 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:26 [2019-12-07 16:44:07,934 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-12-07 16:44:07,935 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:07,946 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:07,946 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:44:07,946 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:26 [2019-12-07 16:44:08,049 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-12-07 16:44:08,049 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:08,057 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:08,058 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:44:08,058 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:26 [2019-12-07 16:44:08,153 INFO L377 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 23 treesize of output 22 [2019-12-07 16:44:08,153 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:08,165 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:08,165 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:44:08,165 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:26 [2019-12-07 16:44:08,242 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 16:44:08,243 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:08,244 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2019-12-07 16:44:08,244 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:08,247 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:08,247 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:44:08,247 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:3 [2019-12-07 16:44:08,257 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:44:08,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:44:08,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 22] total 46 [2019-12-07 16:44:08,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68483361] [2019-12-07 16:44:08,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-12-07 16:44:08,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:44:08,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-12-07 16:44:08,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1941, Unknown=0, NotChecked=0, Total=2070 [2019-12-07 16:44:08,258 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 46 states. [2019-12-07 16:44:09,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:44:09,779 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2019-12-07 16:44:09,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 16:44:09,780 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 51 [2019-12-07 16:44:09,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:44:09,781 INFO L225 Difference]: With dead ends: 82 [2019-12-07 16:44:09,781 INFO L226 Difference]: Without dead ends: 59 [2019-12-07 16:44:09,783 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 762 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=255, Invalid=3285, Unknown=0, NotChecked=0, Total=3540 [2019-12-07 16:44:09,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-12-07 16:44:09,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2019-12-07 16:44:09,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-12-07 16:44:09,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2019-12-07 16:44:09,786 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 51 [2019-12-07 16:44:09,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:44:09,787 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2019-12-07 16:44:09,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-12-07 16:44:09,787 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2019-12-07 16:44:09,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 16:44:09,788 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:44:09,788 INFO L410 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:44:09,988 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:44:09,989 INFO L410 AbstractCegarLoop]: === Iteration 27 === [cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 16:44:09,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:44:09,989 INFO L82 PathProgramCache]: Analyzing trace with hash -2006306387, now seen corresponding path program 7 times [2019-12-07 16:44:09,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:44:09,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387110038] [2019-12-07 16:44:09,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:44:10,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:44:10,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:44:10,216 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 30 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:44:10,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387110038] [2019-12-07 16:44:10,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093194870] [2019-12-07 16:44:10,217 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_386360c7-50d5-4ed3-9db5-3f24e55aa46d/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:44:10,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:44:10,306 INFO L264 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 63 conjunts are in the unsatisfiable core [2019-12-07 16:44:10,308 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:44:10,452 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 28 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:44:10,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:44:10,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 29 [2019-12-07 16:44:10,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939956632] [2019-12-07 16:44:10,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-07 16:44:10,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:44:10,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-07 16:44:10,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=765, Unknown=0, NotChecked=0, Total=870 [2019-12-07 16:44:10,453 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 30 states. [2019-12-07 16:44:10,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:44:10,956 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2019-12-07 16:44:10,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 16:44:10,956 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 55 [2019-12-07 16:44:10,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:44:10,957 INFO L225 Difference]: With dead ends: 62 [2019-12-07 16:44:10,957 INFO L226 Difference]: Without dead ends: 62 [2019-12-07 16:44:10,957 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=187, Invalid=1373, Unknown=0, NotChecked=0, Total=1560 [2019-12-07 16:44:10,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-12-07 16:44:10,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2019-12-07 16:44:10,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-12-07 16:44:10,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2019-12-07 16:44:10,959 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 55 [2019-12-07 16:44:10,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:44:10,959 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2019-12-07 16:44:10,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-07 16:44:10,959 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2019-12-07 16:44:10,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 16:44:10,960 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:44:10,960 INFO L410 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:44:11,160 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:44:11,161 INFO L410 AbstractCegarLoop]: === Iteration 28 === [cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 16:44:11,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:44:11,161 INFO L82 PathProgramCache]: Analyzing trace with hash -10642682, now seen corresponding path program 8 times [2019-12-07 16:44:11,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:44:11,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818518378] [2019-12-07 16:44:11,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:44:11,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:44:11,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:44:11,796 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 12 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:44:11,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818518378] [2019-12-07 16:44:11,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335062634] [2019-12-07 16:44:11,797 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_386360c7-50d5-4ed3-9db5-3f24e55aa46d/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:44:11,875 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 16:44:11,875 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 16:44:11,878 INFO L264 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 119 conjunts are in the unsatisfiable core [2019-12-07 16:44:11,880 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:44:11,883 INFO L377 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-12-07 16:44:11,883 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:11,886 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:11,887 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:44:11,887 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-12-07 16:44:11,927 INFO L377 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-12-07 16:44:11,927 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:11,934 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:11,934 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:44:11,934 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2019-12-07 16:44:12,168 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-12-07 16:44:12,169 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:12,180 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:12,180 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:44:12,181 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:28 [2019-12-07 16:44:12,284 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-12-07 16:44:12,284 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:12,292 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:12,292 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:44:12,293 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:28 [2019-12-07 16:44:12,398 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-12-07 16:44:12,398 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:12,407 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:12,407 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:44:12,407 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:28 [2019-12-07 16:44:12,526 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-12-07 16:44:12,527 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:12,536 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:12,536 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:44:12,536 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:28 [2019-12-07 16:44:12,653 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-12-07 16:44:12,653 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:12,661 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:12,662 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:44:12,662 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:24 [2019-12-07 16:44:12,784 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:12,784 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2019-12-07 16:44:12,784 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 16:44:12,792 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:12,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:12,793 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:44:12,793 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:39 [2019-12-07 16:44:12,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:12,962 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:44:12,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:44:12,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 25] total 50 [2019-12-07 16:44:12,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873685834] [2019-12-07 16:44:12,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-12-07 16:44:12,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:44:12,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-12-07 16:44:12,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=2333, Unknown=0, NotChecked=0, Total=2450 [2019-12-07 16:44:12,963 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 50 states. [2019-12-07 16:44:15,446 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-12-07 16:44:18,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:44:18,735 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2019-12-07 16:44:18,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-07 16:44:18,735 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 59 [2019-12-07 16:44:18,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:44:18,736 INFO L225 Difference]: With dead ends: 100 [2019-12-07 16:44:18,736 INFO L226 Difference]: Without dead ends: 73 [2019-12-07 16:44:18,738 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1109 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=382, Invalid=7274, Unknown=0, NotChecked=0, Total=7656 [2019-12-07 16:44:18,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-12-07 16:44:18,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 68. [2019-12-07 16:44:18,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-12-07 16:44:18,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2019-12-07 16:44:18,739 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 59 [2019-12-07 16:44:18,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:44:18,739 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2019-12-07 16:44:18,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-12-07 16:44:18,739 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2019-12-07 16:44:18,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 16:44:18,740 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:44:18,740 INFO L410 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:44:18,940 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:44:18,940 INFO L410 AbstractCegarLoop]: === Iteration 29 === [cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 16:44:18,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:44:18,941 INFO L82 PathProgramCache]: Analyzing trace with hash 481485026, now seen corresponding path program 9 times [2019-12-07 16:44:18,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:44:18,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091411966] [2019-12-07 16:44:18,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:44:18,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:44:19,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:44:19,651 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 14 proven. 150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:44:19,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091411966] [2019-12-07 16:44:19,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070225894] [2019-12-07 16:44:19,651 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_386360c7-50d5-4ed3-9db5-3f24e55aa46d/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:44:19,842 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-12-07 16:44:19,842 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 16:44:19,845 INFO L264 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 165 conjunts are in the unsatisfiable core [2019-12-07 16:44:19,847 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:44:19,851 INFO L377 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-12-07 16:44:19,851 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:19,855 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:19,855 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:44:19,855 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2019-12-07 16:44:20,137 INFO L377 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-12-07 16:44:20,137 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:20,143 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:20,144 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:44:20,144 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:27 [2019-12-07 16:44:20,344 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-12-07 16:44:20,345 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:20,353 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:20,353 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:44:20,353 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:26 [2019-12-07 16:44:20,479 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-12-07 16:44:20,479 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:20,495 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:20,495 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:44:20,496 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:26 [2019-12-07 16:44:20,679 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-12-07 16:44:20,679 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:20,687 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:20,687 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:44:20,687 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:26 [2019-12-07 16:44:20,786 INFO L377 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 23 treesize of output 22 [2019-12-07 16:44:20,787 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:20,795 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:20,795 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:44:20,795 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:26 [2019-12-07 16:44:20,940 INFO L377 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 23 treesize of output 22 [2019-12-07 16:44:20,940 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:20,954 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:20,954 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:44:20,954 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:26 [2019-12-07 16:44:21,174 INFO L377 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 23 treesize of output 22 [2019-12-07 16:44:21,175 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:21,182 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:21,183 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:44:21,183 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:22 [2019-12-07 16:44:21,279 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 16:44:21,280 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:21,281 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2019-12-07 16:44:21,281 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:21,284 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:21,284 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:44:21,284 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:3 [2019-12-07 16:44:21,304 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 14 proven. 150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:44:21,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:44:21,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 28] total 60 [2019-12-07 16:44:21,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448968673] [2019-12-07 16:44:21,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-12-07 16:44:21,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:44:21,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-12-07 16:44:21,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=3369, Unknown=0, NotChecked=0, Total=3540 [2019-12-07 16:44:21,306 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 60 states. [2019-12-07 16:44:24,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:44:24,334 INFO L93 Difference]: Finished difference Result 106 states and 107 transitions. [2019-12-07 16:44:24,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-07 16:44:24,334 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 67 [2019-12-07 16:44:24,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:44:24,335 INFO L225 Difference]: With dead ends: 106 [2019-12-07 16:44:24,335 INFO L226 Difference]: Without dead ends: 75 [2019-12-07 16:44:24,336 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1373 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=337, Invalid=5669, Unknown=0, NotChecked=0, Total=6006 [2019-12-07 16:44:24,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-12-07 16:44:24,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2019-12-07 16:44:24,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-12-07 16:44:24,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2019-12-07 16:44:24,338 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 67 [2019-12-07 16:44:24,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:44:24,338 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2019-12-07 16:44:24,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-12-07 16:44:24,338 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2019-12-07 16:44:24,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 16:44:24,338 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:44:24,338 INFO L410 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:44:24,539 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:44:24,539 INFO L410 AbstractCegarLoop]: === Iteration 30 === [cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 16:44:24,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:44:24,540 INFO L82 PathProgramCache]: Analyzing trace with hash -290138011, now seen corresponding path program 10 times [2019-12-07 16:44:24,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:44:24,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749992200] [2019-12-07 16:44:24,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:44:24,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:44:24,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:44:24,825 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 68 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:44:24,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749992200] [2019-12-07 16:44:24,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855418133] [2019-12-07 16:44:24,826 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_386360c7-50d5-4ed3-9db5-3f24e55aa46d/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:44:24,925 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 16:44:24,925 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 16:44:24,929 INFO L264 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 129 conjunts are in the unsatisfiable core [2019-12-07 16:44:24,930 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:44:24,932 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_21|], 1=[|v_#valid_33|]} [2019-12-07 16:44:24,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:44:24,935 INFO L377 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-12-07 16:44:24,935 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:24,941 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:24,944 INFO L377 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-12-07 16:44:24,944 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:24,951 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:24,952 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:44:24,952 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:16 [2019-12-07 16:44:25,157 INFO L377 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 16 treesize of output 12 [2019-12-07 16:44:25,157 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:25,162 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:25,162 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:44:25,162 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-12-07 16:44:25,321 INFO L377 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 23 treesize of output 22 [2019-12-07 16:44:25,321 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:25,329 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:25,329 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:44:25,329 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:27 [2019-12-07 16:44:25,405 INFO L377 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 23 treesize of output 22 [2019-12-07 16:44:25,406 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:25,412 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:25,413 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:44:25,413 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:27 [2019-12-07 16:44:25,494 INFO L377 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 23 treesize of output 22 [2019-12-07 16:44:25,495 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:25,502 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:25,503 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:44:25,503 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:27 [2019-12-07 16:44:25,588 INFO L377 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 23 treesize of output 22 [2019-12-07 16:44:25,588 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:25,595 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:25,595 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:44:25,596 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:27 [2019-12-07 16:44:25,682 INFO L377 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 23 treesize of output 22 [2019-12-07 16:44:25,682 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:25,690 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:25,690 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:44:25,690 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:27 [2019-12-07 16:44:25,779 INFO L377 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 23 treesize of output 22 [2019-12-07 16:44:25,779 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:25,787 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:25,787 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:44:25,787 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:38, output treesize:23 [2019-12-07 16:44:25,883 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:25,884 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2019-12-07 16:44:25,884 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 16:44:25,890 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:25,891 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:44:25,891 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2019-12-07 16:44:25,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:26,057 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 72 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:44:26,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:44:26,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 29] total 51 [2019-12-07 16:44:26,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997309245] [2019-12-07 16:44:26,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-12-07 16:44:26,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:44:26,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-12-07 16:44:26,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=2454, Unknown=0, NotChecked=0, Total=2652 [2019-12-07 16:44:26,059 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 52 states. [2019-12-07 16:44:28,286 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-12-07 16:44:29,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:44:29,492 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2019-12-07 16:44:29,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-07 16:44:29,492 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 71 [2019-12-07 16:44:29,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:44:29,493 INFO L225 Difference]: With dead ends: 78 [2019-12-07 16:44:29,493 INFO L226 Difference]: Without dead ends: 78 [2019-12-07 16:44:29,494 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1184 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=435, Invalid=5115, Unknown=0, NotChecked=0, Total=5550 [2019-12-07 16:44:29,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-12-07 16:44:29,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-12-07 16:44:29,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-12-07 16:44:29,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2019-12-07 16:44:29,496 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 71 [2019-12-07 16:44:29,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:44:29,496 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2019-12-07 16:44:29,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-12-07 16:44:29,496 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2019-12-07 16:44:29,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 16:44:29,496 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:44:29,496 INFO L410 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:44:29,697 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:44:29,697 INFO L410 AbstractCegarLoop]: === Iteration 31 === [cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 16:44:29,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:44:29,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1577461182, now seen corresponding path program 11 times [2019-12-07 16:44:29,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:44:29,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952276509] [2019-12-07 16:44:29,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:44:29,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:44:30,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:44:30,548 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 16 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:44:30,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952276509] [2019-12-07 16:44:30,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858747464] [2019-12-07 16:44:30,549 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_386360c7-50d5-4ed3-9db5-3f24e55aa46d/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:44:30,726 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2019-12-07 16:44:30,726 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 16:44:30,729 INFO L264 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 144 conjunts are in the unsatisfiable core [2019-12-07 16:44:30,731 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:44:30,735 INFO L377 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-12-07 16:44:30,735 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:30,739 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:30,739 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:44:30,740 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-12-07 16:44:30,802 INFO L377 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-12-07 16:44:30,802 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:30,808 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:30,808 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:44:30,808 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2019-12-07 16:44:30,872 INFO L377 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 19 treesize of output 18 [2019-12-07 16:44:30,872 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:30,877 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:30,877 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:44:30,878 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:15 [2019-12-07 16:44:30,948 INFO L377 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 19 treesize of output 18 [2019-12-07 16:44:30,948 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:30,957 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:30,958 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:44:30,958 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:15 [2019-12-07 16:44:31,035 INFO L377 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 19 treesize of output 18 [2019-12-07 16:44:31,035 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:31,041 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:31,041 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:44:31,041 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:15 [2019-12-07 16:44:31,121 INFO L377 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 19 treesize of output 18 [2019-12-07 16:44:31,121 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:31,126 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:31,127 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:44:31,127 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:15 [2019-12-07 16:44:31,210 INFO L377 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 19 treesize of output 18 [2019-12-07 16:44:31,211 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:31,216 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:31,216 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:44:31,216 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:15 [2019-12-07 16:44:31,297 INFO L377 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 19 treesize of output 18 [2019-12-07 16:44:31,297 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:31,303 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:31,303 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:44:31,303 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:15 [2019-12-07 16:44:31,458 INFO L377 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 19 treesize of output 18 [2019-12-07 16:44:31,459 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:31,471 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:31,471 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:44:31,471 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:11 [2019-12-07 16:44:31,682 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 16:44:31,682 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:31,684 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:31,684 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:44:31,685 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-12-07 16:44:31,713 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 16 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:44:31,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:44:31,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 31] total 55 [2019-12-07 16:44:31,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219981322] [2019-12-07 16:44:31,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-12-07 16:44:31,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:44:31,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-12-07 16:44:31,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=2816, Unknown=0, NotChecked=0, Total=2970 [2019-12-07 16:44:31,715 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 55 states. [2019-12-07 16:44:34,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:44:34,951 INFO L93 Difference]: Finished difference Result 118 states and 119 transitions. [2019-12-07 16:44:34,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-07 16:44:34,951 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 75 [2019-12-07 16:44:34,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:44:34,952 INFO L225 Difference]: With dead ends: 118 [2019-12-07 16:44:34,952 INFO L226 Difference]: Without dead ends: 83 [2019-12-07 16:44:34,952 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 56 SyntacticMatches, 6 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1129 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=296, Invalid=5404, Unknown=0, NotChecked=0, Total=5700 [2019-12-07 16:44:34,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-12-07 16:44:34,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2019-12-07 16:44:34,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-12-07 16:44:34,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2019-12-07 16:44:34,954 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 75 [2019-12-07 16:44:34,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:44:34,954 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2019-12-07 16:44:34,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-12-07 16:44:34,954 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2019-12-07 16:44:34,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-07 16:44:34,955 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:44:34,955 INFO L410 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:44:35,155 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:44:35,156 INFO L410 AbstractCegarLoop]: === Iteration 32 === [cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 16:44:35,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:44:35,156 INFO L82 PathProgramCache]: Analyzing trace with hash -2061112767, now seen corresponding path program 12 times [2019-12-07 16:44:35,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:44:35,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719428329] [2019-12-07 16:44:35,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:44:35,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:44:35,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:44:35,493 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 93 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:44:35,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719428329] [2019-12-07 16:44:35,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757028469] [2019-12-07 16:44:35,494 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_386360c7-50d5-4ed3-9db5-3f24e55aa46d/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:44:35,844 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-12-07 16:44:35,844 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 16:44:35,847 INFO L264 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 78 conjunts are in the unsatisfiable core [2019-12-07 16:44:35,849 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:44:35,858 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:35,858 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 16:44:35,858 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:35,872 INFO L614 ElimStorePlain]: treesize reduction 10, result has 67.7 percent of original size [2019-12-07 16:44:35,872 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:44:35,872 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:12 [2019-12-07 16:44:36,334 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 91 proven. 157 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:44:36,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:44:36,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22] total 46 [2019-12-07 16:44:36,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740365945] [2019-12-07 16:44:36,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-12-07 16:44:36,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:44:36,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-12-07 16:44:36,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1929, Unknown=0, NotChecked=0, Total=2162 [2019-12-07 16:44:36,336 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 47 states. [2019-12-07 16:44:39,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:44:39,016 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2019-12-07 16:44:39,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-07 16:44:39,016 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 79 [2019-12-07 16:44:39,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:44:39,017 INFO L225 Difference]: With dead ends: 86 [2019-12-07 16:44:39,017 INFO L226 Difference]: Without dead ends: 86 [2019-12-07 16:44:39,017 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1159 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=491, Invalid=3931, Unknown=0, NotChecked=0, Total=4422 [2019-12-07 16:44:39,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-12-07 16:44:39,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2019-12-07 16:44:39,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-12-07 16:44:39,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2019-12-07 16:44:39,019 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 79 [2019-12-07 16:44:39,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:44:39,019 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2019-12-07 16:44:39,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-12-07 16:44:39,019 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2019-12-07 16:44:39,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-07 16:44:39,020 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:44:39,020 INFO L410 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:44:39,220 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:44:39,221 INFO L410 AbstractCegarLoop]: === Iteration 33 === [cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 16:44:39,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:44:39,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1336076698, now seen corresponding path program 13 times [2019-12-07 16:44:39,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:44:39,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930303986] [2019-12-07 16:44:39,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:44:39,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:44:40,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:44:40,448 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 18 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:44:40,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930303986] [2019-12-07 16:44:40,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056114998] [2019-12-07 16:44:40,448 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_386360c7-50d5-4ed3-9db5-3f24e55aa46d/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:44:40,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:44:40,539 INFO L264 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 152 conjunts are in the unsatisfiable core [2019-12-07 16:44:40,541 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:44:40,544 INFO L377 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-12-07 16:44:40,544 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:40,547 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:40,547 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:44:40,547 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-12-07 16:44:40,841 INFO L377 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-12-07 16:44:40,841 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:40,846 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:40,847 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:44:40,847 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2019-12-07 16:44:41,177 INFO L377 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 22 treesize of output 21 [2019-12-07 16:44:41,177 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:41,192 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:41,193 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 16:44:41,193 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:44, output treesize:33 [2019-12-07 16:44:41,566 INFO L377 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 22 treesize of output 21 [2019-12-07 16:44:41,567 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:41,592 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:41,593 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 16:44:41,593 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:44, output treesize:33 [2019-12-07 16:44:42,013 INFO L377 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 22 treesize of output 21 [2019-12-07 16:44:42,014 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:42,038 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:42,038 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 16:44:42,039 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:44, output treesize:33 [2019-12-07 16:44:42,470 INFO L377 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 22 treesize of output 21 [2019-12-07 16:44:42,471 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:42,494 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:42,494 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 16:44:42,495 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:44, output treesize:33 [2019-12-07 16:44:42,657 INFO L377 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 22 treesize of output 21 [2019-12-07 16:44:42,657 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:42,666 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:42,666 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 16:44:42,666 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:44, output treesize:33 [2019-12-07 16:44:42,840 INFO L377 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 22 treesize of output 21 [2019-12-07 16:44:42,840 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:42,851 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:42,852 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 16:44:42,852 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:44, output treesize:33 [2019-12-07 16:44:43,317 INFO L377 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 22 treesize of output 21 [2019-12-07 16:44:43,318 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:43,330 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:43,330 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 16:44:43,331 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:44, output treesize:33 [2019-12-07 16:44:43,543 INFO L377 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 22 treesize of output 21 [2019-12-07 16:44:43,543 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:44:43,559 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:43,559 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 16:44:43,559 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:44, output treesize:29 [2019-12-07 16:44:43,977 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:43,977 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2019-12-07 16:44:43,977 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 16:44:43,986 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:44:43,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:43,986 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:44:43,987 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:27 [2019-12-07 16:44:44,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:44:44,214 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 91 proven. 191 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:44:44,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:44:44,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 34] total 76 [2019-12-07 16:44:44,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238844014] [2019-12-07 16:44:44,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-12-07 16:44:44,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:44:44,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-12-07 16:44:44,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=5458, Unknown=0, NotChecked=0, Total=5700 [2019-12-07 16:44:44,215 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 76 states. [2019-12-07 16:44:58,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:44:58,891 INFO L93 Difference]: Finished difference Result 136 states and 137 transitions. [2019-12-07 16:44:58,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-12-07 16:44:58,891 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 83 [2019-12-07 16:44:58,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:44:58,892 INFO L225 Difference]: With dead ends: 136 [2019-12-07 16:44:58,892 INFO L226 Difference]: Without dead ends: 97 [2019-12-07 16:44:58,893 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3011 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=650, Invalid=15605, Unknown=1, NotChecked=0, Total=16256 [2019-12-07 16:44:58,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-12-07 16:44:58,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 92. [2019-12-07 16:44:58,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-12-07 16:44:58,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2019-12-07 16:44:58,895 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 83 [2019-12-07 16:44:58,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:44:58,895 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2019-12-07 16:44:58,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-12-07 16:44:58,895 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2019-12-07 16:44:58,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-12-07 16:44:58,895 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:44:58,895 INFO L410 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:44:59,096 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:44:59,096 INFO L410 AbstractCegarLoop]: === Iteration 34 === [cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 16:44:59,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:44:59,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1494527094, now seen corresponding path program 14 times [2019-12-07 16:44:59,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:44:59,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019800622] [2019-12-07 16:44:59,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:44:59,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:45:00,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:45:00,444 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 20 proven. 333 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:45:00,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019800622] [2019-12-07 16:45:00,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760478349] [2019-12-07 16:45:00,444 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_386360c7-50d5-4ed3-9db5-3f24e55aa46d/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-12-07 16:45:00,539 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 16:45:00,539 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 16:45:00,542 INFO L264 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 179 conjunts are in the unsatisfiable core [2019-12-07 16:45:00,544 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:45:00,547 INFO L377 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-12-07 16:45:00,548 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:00,551 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:00,551 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:45:00,551 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-12-07 16:45:00,607 INFO L377 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-12-07 16:45:00,607 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:00,613 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:00,613 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:45:00,614 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2019-12-07 16:45:00,900 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-12-07 16:45:00,900 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:00,908 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:00,908 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:45:00,909 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:28 [2019-12-07 16:45:01,041 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-12-07 16:45:01,042 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:01,050 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:01,050 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:45:01,050 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:28 [2019-12-07 16:45:01,226 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-12-07 16:45:01,226 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:01,240 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:01,240 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:45:01,240 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:28 [2019-12-07 16:45:01,394 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-12-07 16:45:01,394 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:01,402 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:01,403 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:45:01,403 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:28 [2019-12-07 16:45:01,548 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-12-07 16:45:01,548 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:01,559 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:01,560 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:45:01,560 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:28 [2019-12-07 16:45:01,708 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-12-07 16:45:01,708 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:01,717 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:01,717 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:45:01,717 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:28 [2019-12-07 16:45:01,876 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-12-07 16:45:01,876 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:01,885 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:01,885 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:45:01,885 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:28 [2019-12-07 16:45:02,038 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-12-07 16:45:02,038 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:02,046 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:02,047 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:45:02,047 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:28 [2019-12-07 16:45:02,205 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-12-07 16:45:02,205 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:02,213 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:02,214 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:45:02,214 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:24 [2019-12-07 16:45:02,404 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:02,405 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2019-12-07 16:45:02,405 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 16:45:02,412 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:02,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:45:02,413 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:45:02,413 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:39 [2019-12-07 16:45:02,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:45:02,664 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 0 proven. 353 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:45:02,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:45:02,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 37] total 74 [2019-12-07 16:45:02,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768291462] [2019-12-07 16:45:02,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-12-07 16:45:02,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:45:02,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-12-07 16:45:02,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=5225, Unknown=0, NotChecked=0, Total=5402 [2019-12-07 16:45:02,665 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 74 states. [2019-12-07 16:45:10,491 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-12-07 16:45:11,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:45:11,308 INFO L93 Difference]: Finished difference Result 148 states and 149 transitions. [2019-12-07 16:45:11,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-12-07 16:45:11,309 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 91 [2019-12-07 16:45:11,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:45:11,309 INFO L225 Difference]: With dead ends: 148 [2019-12-07 16:45:11,309 INFO L226 Difference]: Without dead ends: 105 [2019-12-07 16:45:11,311 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 64 SyntacticMatches, 3 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2425 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=550, Invalid=15706, Unknown=0, NotChecked=0, Total=16256 [2019-12-07 16:45:11,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-12-07 16:45:11,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 100. [2019-12-07 16:45:11,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-12-07 16:45:11,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2019-12-07 16:45:11,313 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 91 [2019-12-07 16:45:11,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:45:11,314 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2019-12-07 16:45:11,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-12-07 16:45:11,314 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2019-12-07 16:45:11,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 16:45:11,314 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:45:11,314 INFO L410 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:45:11,515 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:45:11,515 INFO L410 AbstractCegarLoop]: === Iteration 35 === [cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 16:45:11,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:45:11,516 INFO L82 PathProgramCache]: Analyzing trace with hash 489090642, now seen corresponding path program 15 times [2019-12-07 16:45:11,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:45:11,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906460453] [2019-12-07 16:45:11,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:45:11,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:45:13,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:45:13,521 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 22 proven. 410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:45:13,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906460453] [2019-12-07 16:45:13,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742913507] [2019-12-07 16:45:13,521 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_386360c7-50d5-4ed3-9db5-3f24e55aa46d/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-12-07 16:45:15,048 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-12-07 16:45:15,049 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 16:45:15,056 INFO L264 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 246 conjunts are in the unsatisfiable core [2019-12-07 16:45:15,058 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:45:15,061 INFO L377 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-12-07 16:45:15,061 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:15,067 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:15,067 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:45:15,067 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2019-12-07 16:45:15,622 INFO L377 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-12-07 16:45:15,622 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:15,629 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:15,630 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:45:15,630 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:27 [2019-12-07 16:45:15,897 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-12-07 16:45:15,897 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:15,905 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:15,905 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:45:15,905 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:26 [2019-12-07 16:45:16,045 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-12-07 16:45:16,045 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:16,053 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:16,054 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:45:16,054 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:26 [2019-12-07 16:45:16,196 INFO L377 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 23 treesize of output 22 [2019-12-07 16:45:16,196 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:16,204 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:16,205 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:45:16,205 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:26 [2019-12-07 16:45:16,343 INFO L377 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 23 treesize of output 22 [2019-12-07 16:45:16,343 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:16,351 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:16,351 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:45:16,351 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:26 [2019-12-07 16:45:16,495 INFO L377 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 23 treesize of output 22 [2019-12-07 16:45:16,495 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:16,503 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:16,503 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:45:16,504 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:26 [2019-12-07 16:45:16,653 INFO L377 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 23 treesize of output 22 [2019-12-07 16:45:16,653 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:16,661 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:16,661 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:45:16,662 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:26 [2019-12-07 16:45:16,840 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-12-07 16:45:16,841 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:16,851 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:16,851 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:45:16,851 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:26 [2019-12-07 16:45:17,196 INFO L377 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 23 treesize of output 22 [2019-12-07 16:45:17,197 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:17,217 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:17,218 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:45:17,218 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:26 [2019-12-07 16:45:17,370 INFO L377 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 23 treesize of output 22 [2019-12-07 16:45:17,370 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:17,378 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:17,378 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:45:17,379 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:26 [2019-12-07 16:45:17,523 INFO L377 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 23 treesize of output 22 [2019-12-07 16:45:17,523 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:17,531 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:17,532 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:45:17,532 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:26 [2019-12-07 16:45:17,664 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 16:45:17,666 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:17,666 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2019-12-07 16:45:17,666 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:17,669 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:17,669 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:45:17,669 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:3 [2019-12-07 16:45:17,711 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 22 proven. 410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:45:17,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:45:17,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 40] total 88 [2019-12-07 16:45:17,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147143571] [2019-12-07 16:45:17,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-12-07 16:45:17,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:45:17,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-12-07 16:45:17,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=7402, Unknown=0, NotChecked=0, Total=7656 [2019-12-07 16:45:17,713 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 88 states. [2019-12-07 16:45:24,535 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-12-07 16:45:25,629 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-12-07 16:45:26,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:45:26,737 INFO L93 Difference]: Finished difference Result 154 states and 155 transitions. [2019-12-07 16:45:26,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-07 16:45:26,737 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 99 [2019-12-07 16:45:26,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:45:26,738 INFO L225 Difference]: With dead ends: 154 [2019-12-07 16:45:26,738 INFO L226 Difference]: Without dead ends: 107 [2019-12-07 16:45:26,739 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3110 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=500, Invalid=12382, Unknown=0, NotChecked=0, Total=12882 [2019-12-07 16:45:26,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-12-07 16:45:26,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2019-12-07 16:45:26,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-12-07 16:45:26,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2019-12-07 16:45:26,740 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 99 [2019-12-07 16:45:26,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:45:26,741 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2019-12-07 16:45:26,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-12-07 16:45:26,741 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2019-12-07 16:45:26,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-07 16:45:26,741 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:45:26,741 INFO L410 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:45:26,941 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:45:26,942 INFO L410 AbstractCegarLoop]: === Iteration 36 === [cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 16:45:26,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:45:26,942 INFO L82 PathProgramCache]: Analyzing trace with hash 921835989, now seen corresponding path program 16 times [2019-12-07 16:45:26,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:45:26,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530283825] [2019-12-07 16:45:26,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:45:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:45:27,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:45:27,422 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 192 proven. 281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:45:27,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530283825] [2019-12-07 16:45:27,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70176277] [2019-12-07 16:45:27,422 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_386360c7-50d5-4ed3-9db5-3f24e55aa46d/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-12-07 16:45:27,517 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 16:45:27,518 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 16:45:27,521 INFO L264 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 185 conjunts are in the unsatisfiable core [2019-12-07 16:45:27,523 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:45:27,526 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_23|], 1=[|v_#valid_38|]} [2019-12-07 16:45:27,528 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:45:27,528 INFO L377 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-12-07 16:45:27,529 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:27,535 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:27,537 INFO L377 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-12-07 16:45:27,538 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:27,543 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:27,544 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:45:27,544 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:16 [2019-12-07 16:45:27,929 INFO L377 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 16 treesize of output 12 [2019-12-07 16:45:27,929 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:27,935 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:27,935 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:45:27,935 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-12-07 16:45:28,146 INFO L377 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 23 treesize of output 22 [2019-12-07 16:45:28,146 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:28,153 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:28,153 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:45:28,153 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:27 [2019-12-07 16:45:28,246 INFO L377 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 23 treesize of output 22 [2019-12-07 16:45:28,246 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:28,253 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:28,254 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:45:28,254 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:27 [2019-12-07 16:45:28,350 INFO L377 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 23 treesize of output 22 [2019-12-07 16:45:28,350 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:28,357 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:28,358 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:45:28,358 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:27 [2019-12-07 16:45:28,460 INFO L377 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 23 treesize of output 22 [2019-12-07 16:45:28,461 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:28,468 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:28,468 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:45:28,468 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:27 [2019-12-07 16:45:28,578 INFO L377 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 23 treesize of output 22 [2019-12-07 16:45:28,578 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:28,586 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:28,586 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:45:28,586 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:27 [2019-12-07 16:45:28,788 INFO L377 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 23 treesize of output 22 [2019-12-07 16:45:28,788 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:28,816 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:28,817 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:45:28,817 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:27 [2019-12-07 16:45:29,197 INFO L377 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 23 treesize of output 22 [2019-12-07 16:45:29,198 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:29,223 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:29,224 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:45:29,224 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:27 [2019-12-07 16:45:29,642 INFO L377 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 23 treesize of output 22 [2019-12-07 16:45:29,643 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:29,670 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:29,671 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:45:29,671 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:27 [2019-12-07 16:45:29,922 INFO L377 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 23 treesize of output 22 [2019-12-07 16:45:29,922 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:29,930 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:29,930 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:45:29,930 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:27 [2019-12-07 16:45:30,061 INFO L377 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 23 treesize of output 22 [2019-12-07 16:45:30,062 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:30,069 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:30,069 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:45:30,070 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:38, output treesize:23 [2019-12-07 16:45:30,192 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:30,192 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2019-12-07 16:45:30,192 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 16:45:30,198 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:30,198 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:45:30,199 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2019-12-07 16:45:30,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:45:30,413 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 200 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:45:30,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:45:30,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 41] total 71 [2019-12-07 16:45:30,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265007038] [2019-12-07 16:45:30,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-12-07 16:45:30,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:45:30,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-12-07 16:45:30,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=4756, Unknown=0, NotChecked=0, Total=5112 [2019-12-07 16:45:30,415 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand 72 states. [2019-12-07 16:45:34,887 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-12-07 16:45:35,215 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-12-07 16:45:36,046 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-12-07 16:45:36,579 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2019-12-07 16:45:38,403 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-12-07 16:45:39,556 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-12-07 16:45:40,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:45:40,250 INFO L93 Difference]: Finished difference Result 110 states and 111 transitions. [2019-12-07 16:45:40,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-07 16:45:40,251 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 103 [2019-12-07 16:45:40,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:45:40,251 INFO L225 Difference]: With dead ends: 110 [2019-12-07 16:45:40,251 INFO L226 Difference]: Without dead ends: 110 [2019-12-07 16:45:40,252 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2358 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=689, Invalid=9817, Unknown=0, NotChecked=0, Total=10506 [2019-12-07 16:45:40,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-12-07 16:45:40,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2019-12-07 16:45:40,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-12-07 16:45:40,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2019-12-07 16:45:40,254 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 103 [2019-12-07 16:45:40,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:45:40,254 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2019-12-07 16:45:40,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-12-07 16:45:40,254 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2019-12-07 16:45:40,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-12-07 16:45:40,254 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:45:40,254 INFO L410 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:45:40,455 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:45:40,455 INFO L410 AbstractCegarLoop]: === Iteration 37 === [cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-07 16:45:40,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:45:40,456 INFO L82 PathProgramCache]: Analyzing trace with hash -639291602, now seen corresponding path program 17 times [2019-12-07 16:45:40,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:45:40,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7176247] [2019-12-07 16:45:40,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:45:40,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:45:43,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:45:43,090 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 24 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:45:43,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7176247] [2019-12-07 16:45:43,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164808421] [2019-12-07 16:45:43,090 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_386360c7-50d5-4ed3-9db5-3f24e55aa46d/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-12-07 16:45:44,271 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-12-07 16:45:44,272 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 16:45:44,278 INFO L264 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 221 conjunts are in the unsatisfiable core [2019-12-07 16:45:44,280 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:45:44,282 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_24|], 1=[|v_#valid_39|]} [2019-12-07 16:45:44,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:45:44,286 INFO L377 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-12-07 16:45:44,286 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:44,293 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:44,295 INFO L377 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-12-07 16:45:44,295 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:44,301 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:44,301 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:45:44,302 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:19 [2019-12-07 16:45:44,848 INFO L377 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-12-07 16:45:44,848 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:44,852 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:44,852 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:45:44,852 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-12-07 16:45:45,171 INFO L377 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 23 treesize of output 22 [2019-12-07 16:45:45,172 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:45,178 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:45,178 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:45:45,178 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:22 [2019-12-07 16:45:45,537 INFO L377 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 23 treesize of output 22 [2019-12-07 16:45:45,538 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:45,549 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:45,549 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:45:45,549 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:19 [2019-12-07 16:45:45,832 INFO L377 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 23 treesize of output 22 [2019-12-07 16:45:45,832 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:45,848 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:45,848 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:45:45,848 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2019-12-07 16:45:46,232 INFO L377 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 23 treesize of output 22 [2019-12-07 16:45:46,232 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:46,245 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:46,245 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:45:46,246 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2019-12-07 16:45:46,673 INFO L377 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 23 treesize of output 22 [2019-12-07 16:45:46,674 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:46,687 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:46,687 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:45:46,687 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2019-12-07 16:45:47,191 INFO L377 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 23 treesize of output 22 [2019-12-07 16:45:47,192 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:47,209 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:47,209 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:45:47,209 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2019-12-07 16:45:47,718 INFO L377 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 23 treesize of output 22 [2019-12-07 16:45:47,719 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:47,733 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:47,734 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:45:47,734 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2019-12-07 16:45:48,241 INFO L377 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 23 treesize of output 22 [2019-12-07 16:45:48,242 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:48,261 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:48,261 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:45:48,262 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2019-12-07 16:45:48,429 INFO L377 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 23 treesize of output 22 [2019-12-07 16:45:48,429 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:48,435 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:48,435 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:45:48,435 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2019-12-07 16:45:48,587 INFO L377 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 23 treesize of output 22 [2019-12-07 16:45:48,588 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:48,593 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:48,593 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:45:48,594 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2019-12-07 16:45:49,082 INFO L377 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 23 treesize of output 22 [2019-12-07 16:45:49,082 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:45:49,102 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:49,103 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:45:49,103 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2019-12-07 16:45:49,401 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:49,401 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2019-12-07 16:45:49,401 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 16:45:49,408 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:45:49,408 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:45:49,408 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2019-12-07 16:45:49,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:45:49,672 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 128 proven. 390 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 16:45:49,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:45:49,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 42] total 96 [2019-12-07 16:45:49,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113868546] [2019-12-07 16:45:49,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-12-07 16:45:49,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:45:49,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-12-07 16:45:49,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=345, Invalid=8775, Unknown=0, NotChecked=0, Total=9120 [2019-12-07 16:45:49,673 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand 96 states. [2019-12-07 16:45:54,398 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-12-07 16:46:06,266 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2019-12-07 16:46:07,057 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2019-12-07 16:46:08,163 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-12-07 16:46:09,020 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 37 [2019-12-07 16:46:09,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:46:09,653 INFO L93 Difference]: Finished difference Result 167 states and 168 transitions. [2019-12-07 16:46:09,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-12-07 16:46:09,654 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 107 [2019-12-07 16:46:09,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:46:09,654 INFO L225 Difference]: With dead ends: 167 [2019-12-07 16:46:09,655 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 16:46:09,656 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5276 ImplicationChecksByTransitivity, 19.9s TimeCoverageRelationStatistics Valid=1559, Invalid=24201, Unknown=0, NotChecked=0, Total=25760 [2019-12-07 16:46:09,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 16:46:09,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 16:46:09,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 16:46:09,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 16:46:09,657 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 107 [2019-12-07 16:46:09,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:46:09,657 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 16:46:09,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-12-07 16:46:09,657 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 16:46:09,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 16:46:09,858 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:46:09,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 04:46:09 BoogieIcfgContainer [2019-12-07 16:46:09,868 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 16:46:09,868 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 16:46:09,869 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 16:46:09,869 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 16:46:09,870 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:43:45" (3/4) ... [2019-12-07 16:46:09,875 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 16:46:09,879 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrncpy [2019-12-07 16:46:09,879 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-12-07 16:46:09,879 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-12-07 16:46:09,879 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-12-07 16:46:09,879 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-12-07 16:46:09,879 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-12-07 16:46:09,879 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-12-07 16:46:09,879 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-12-07 16:46:09,882 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2019-12-07 16:46:09,883 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-12-07 16:46:09,883 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 16:46:09,883 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 16:46:09,910 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_386360c7-50d5-4ed3-9db5-3f24e55aa46d/bin/uautomizer/witness.graphml [2019-12-07 16:46:09,911 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 16:46:09,911 INFO L168 Benchmark]: Toolchain (without parser) took 145381.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 940.8 MB in the beginning and 952.4 MB in the end (delta: -11.5 MB). Peak memory consumption was 141.0 MB. Max. memory is 11.5 GB. [2019-12-07 16:46:09,912 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 960.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:46:09,912 INFO L168 Benchmark]: CACSL2BoogieTranslator took 318.20 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -147.0 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. [2019-12-07 16:46:09,912 INFO L168 Benchmark]: Boogie Preprocessor took 39.04 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: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. [2019-12-07 16:46:09,912 INFO L168 Benchmark]: RCFGBuilder took 300.24 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: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 11.5 GB. [2019-12-07 16:46:09,913 INFO L168 Benchmark]: TraceAbstraction took 144678.46 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 49.8 MB). Free memory was 1.0 GB in the beginning and 954.7 MB in the end (delta: 75.5 MB). Peak memory consumption was 125.3 MB. Max. memory is 11.5 GB. [2019-12-07 16:46:09,913 INFO L168 Benchmark]: Witness Printer took 42.23 ms. Allocated memory is still 1.2 GB. Free memory was 954.7 MB in the beginning and 952.4 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 11.5 GB. [2019-12-07 16:46:09,914 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 960.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 318.20 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -147.0 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.04 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: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 300.24 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: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 144678.46 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 49.8 MB). Free memory was 1.0 GB in the beginning and 954.7 MB in the end (delta: 75.5 MB). Peak memory consumption was 125.3 MB. Max. memory is 11.5 GB. * Witness Printer took 42.23 ms. Allocated memory is still 1.2 GB. Free memory was 954.7 MB in the beginning and 952.4 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 522]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 526]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 522]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 522]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 522]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 526]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 532]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 11 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 58 locations, 11 error locations. Result: SAFE, OverallTime: 144.6s, OverallIterations: 37, TraceHistogramMax: 13, AutomataDifference: 95.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 929 SDtfs, 2559 SDslu, 8237 SDs, 0 SdLazy, 45413 SolverSat, 1275 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 39.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2410 GetRequests, 837 SyntacticMatches, 30 SemanticMatches, 1543 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25784 ImplicationChecksByTransitivity, 85.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 37 MinimizatonAttempts, 196 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 4.0s SatisfiabilityAnalysisTime, 38.9s InterpolantComputationTime, 2617 NumberOfCodeBlocks, 2593 NumberOfCodeBlocksAsserted, 118 NumberOfCheckSat, 2560 ConstructedInterpolants, 215 QuantifiedInterpolants, 2530985 SizeOfPredicates, 737 NumberOfNonLiveVariables, 6918 ConjunctsInSsa, 2244 ConjunctsInUnsatCore, 57 InterpolantComputations, 17 PerfectInterpolantSequences, 1243/6594 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...