./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/cstrcpy-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3e0f9a51-b03b-43a9-a29b-45f4ee4bbf43/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3e0f9a51-b03b-43a9-a29b-45f4ee4bbf43/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3e0f9a51-b03b-43a9-a29b-45f4ee4bbf43/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3e0f9a51-b03b-43a9-a29b-45f4ee4bbf43/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/cstrcpy-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3e0f9a51-b03b-43a9-a29b-45f4ee4bbf43/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3e0f9a51-b03b-43a9-a29b-45f4ee4bbf43/bin-2019/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 109b8bf9931c925f911ad0fbf9e2b946a30b466d ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 12:22:33,143 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 12:22:33,144 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 12:22:33,152 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 12:22:33,152 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 12:22:33,152 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 12:22:33,153 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 12:22:33,154 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 12:22:33,155 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 12:22:33,156 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 12:22:33,156 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 12:22:33,157 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 12:22:33,157 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 12:22:33,158 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 12:22:33,159 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 12:22:33,159 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 12:22:33,160 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 12:22:33,161 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 12:22:33,163 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 12:22:33,164 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 12:22:33,164 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 12:22:33,165 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 12:22:33,167 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 12:22:33,167 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 12:22:33,167 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 12:22:33,168 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 12:22:33,168 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 12:22:33,169 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 12:22:33,169 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 12:22:33,170 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 12:22:33,170 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 12:22:33,171 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 12:22:33,171 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 12:22:33,171 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 12:22:33,172 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 12:22:33,172 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 12:22:33,172 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3e0f9a51-b03b-43a9-a29b-45f4ee4bbf43/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-28 12:22:33,182 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 12:22:33,183 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 12:22:33,183 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 12:22:33,183 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 12:22:33,184 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 12:22:33,184 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 12:22:33,184 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 12:22:33,184 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 12:22:33,185 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 12:22:33,185 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 12:22:33,185 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 12:22:33,185 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 12:22:33,185 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 12:22:33,185 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 12:22:33,185 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 12:22:33,186 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-28 12:22:33,186 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 12:22:33,186 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 12:22:33,186 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 12:22:33,186 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 12:22:33,186 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 12:22:33,187 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 12:22:33,187 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 12:22:33,187 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 12:22:33,187 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 12:22:33,187 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 12:22:33,187 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 12:22:33,187 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 12:22:33,187 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in 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/working_dir_3e0f9a51-b03b-43a9-a29b-45f4ee4bbf43/bin-2019/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 -> 109b8bf9931c925f911ad0fbf9e2b946a30b466d [2018-11-28 12:22:33,209 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 12:22:33,218 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 12:22:33,221 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 12:22:33,222 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 12:22:33,222 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 12:22:33,223 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3e0f9a51-b03b-43a9-a29b-45f4ee4bbf43/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-11-28 12:22:33,257 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3e0f9a51-b03b-43a9-a29b-45f4ee4bbf43/bin-2019/uautomizer/data/9d5741fd7/d337fd6fa63643d1aafc51fc4636a383/FLAG3b8f79c85 [2018-11-28 12:22:33,693 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 12:22:33,693 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3e0f9a51-b03b-43a9-a29b-45f4ee4bbf43/sv-benchmarks/c/array-memsafety/cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-11-28 12:22:33,701 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3e0f9a51-b03b-43a9-a29b-45f4ee4bbf43/bin-2019/uautomizer/data/9d5741fd7/d337fd6fa63643d1aafc51fc4636a383/FLAG3b8f79c85 [2018-11-28 12:22:33,710 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3e0f9a51-b03b-43a9-a29b-45f4ee4bbf43/bin-2019/uautomizer/data/9d5741fd7/d337fd6fa63643d1aafc51fc4636a383 [2018-11-28 12:22:33,712 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 12:22:33,713 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 12:22:33,714 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 12:22:33,714 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 12:22:33,716 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 12:22:33,716 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:22:33" (1/1) ... [2018-11-28 12:22:33,718 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d5f719e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:33, skipping insertion in model container [2018-11-28 12:22:33,718 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:22:33" (1/1) ... [2018-11-28 12:22:33,722 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 12:22:33,745 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 12:22:33,924 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:22:33,932 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 12:22:34,001 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:22:34,023 INFO L195 MainTranslator]: Completed translation [2018-11-28 12:22:34,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:34 WrapperNode [2018-11-28 12:22:34,024 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 12:22:34,024 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 12:22:34,024 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 12:22:34,024 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 12:22:34,032 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:34" (1/1) ... [2018-11-28 12:22:34,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:34" (1/1) ... [2018-11-28 12:22:34,042 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:34" (1/1) ... [2018-11-28 12:22:34,043 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:34" (1/1) ... [2018-11-28 12:22:34,051 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:34" (1/1) ... [2018-11-28 12:22:34,055 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:34" (1/1) ... [2018-11-28 12:22:34,057 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:34" (1/1) ... [2018-11-28 12:22:34,060 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 12:22:34,061 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 12:22:34,061 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 12:22:34,061 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 12:22:34,061 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e0f9a51-b03b-43a9-a29b-45f4ee4bbf43/bin-2019/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 [2018-11-28 12:22:34,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 12:22:34,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 12:22:34,094 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-28 12:22:34,094 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-28 12:22:34,094 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrcpy [2018-11-28 12:22:34,094 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 12:22:34,094 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-28 12:22:34,094 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-28 12:22:34,094 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-28 12:22:34,094 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-28 12:22:34,094 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-28 12:22:34,095 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-28 12:22:34,095 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-28 12:22:34,095 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-28 12:22:34,095 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-28 12:22:34,095 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-28 12:22:34,095 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-28 12:22:34,095 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-28 12:22:34,096 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-28 12:22:34,096 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-28 12:22:34,096 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-28 12:22:34,096 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-28 12:22:34,096 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-28 12:22:34,096 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-28 12:22:34,096 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-28 12:22:34,096 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-28 12:22:34,096 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-28 12:22:34,096 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-28 12:22:34,096 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-28 12:22:34,097 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-28 12:22:34,097 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-28 12:22:34,097 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-28 12:22:34,097 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-28 12:22:34,097 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-28 12:22:34,097 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-28 12:22:34,097 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-28 12:22:34,097 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-28 12:22:34,097 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-28 12:22:34,097 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-28 12:22:34,098 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-28 12:22:34,098 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-28 12:22:34,098 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-28 12:22:34,098 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-28 12:22:34,098 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-28 12:22:34,098 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-28 12:22:34,098 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-28 12:22:34,098 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-28 12:22:34,098 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-28 12:22:34,099 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-28 12:22:34,099 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-28 12:22:34,099 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-28 12:22:34,099 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-28 12:22:34,099 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-28 12:22:34,099 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-28 12:22:34,099 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-28 12:22:34,099 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-28 12:22:34,099 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-28 12:22:34,100 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-28 12:22:34,100 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-28 12:22:34,100 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-28 12:22:34,100 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-28 12:22:34,100 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-28 12:22:34,100 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-28 12:22:34,100 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-28 12:22:34,100 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-28 12:22:34,100 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-28 12:22:34,101 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-28 12:22:34,101 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-28 12:22:34,101 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-28 12:22:34,101 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-28 12:22:34,101 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-28 12:22:34,101 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-28 12:22:34,101 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-28 12:22:34,102 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-28 12:22:34,102 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-28 12:22:34,102 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-28 12:22:34,102 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-28 12:22:34,102 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-28 12:22:34,102 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-28 12:22:34,102 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-28 12:22:34,103 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-28 12:22:34,103 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-28 12:22:34,103 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-28 12:22:34,103 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-28 12:22:34,103 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-28 12:22:34,103 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-28 12:22:34,103 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-28 12:22:34,103 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-28 12:22:34,103 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-28 12:22:34,104 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-28 12:22:34,104 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-28 12:22:34,104 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-28 12:22:34,104 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-28 12:22:34,104 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-28 12:22:34,104 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-28 12:22:34,104 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-28 12:22:34,104 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-28 12:22:34,104 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-28 12:22:34,105 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-28 12:22:34,105 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-28 12:22:34,105 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-28 12:22:34,105 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-28 12:22:34,105 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-28 12:22:34,105 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-28 12:22:34,105 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-28 12:22:34,105 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-28 12:22:34,105 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-28 12:22:34,105 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-28 12:22:34,106 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-28 12:22:34,106 INFO L130 BoogieDeclarations]: Found specification of procedure cstrcpy [2018-11-28 12:22:34,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 12:22:34,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 12:22:34,106 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 12:22:34,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 12:22:34,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 12:22:34,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 12:22:34,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 12:22:34,360 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 12:22:34,360 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 12:22:34,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:22:34 BoogieIcfgContainer [2018-11-28 12:22:34,360 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 12:22:34,361 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 12:22:34,361 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 12:22:34,363 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 12:22:34,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:22:33" (1/3) ... [2018-11-28 12:22:34,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eaa0ce1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:22:34, skipping insertion in model container [2018-11-28 12:22:34,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:34" (2/3) ... [2018-11-28 12:22:34,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eaa0ce1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:22:34, skipping insertion in model container [2018-11-28 12:22:34,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:22:34" (3/3) ... [2018-11-28 12:22:34,366 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-11-28 12:22:34,371 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 12:22:34,376 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-11-28 12:22:34,384 INFO L257 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2018-11-28 12:22:34,399 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 12:22:34,399 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 12:22:34,400 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 12:22:34,400 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 12:22:34,400 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 12:22:34,400 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 12:22:34,400 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 12:22:34,400 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 12:22:34,400 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 12:22:34,408 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-28 12:22:34,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 12:22:34,414 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:22:34,414 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:22:34,416 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 12:22:34,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:22:34,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1727668302, now seen corresponding path program 1 times [2018-11-28 12:22:34,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:22:34,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:22:34,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:22:34,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:22:34,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:22:34,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:22:34,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:22:34,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:22:34,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:22:34,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:22:34,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:22:34,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:22:34,538 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 4 states. [2018-11-28 12:22:34,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:22:34,584 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-28 12:22:34,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:22:34,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-11-28 12:22:34,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:22:34,591 INFO L225 Difference]: With dead ends: 35 [2018-11-28 12:22:34,591 INFO L226 Difference]: Without dead ends: 31 [2018-11-28 12:22:34,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:22:34,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-28 12:22:34,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-11-28 12:22:34,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-28 12:22:34,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-11-28 12:22:34,616 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 10 [2018-11-28 12:22:34,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:22:34,616 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-11-28 12:22:34,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:22:34,616 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-28 12:22:34,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 12:22:34,616 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:22:34,616 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:22:34,617 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 12:22:34,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:22:34,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1727668328, now seen corresponding path program 1 times [2018-11-28 12:22:34,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:22:34,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:22:34,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:22:34,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:22:34,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:22:34,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:22:34,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:22:34,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:22:34,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 12:22:34,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:22:34,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:22:34,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:22:34,651 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 3 states. [2018-11-28 12:22:34,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:22:34,664 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-11-28 12:22:34,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:22:34,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-28 12:22:34,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:22:34,665 INFO L225 Difference]: With dead ends: 28 [2018-11-28 12:22:34,665 INFO L226 Difference]: Without dead ends: 28 [2018-11-28 12:22:34,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:22:34,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-28 12:22:34,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-28 12:22:34,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-28 12:22:34,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-11-28 12:22:34,669 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 10 [2018-11-28 12:22:34,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:22:34,669 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-28 12:22:34,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:22:34,669 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-28 12:22:34,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 12:22:34,669 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:22:34,669 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:22:34,670 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 12:22:34,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:22:34,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1727668329, now seen corresponding path program 1 times [2018-11-28 12:22:34,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:22:34,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:22:34,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:22:34,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:22:34,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:22:34,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:22:34,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:22:34,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:22:34,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:22:34,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:22:34,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:22:34,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:22:34,727 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 4 states. [2018-11-28 12:22:34,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:22:34,743 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-11-28 12:22:34,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:22:34,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-11-28 12:22:34,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:22:34,744 INFO L225 Difference]: With dead ends: 29 [2018-11-28 12:22:34,744 INFO L226 Difference]: Without dead ends: 29 [2018-11-28 12:22:34,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:22:34,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-28 12:22:34,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-11-28 12:22:34,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-28 12:22:34,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-11-28 12:22:34,748 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 10 [2018-11-28 12:22:34,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:22:34,748 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-11-28 12:22:34,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:22:34,748 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-28 12:22:34,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 12:22:34,749 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:22:34,749 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:22:34,749 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 12:22:34,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:22:34,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1727670224, now seen corresponding path program 1 times [2018-11-28 12:22:34,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:22:34,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:22:34,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:22:34,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:22:34,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:22:34,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:22:34,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:22:34,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:22:34,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 12:22:34,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:22:34,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:22:34,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:22:34,767 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 3 states. [2018-11-28 12:22:34,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:22:34,797 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2018-11-28 12:22:34,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:22:34,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-28 12:22:34,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:22:34,798 INFO L225 Difference]: With dead ends: 28 [2018-11-28 12:22:34,798 INFO L226 Difference]: Without dead ends: 27 [2018-11-28 12:22:34,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:22:34,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-28 12:22:34,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-11-28 12:22:34,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-28 12:22:34,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-28 12:22:34,800 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 10 [2018-11-28 12:22:34,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:22:34,801 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-28 12:22:34,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:22:34,801 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-28 12:22:34,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 12:22:34,801 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:22:34,801 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:22:34,801 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 12:22:34,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:22:34,802 INFO L82 PathProgramCache]: Analyzing trace with hash 581866994, now seen corresponding path program 1 times [2018-11-28 12:22:34,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:22:34,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:22:34,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:22:34,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:22:34,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:22:34,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:22:34,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:22:34,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:22:34,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:22:34,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:22:34,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:22:34,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:22:34,858 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 6 states. [2018-11-28 12:22:34,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:22:34,895 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-11-28 12:22:34,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:22:34,896 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-28 12:22:34,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:22:34,896 INFO L225 Difference]: With dead ends: 25 [2018-11-28 12:22:34,896 INFO L226 Difference]: Without dead ends: 25 [2018-11-28 12:22:34,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 12:22:34,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-28 12:22:34,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-28 12:22:34,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-28 12:22:34,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-11-28 12:22:34,898 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 14 [2018-11-28 12:22:34,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:22:34,899 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-11-28 12:22:34,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:22:34,899 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-28 12:22:34,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 12:22:34,899 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:22:34,899 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:22:34,899 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 12:22:34,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:22:34,899 INFO L82 PathProgramCache]: Analyzing trace with hash 581866995, now seen corresponding path program 1 times [2018-11-28 12:22:34,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:22:34,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:22:34,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:22:34,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:22:34,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:22:34,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:22:35,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:22:35,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:22:35,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 12:22:35,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 12:22:35,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 12:22:35,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-28 12:22:35,009 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 8 states. [2018-11-28 12:22:35,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:22:35,069 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-11-28 12:22:35,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 12:22:35,070 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-11-28 12:22:35,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:22:35,071 INFO L225 Difference]: With dead ends: 31 [2018-11-28 12:22:35,071 INFO L226 Difference]: Without dead ends: 31 [2018-11-28 12:22:35,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-28 12:22:35,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-28 12:22:35,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2018-11-28 12:22:35,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-28 12:22:35,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-11-28 12:22:35,074 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 14 [2018-11-28 12:22:35,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:22:35,074 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-11-28 12:22:35,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 12:22:35,075 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-28 12:22:35,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-28 12:22:35,075 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:22:35,075 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:22:35,075 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 12:22:35,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:22:35,076 INFO L82 PathProgramCache]: Analyzing trace with hash 858007609, now seen corresponding path program 1 times [2018-11-28 12:22:35,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:22:35,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:22:35,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:22:35,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:22:35,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:22:35,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:22:35,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:22:35,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:22:35,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 12:22:35,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 12:22:35,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 12:22:35,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:22:35,136 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 7 states. [2018-11-28 12:22:35,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:22:35,180 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2018-11-28 12:22:35,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:22:35,180 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-11-28 12:22:35,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:22:35,180 INFO L225 Difference]: With dead ends: 26 [2018-11-28 12:22:35,180 INFO L226 Difference]: Without dead ends: 26 [2018-11-28 12:22:35,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-28 12:22:35,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-28 12:22:35,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-28 12:22:35,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-28 12:22:35,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-28 12:22:35,182 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 15 [2018-11-28 12:22:35,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:22:35,182 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-28 12:22:35,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 12:22:35,183 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-28 12:22:35,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-28 12:22:35,183 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:22:35,183 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:22:35,183 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 12:22:35,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:22:35,184 INFO L82 PathProgramCache]: Analyzing trace with hash 858007610, now seen corresponding path program 1 times [2018-11-28 12:22:35,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:22:35,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:22:35,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:22:35,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:22:35,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:22:35,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:22:35,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:22:35,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:22:35,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 12:22:35,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 12:22:35,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 12:22:35,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:22:35,241 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 7 states. [2018-11-28 12:22:35,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:22:35,291 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-11-28 12:22:35,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 12:22:35,292 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-11-28 12:22:35,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:22:35,293 INFO L225 Difference]: With dead ends: 28 [2018-11-28 12:22:35,293 INFO L226 Difference]: Without dead ends: 28 [2018-11-28 12:22:35,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-28 12:22:35,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-28 12:22:35,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-11-28 12:22:35,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-28 12:22:35,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-11-28 12:22:35,296 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 15 [2018-11-28 12:22:35,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:22:35,296 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-11-28 12:22:35,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 12:22:35,297 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-28 12:22:35,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 12:22:35,297 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:22:35,297 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:22:35,297 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 12:22:35,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:22:35,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1554286971, now seen corresponding path program 1 times [2018-11-28 12:22:35,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:22:35,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:22:35,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:22:35,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:22:35,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:22:35,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:22:35,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:22:35,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:22:35,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 12:22:35,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 12:22:35,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 12:22:35,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-28 12:22:35,402 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 9 states. [2018-11-28 12:22:35,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:22:35,472 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-11-28 12:22:35,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 12:22:35,473 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-11-28 12:22:35,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:22:35,473 INFO L225 Difference]: With dead ends: 41 [2018-11-28 12:22:35,473 INFO L226 Difference]: Without dead ends: 41 [2018-11-28 12:22:35,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-11-28 12:22:35,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-28 12:22:35,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2018-11-28 12:22:35,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-28 12:22:35,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-11-28 12:22:35,476 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 18 [2018-11-28 12:22:35,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:22:35,476 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-11-28 12:22:35,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 12:22:35,477 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-11-28 12:22:35,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 12:22:35,477 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:22:35,477 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:22:35,477 INFO L423 AbstractCegarLoop]: === Iteration 10 === [cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 12:22:35,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:22:35,477 INFO L82 PathProgramCache]: Analyzing trace with hash -2039615747, now seen corresponding path program 1 times [2018-11-28 12:22:35,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:22:35,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:22:35,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:22:35,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:22:35,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:22:35,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:22:35,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:22:35,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:22:35,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 12:22:35,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 12:22:35,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 12:22:35,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-11-28 12:22:35,583 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 10 states. [2018-11-28 12:22:35,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:22:35,673 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2018-11-28 12:22:35,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 12:22:35,673 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-11-28 12:22:35,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:22:35,675 INFO L225 Difference]: With dead ends: 64 [2018-11-28 12:22:35,675 INFO L226 Difference]: Without dead ends: 64 [2018-11-28 12:22:35,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-11-28 12:22:35,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-28 12:22:35,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 39. [2018-11-28 12:22:35,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-28 12:22:35,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-11-28 12:22:35,679 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 18 [2018-11-28 12:22:35,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:22:35,679 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-11-28 12:22:35,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 12:22:35,679 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-11-28 12:22:35,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 12:22:35,680 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:22:35,680 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:22:35,680 INFO L423 AbstractCegarLoop]: === Iteration 11 === [cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 12:22:35,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:22:35,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1781450309, now seen corresponding path program 1 times [2018-11-28 12:22:35,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:22:35,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:22:35,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:22:35,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:22:35,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:22:35,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:22:35,835 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:22:35,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:22:35,835 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e0f9a51-b03b-43a9-a29b-45f4ee4bbf43/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:22:35,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:22:35,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:22:35,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:22:35,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-11-28 12:22:35,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-28 12:22:35,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:22:35,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:22:35,913 INFO L267 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. [2018-11-28 12:22:35,913 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-11-28 12:22:36,007 INFO L478 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 20 treesize of output 16 [2018-11-28 12:22:36,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-11-28 12:22:36,015 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 12:22:36,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:22:36,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:22:36,032 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-11-28 12:22:36,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:22:36,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:22:36,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2018-11-28 12:22:36,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-28 12:22:36,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-28 12:22:36,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-11-28 12:22:36,096 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 16 states. [2018-11-28 12:22:36,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:22:36,419 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2018-11-28 12:22:36,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 12:22:36,419 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-11-28 12:22:36,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:22:36,420 INFO L225 Difference]: With dead ends: 45 [2018-11-28 12:22:36,420 INFO L226 Difference]: Without dead ends: 45 [2018-11-28 12:22:36,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2018-11-28 12:22:36,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-28 12:22:36,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-11-28 12:22:36,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-28 12:22:36,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-11-28 12:22:36,424 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 18 [2018-11-28 12:22:36,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:22:36,424 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-11-28 12:22:36,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-28 12:22:36,425 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-28 12:22:36,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 12:22:36,425 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:22:36,425 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:22:36,426 INFO L423 AbstractCegarLoop]: === Iteration 12 === [cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 12:22:36,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:22:36,426 INFO L82 PathProgramCache]: Analyzing trace with hash 609615218, now seen corresponding path program 1 times [2018-11-28 12:22:36,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:22:36,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:22:36,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:22:36,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:22:36,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:22:36,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:22:36,544 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:22:36,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:22:36,545 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e0f9a51-b03b-43a9-a29b-45f4ee4bbf43/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:22:36,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:22:36,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:22:36,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:22:36,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-11-28 12:22:36,591 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:22:36,597 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-28 12:22:36,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-11-28 12:22:36,600 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:22:36,604 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:22:36,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:22:36,633 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:25, output treesize:15 [2018-11-28 12:22:36,782 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:22:36,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:22:36,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2018-11-28 12:22:36,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-28 12:22:36,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-28 12:22:36,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2018-11-28 12:22:36,804 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 19 states. [2018-11-28 12:22:37,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:22:37,194 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-11-28 12:22:37,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 12:22:37,194 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-11-28 12:22:37,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:22:37,195 INFO L225 Difference]: With dead ends: 46 [2018-11-28 12:22:37,195 INFO L226 Difference]: Without dead ends: 46 [2018-11-28 12:22:37,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2018-11-28 12:22:37,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-28 12:22:37,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2018-11-28 12:22:37,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-28 12:22:37,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-11-28 12:22:37,199 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 19 [2018-11-28 12:22:37,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:22:37,199 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-11-28 12:22:37,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-28 12:22:37,199 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-28 12:22:37,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 12:22:37,200 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:22:37,200 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:22:37,200 INFO L423 AbstractCegarLoop]: === Iteration 13 === [cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 12:22:37,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:22:37,200 INFO L82 PathProgramCache]: Analyzing trace with hash -322227997, now seen corresponding path program 1 times [2018-11-28 12:22:37,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:22:37,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:22:37,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:22:37,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:22:37,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:22:37,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:22:37,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:22:37,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:22:37,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:22:37,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:22:37,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:22:37,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:22:37,237 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 4 states. [2018-11-28 12:22:37,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:22:37,266 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-28 12:22:37,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:22:37,267 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-11-28 12:22:37,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:22:37,267 INFO L225 Difference]: With dead ends: 40 [2018-11-28 12:22:37,268 INFO L226 Difference]: Without dead ends: 23 [2018-11-28 12:22:37,268 INFO L631 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 [2018-11-28 12:22:37,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-28 12:22:37,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-28 12:22:37,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-28 12:22:37,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-11-28 12:22:37,270 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-11-28 12:22:37,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:22:37,270 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-11-28 12:22:37,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:22:37,270 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-28 12:22:37,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 12:22:37,270 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:22:37,271 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:22:37,271 INFO L423 AbstractCegarLoop]: === Iteration 14 === [cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 12:22:37,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:22:37,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1925187907, now seen corresponding path program 2 times [2018-11-28 12:22:37,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:22:37,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:22:37,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:22:37,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:22:37,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:22:37,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:22:37,499 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:22:37,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:22:37,499 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e0f9a51-b03b-43a9-a29b-45f4ee4bbf43/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:22:37,507 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 12:22:37,524 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 12:22:37,524 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 12:22:37,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:22:37,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-11-28 12:22:37,548 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:22:37,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:22:37,551 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-11-28 12:22:37,566 INFO L478 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 14 treesize of output 11 [2018-11-28 12:22:37,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-28 12:22:37,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:22:37,570 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:22:37,575 INFO L267 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. [2018-11-28 12:22:37,575 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-11-28 12:22:37,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2018-11-28 12:22:37,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 12:22:37,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:22:37,732 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:22:37,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-28 12:22:37,747 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:53, output treesize:49 [2018-11-28 12:22:37,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-11-28 12:22:37,887 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-11-28 12:22:37,887 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:22:37,895 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:22:37,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 35 [2018-11-28 12:22:37,900 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 12:22:37,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:22:37,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:22:37,923 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:65, output treesize:43 [2018-11-28 12:22:37,974 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:22:37,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:22:37,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 23 [2018-11-28 12:22:37,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-28 12:22:37,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-28 12:22:37,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=500, Unknown=0, NotChecked=0, Total=552 [2018-11-28 12:22:37,990 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 24 states. [2018-11-28 12:22:38,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:22:38,760 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-28 12:22:38,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 12:22:38,760 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 22 [2018-11-28 12:22:38,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:22:38,761 INFO L225 Difference]: With dead ends: 29 [2018-11-28 12:22:38,761 INFO L226 Difference]: Without dead ends: 29 [2018-11-28 12:22:38,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=126, Invalid=1064, Unknown=0, NotChecked=0, Total=1190 [2018-11-28 12:22:38,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-28 12:22:38,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-11-28 12:22:38,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-28 12:22:38,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-11-28 12:22:38,763 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 22 [2018-11-28 12:22:38,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:22:38,763 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-11-28 12:22:38,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-28 12:22:38,764 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-28 12:22:38,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 12:22:38,764 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:22:38,764 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:22:38,764 INFO L423 AbstractCegarLoop]: === Iteration 15 === [cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, cstrcpyErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-28 12:22:38,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:22:38,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1792289589, now seen corresponding path program 3 times [2018-11-28 12:22:38,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:22:38,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:22:38,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:22:38,765 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:22:38,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:22:38,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:22:38,927 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:22:38,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:22:38,927 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e0f9a51-b03b-43a9-a29b-45f4ee4bbf43/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:22:38,933 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 12:22:38,952 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-28 12:22:38,952 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 12:22:38,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:22:38,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-11-28 12:22:38,964 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:22:38,977 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-28 12:22:38,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-11-28 12:22:38,980 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:22:38,990 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:22:38,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:22:38,996 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2018-11-28 12:22:39,004 INFO L478 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 15 treesize of output 12 [2018-11-28 12:22:39,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-28 12:22:39,005 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:22:39,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:22:39,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:22:39,010 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-11-28 12:22:39,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-11-28 12:22:39,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 12:22:39,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:22:39,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:22:39,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:22:39,052 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-11-28 12:22:39,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-11-28 12:22:39,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 12:22:39,068 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:22:39,072 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:22:39,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:22:39,076 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2018-11-28 12:22:39,098 INFO L478 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 21 treesize of output 17 [2018-11-28 12:22:39,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-11-28 12:22:39,102 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 12:22:39,104 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:22:39,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:22:39,109 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-11-28 12:22:39,136 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:22:39,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:22:39,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 18 [2018-11-28 12:22:39,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-28 12:22:39,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-28 12:22:39,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2018-11-28 12:22:39,151 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 19 states. [2018-11-28 12:22:39,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:22:39,378 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-28 12:22:39,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 12:22:39,378 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 26 [2018-11-28 12:22:39,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:22:39,378 INFO L225 Difference]: With dead ends: 26 [2018-11-28 12:22:39,378 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 12:22:39,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 16 SyntacticMatches, 7 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2018-11-28 12:22:39,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 12:22:39,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 12:22:39,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 12:22:39,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 12:22:39,379 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2018-11-28 12:22:39,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:22:39,379 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:22:39,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-28 12:22:39,379 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 12:22:39,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 12:22:39,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:22:39 BoogieIcfgContainer [2018-11-28 12:22:39,382 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 12:22:39,383 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 12:22:39,383 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 12:22:39,383 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 12:22:39,383 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:22:34" (3/4) ... [2018-11-28 12:22:39,386 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 12:22:39,391 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrcpy [2018-11-28 12:22:39,391 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 12:22:39,391 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-11-28 12:22:39,392 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-11-28 12:22:39,392 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 12:22:39,395 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2018-11-28 12:22:39,395 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-28 12:22:39,395 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-28 12:22:39,424 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3e0f9a51-b03b-43a9-a29b-45f4ee4bbf43/bin-2019/uautomizer/witness.graphml [2018-11-28 12:22:39,424 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 12:22:39,425 INFO L168 Benchmark]: Toolchain (without parser) took 5712.24 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 314.0 MB). Free memory was 954.9 MB in the beginning and 963.8 MB in the end (delta: -8.9 MB). Peak memory consumption was 305.1 MB. Max. memory is 11.5 GB. [2018-11-28 12:22:39,425 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:22:39,426 INFO L168 Benchmark]: CACSL2BoogieTranslator took 310.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -182.4 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-11-28 12:22:39,426 INFO L168 Benchmark]: Boogie Preprocessor took 36.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-28 12:22:39,426 INFO L168 Benchmark]: RCFGBuilder took 299.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 11.5 GB. [2018-11-28 12:22:39,427 INFO L168 Benchmark]: TraceAbstraction took 5021.83 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 164.6 MB). Free memory was 1.1 GB in the beginning and 971.1 MB in the end (delta: 118.1 MB). Peak memory consumption was 282.7 MB. Max. memory is 11.5 GB. [2018-11-28 12:22:39,427 INFO L168 Benchmark]: Witness Printer took 41.41 ms. Allocated memory is still 1.3 GB. Free memory was 971.1 MB in the beginning and 963.8 MB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2018-11-28 12:22:39,429 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 310.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -182.4 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 299.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5021.83 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 164.6 MB). Free memory was 1.1 GB in the beginning and 971.1 MB in the end (delta: 118.1 MB). Peak memory consumption was 282.7 MB. Max. memory is 11.5 GB. * Witness Printer took 41.41 ms. Allocated memory is still 1.3 GB. Free memory was 971.1 MB in the beginning and 963.8 MB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 560]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 560]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 7 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 37 locations, 7 error locations. SAFE Result, 4.9s OverallTime, 15 OverallIterations, 4 TraceHistogramMax, 2.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 296 SDtfs, 282 SDslu, 1238 SDs, 0 SdLazy, 1151 SolverSat, 92 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 240 GetRequests, 66 SyntacticMatches, 7 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 48 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 325 NumberOfCodeBlocks, 325 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 306 ConstructedInterpolants, 13 QuantifiedInterpolants, 51634 SizeOfPredicates, 65 NumberOfNonLiveVariables, 626 ConjunctsInSsa, 192 ConjunctsInUnsatCore, 19 InterpolantComputations, 11 PerfectInterpolantSequences, 6/66 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...