./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/array-memsafety/openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/array-memsafety/openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 834e1cdb1aa87972c4591e301e8fffc5992d43b8 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 22:43:55,226 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 22:43:55,228 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 22:43:55,240 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 22:43:55,241 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 22:43:55,242 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 22:43:55,243 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 22:43:55,246 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 22:43:55,248 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 22:43:55,249 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 22:43:55,250 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 22:43:55,250 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 22:43:55,251 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 22:43:55,252 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 22:43:55,254 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 22:43:55,255 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 22:43:55,255 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 22:43:55,258 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 22:43:55,260 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 22:43:55,262 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 22:43:55,263 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 22:43:55,264 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 22:43:55,267 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 22:43:55,267 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 22:43:55,268 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 22:43:55,269 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 22:43:55,270 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 22:43:55,271 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 22:43:55,272 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 22:43:55,274 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 22:43:55,275 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 22:43:55,275 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 22:43:55,276 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 22:43:55,276 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 22:43:55,279 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 22:43:55,280 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 22:43:55,280 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-28 22:43:55,311 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 22:43:55,311 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 22:43:55,312 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 22:43:55,312 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 22:43:55,313 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 22:43:55,313 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 22:43:55,313 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 22:43:55,314 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 22:43:55,314 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 22:43:55,314 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 22:43:55,314 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 22:43:55,314 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 22:43:55,316 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 22:43:55,316 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 22:43:55,316 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 22:43:55,316 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-28 22:43:55,316 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 22:43:55,317 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 22:43:55,317 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 22:43:55,317 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 22:43:55,317 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 22:43:55,317 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 22:43:55,317 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 22:43:55,319 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 22:43:55,319 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 22:43:55,319 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 22:43:55,319 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 22:43:55,320 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 22:43:55,320 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 834e1cdb1aa87972c4591e301e8fffc5992d43b8 [2018-11-28 22:43:55,373 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 22:43:55,398 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 22:43:55,405 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 22:43:55,407 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 22:43:55,407 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 22:43:55,408 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-11-28 22:43:55,480 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b58f38c2a/c153262e67cd480386a64d22d7f38162/FLAG4a20c716d [2018-11-28 22:43:56,032 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 22:43:56,033 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-11-28 22:43:56,046 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b58f38c2a/c153262e67cd480386a64d22d7f38162/FLAG4a20c716d [2018-11-28 22:43:56,333 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b58f38c2a/c153262e67cd480386a64d22d7f38162 [2018-11-28 22:43:56,339 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 22:43:56,340 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 22:43:56,341 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 22:43:56,342 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 22:43:56,346 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 22:43:56,347 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:43:56" (1/1) ... [2018-11-28 22:43:56,352 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3926fb05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:56, skipping insertion in model container [2018-11-28 22:43:56,352 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:43:56" (1/1) ... [2018-11-28 22:43:56,360 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 22:43:56,409 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 22:43:56,764 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 22:43:56,776 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 22:43:56,846 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 22:43:56,994 INFO L195 MainTranslator]: Completed translation [2018-11-28 22:43:56,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:56 WrapperNode [2018-11-28 22:43:56,996 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 22:43:56,997 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 22:43:56,997 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 22:43:56,997 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 22:43:57,010 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:56" (1/1) ... [2018-11-28 22:43:57,011 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:56" (1/1) ... [2018-11-28 22:43:57,026 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:56" (1/1) ... [2018-11-28 22:43:57,026 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:56" (1/1) ... [2018-11-28 22:43:57,047 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:56" (1/1) ... [2018-11-28 22:43:57,054 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:56" (1/1) ... [2018-11-28 22:43:57,060 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:56" (1/1) ... [2018-11-28 22:43:57,076 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 22:43:57,076 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 22:43:57,076 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 22:43:57,076 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 22:43:57,077 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 22:43:57,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 22:43:57,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 22:43:57,143 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-28 22:43:57,143 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-28 22:43:57,144 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrcpy [2018-11-28 22:43:57,144 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 22:43:57,144 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-28 22:43:57,144 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-28 22:43:57,144 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-28 22:43:57,144 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-28 22:43:57,145 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-28 22:43:57,145 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-28 22:43:57,145 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-28 22:43:57,145 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-28 22:43:57,145 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-28 22:43:57,145 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-28 22:43:57,147 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-28 22:43:57,148 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-28 22:43:57,148 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-28 22:43:57,148 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-28 22:43:57,148 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-28 22:43:57,148 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-28 22:43:57,148 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-28 22:43:57,149 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-28 22:43:57,149 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-28 22:43:57,149 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-28 22:43:57,149 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-28 22:43:57,149 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-28 22:43:57,149 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-28 22:43:57,149 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-28 22:43:57,150 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-28 22:43:57,151 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-28 22:43:57,151 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-28 22:43:57,152 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-28 22:43:57,152 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-28 22:43:57,152 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-28 22:43:57,152 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-28 22:43:57,152 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-28 22:43:57,152 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-28 22:43:57,152 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-28 22:43:57,152 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-28 22:43:57,154 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-28 22:43:57,154 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-28 22:43:57,154 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-28 22:43:57,154 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-28 22:43:57,154 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-28 22:43:57,154 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-28 22:43:57,154 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-28 22:43:57,154 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-28 22:43:57,155 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-28 22:43:57,156 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-28 22:43:57,156 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-28 22:43:57,156 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-28 22:43:57,156 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-28 22:43:57,156 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-28 22:43:57,156 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-28 22:43:57,156 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-28 22:43:57,157 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-28 22:43:57,157 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-28 22:43:57,157 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-28 22:43:57,157 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-28 22:43:57,157 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-28 22:43:57,157 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-28 22:43:57,157 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-28 22:43:57,157 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-28 22:43:57,159 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-28 22:43:57,159 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-28 22:43:57,160 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-28 22:43:57,160 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-28 22:43:57,160 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-28 22:43:57,160 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-28 22:43:57,160 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-28 22:43:57,160 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-28 22:43:57,160 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-28 22:43:57,160 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-28 22:43:57,161 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-28 22:43:57,162 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-28 22:43:57,162 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-28 22:43:57,162 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-28 22:43:57,162 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-28 22:43:57,162 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-28 22:43:57,162 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-28 22:43:57,163 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-28 22:43:57,163 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-28 22:43:57,164 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-28 22:43:57,164 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-28 22:43:57,164 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-28 22:43:57,164 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-28 22:43:57,164 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-28 22:43:57,164 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-28 22:43:57,164 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-28 22:43:57,164 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-28 22:43:57,166 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-28 22:43:57,166 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-28 22:43:57,166 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-28 22:43:57,166 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-28 22:43:57,166 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-28 22:43:57,166 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-28 22:43:57,166 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-28 22:43:57,167 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-28 22:43:57,167 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-28 22:43:57,168 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-28 22:43:57,168 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-28 22:43:57,168 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-28 22:43:57,168 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-28 22:43:57,168 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-28 22:43:57,168 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-28 22:43:57,168 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-28 22:43:57,168 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-28 22:43:57,170 INFO L130 BoogieDeclarations]: Found specification of procedure cstrcpy [2018-11-28 22:43:57,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 22:43:57,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 22:43:57,170 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 22:43:57,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 22:43:57,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 22:43:57,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 22:43:57,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 22:43:57,837 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 22:43:57,837 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 22:43:57,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:43:57 BoogieIcfgContainer [2018-11-28 22:43:57,838 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 22:43:57,839 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 22:43:57,839 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 22:43:57,842 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 22:43:57,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 10:43:56" (1/3) ... [2018-11-28 22:43:57,843 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55e46394 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:43:57, skipping insertion in model container [2018-11-28 22:43:57,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:56" (2/3) ... [2018-11-28 22:43:57,843 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55e46394 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:43:57, skipping insertion in model container [2018-11-28 22:43:57,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:43:57" (3/3) ... [2018-11-28 22:43:57,845 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-11-28 22:43:57,856 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 22:43:57,865 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-11-28 22:43:57,882 INFO L257 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2018-11-28 22:43:57,910 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 22:43:57,910 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 22:43:57,911 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 22:43:57,911 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 22:43:57,912 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 22:43:57,912 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 22:43:57,912 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 22:43:57,912 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 22:43:57,912 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 22:43:57,926 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-28 22:43:57,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 22:43:57,938 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:57,939 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:57,942 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-11-28 22:43:57,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:57,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1727668302, now seen corresponding path program 1 times [2018-11-28 22:43:57,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:57,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:58,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:58,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:58,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:58,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:58,138 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 22:43:58,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:58,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 22:43:58,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 22:43:58,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 22:43:58,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 22:43:58,159 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 4 states. [2018-11-28 22:43:58,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:58,269 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-28 22:43:58,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 22:43:58,271 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-11-28 22:43:58,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:58,279 INFO L225 Difference]: With dead ends: 35 [2018-11-28 22:43:58,280 INFO L226 Difference]: Without dead ends: 31 [2018-11-28 22:43:58,281 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 22:43:58,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-28 22:43:58,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-11-28 22:43:58,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-28 22:43:58,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-11-28 22:43:58,317 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 10 [2018-11-28 22:43:58,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:58,318 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-11-28 22:43:58,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 22:43:58,318 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-28 22:43:58,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 22:43:58,319 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:58,319 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:58,319 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-11-28 22:43:58,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:58,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1727668328, now seen corresponding path program 1 times [2018-11-28 22:43:58,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:58,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:58,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:58,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:58,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:58,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:58,411 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 22:43:58,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:58,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 22:43:58,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 22:43:58,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 22:43:58,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:43:58,415 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 3 states. [2018-11-28 22:43:58,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:58,453 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-11-28 22:43:58,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 22:43:58,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-28 22:43:58,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:58,456 INFO L225 Difference]: With dead ends: 28 [2018-11-28 22:43:58,456 INFO L226 Difference]: Without dead ends: 28 [2018-11-28 22:43:58,457 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 22:43:58,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-28 22:43:58,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-28 22:43:58,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-28 22:43:58,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-11-28 22:43:58,463 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 10 [2018-11-28 22:43:58,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:58,463 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-28 22:43:58,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 22:43:58,463 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-28 22:43:58,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 22:43:58,464 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:58,464 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:58,464 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-11-28 22:43:58,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:58,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1727668329, now seen corresponding path program 1 times [2018-11-28 22:43:58,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:58,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:58,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:58,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:58,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:58,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:58,584 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 22:43:58,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:58,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 22:43:58,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 22:43:58,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 22:43:58,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 22:43:58,586 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 4 states. [2018-11-28 22:43:58,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:58,633 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-11-28 22:43:58,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 22:43:58,636 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-11-28 22:43:58,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:58,637 INFO L225 Difference]: With dead ends: 29 [2018-11-28 22:43:58,637 INFO L226 Difference]: Without dead ends: 29 [2018-11-28 22:43:58,637 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 22:43:58,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-28 22:43:58,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-11-28 22:43:58,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-28 22:43:58,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-11-28 22:43:58,642 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 10 [2018-11-28 22:43:58,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:58,642 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-11-28 22:43:58,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 22:43:58,642 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-28 22:43:58,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 22:43:58,643 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:58,643 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:58,643 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-11-28 22:43:58,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:58,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1727670224, now seen corresponding path program 1 times [2018-11-28 22:43:58,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:58,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:58,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:58,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:58,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:58,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:58,710 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 22:43:58,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:58,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 22:43:58,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 22:43:58,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 22:43:58,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:43:58,712 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 3 states. [2018-11-28 22:43:58,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:58,873 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2018-11-28 22:43:58,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 22:43:58,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-28 22:43:58,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:58,874 INFO L225 Difference]: With dead ends: 28 [2018-11-28 22:43:58,875 INFO L226 Difference]: Without dead ends: 27 [2018-11-28 22:43:58,875 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 22:43:58,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-28 22:43:58,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-11-28 22:43:58,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-28 22:43:58,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-28 22:43:58,879 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 10 [2018-11-28 22:43:58,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:58,879 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-28 22:43:58,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 22:43:58,880 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-28 22:43:58,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-28 22:43:58,880 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:58,880 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:58,881 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-11-28 22:43:58,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:58,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1920892747, now seen corresponding path program 1 times [2018-11-28 22:43:58,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:58,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:58,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:58,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:58,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:58,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:58,986 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 22:43:58,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:58,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 22:43:58,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 22:43:58,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 22:43:58,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 22:43:58,987 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 5 states. [2018-11-28 22:43:59,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:59,085 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-11-28 22:43:59,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 22:43:59,085 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-28 22:43:59,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:59,086 INFO L225 Difference]: With dead ends: 25 [2018-11-28 22:43:59,086 INFO L226 Difference]: Without dead ends: 25 [2018-11-28 22:43:59,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 22:43:59,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-28 22:43:59,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-28 22:43:59,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-28 22:43:59,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-11-28 22:43:59,090 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 13 [2018-11-28 22:43:59,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:59,091 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-11-28 22:43:59,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 22:43:59,091 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-28 22:43:59,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-28 22:43:59,091 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:59,092 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:59,092 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-11-28 22:43:59,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:59,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1920892746, now seen corresponding path program 1 times [2018-11-28 22:43:59,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:59,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:59,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:59,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:59,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:59,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:59,330 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 22:43:59,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:59,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 22:43:59,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 22:43:59,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 22:43:59,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 22:43:59,333 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 7 states. [2018-11-28 22:43:59,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:59,659 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-28 22:43:59,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 22:43:59,659 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-11-28 22:43:59,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:59,663 INFO L225 Difference]: With dead ends: 34 [2018-11-28 22:43:59,663 INFO L226 Difference]: Without dead ends: 34 [2018-11-28 22:43:59,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-28 22:43:59,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-28 22:43:59,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 26. [2018-11-28 22:43:59,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-28 22:43:59,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-28 22:43:59,669 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 13 [2018-11-28 22:43:59,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:59,671 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-28 22:43:59,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 22:43:59,671 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-28 22:43:59,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 22:43:59,671 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:59,672 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:59,672 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-11-28 22:43:59,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:59,672 INFO L82 PathProgramCache]: Analyzing trace with hash 581866964, now seen corresponding path program 1 times [2018-11-28 22:43:59,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:59,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:59,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:59,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:59,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:59,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:59,797 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 22:43:59,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:59,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 22:43:59,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 22:43:59,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 22:43:59,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 22:43:59,799 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 6 states. [2018-11-28 22:43:59,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:59,873 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-11-28 22:43:59,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 22:43:59,874 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-28 22:43:59,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:59,875 INFO L225 Difference]: With dead ends: 25 [2018-11-28 22:43:59,876 INFO L226 Difference]: Without dead ends: 25 [2018-11-28 22:43:59,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-28 22:43:59,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-28 22:43:59,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-28 22:43:59,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-28 22:43:59,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-11-28 22:43:59,882 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 14 [2018-11-28 22:43:59,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:59,882 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-11-28 22:43:59,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 22:43:59,883 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-28 22:43:59,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 22:43:59,884 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:59,885 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:59,885 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-11-28 22:43:59,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:59,885 INFO L82 PathProgramCache]: Analyzing trace with hash 581866965, now seen corresponding path program 1 times [2018-11-28 22:43:59,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:59,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:59,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:59,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:59,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:59,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:00,040 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 22:44:00,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:00,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 22:44:00,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 22:44:00,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 22:44:00,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 22:44:00,042 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 6 states. [2018-11-28 22:44:00,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:00,187 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-11-28 22:44:00,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 22:44:00,188 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-28 22:44:00,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:00,190 INFO L225 Difference]: With dead ends: 31 [2018-11-28 22:44:00,190 INFO L226 Difference]: Without dead ends: 31 [2018-11-28 22:44:00,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-28 22:44:00,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-28 22:44:00,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2018-11-28 22:44:00,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-28 22:44:00,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-28 22:44:00,195 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 14 [2018-11-28 22:44:00,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:00,196 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-28 22:44:00,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 22:44:00,196 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-28 22:44:00,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-28 22:44:00,197 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:00,197 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:00,197 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-11-28 22:44:00,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:00,197 INFO L82 PathProgramCache]: Analyzing trace with hash -89297967, now seen corresponding path program 1 times [2018-11-28 22:44:00,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:00,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:00,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:00,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:00,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:00,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:00,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:00,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:00,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 22:44:00,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 22:44:00,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 22:44:00,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-28 22:44:00,564 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 8 states. [2018-11-28 22:44:00,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:00,693 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-11-28 22:44:00,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 22:44:00,694 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-11-28 22:44:00,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:00,695 INFO L225 Difference]: With dead ends: 39 [2018-11-28 22:44:00,695 INFO L226 Difference]: Without dead ends: 39 [2018-11-28 22:44:00,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-11-28 22:44:00,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-28 22:44:00,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-11-28 22:44:00,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-28 22:44:00,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-11-28 22:44:00,703 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 17 [2018-11-28 22:44:00,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:00,705 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-11-28 22:44:00,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 22:44:00,705 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-11-28 22:44:00,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-28 22:44:00,706 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:00,706 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:00,706 INFO L423 AbstractCegarLoop]: === Iteration 10 === [cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-11-28 22:44:00,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:00,706 INFO L82 PathProgramCache]: Analyzing trace with hash -482324977, now seen corresponding path program 1 times [2018-11-28 22:44:00,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:00,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:00,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:00,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:00,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:00,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:00,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:00,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:00,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 22:44:00,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 22:44:00,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 22:44:00,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-28 22:44:00,912 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 9 states. [2018-11-28 22:44:01,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:01,090 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-11-28 22:44:01,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 22:44:01,091 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-11-28 22:44:01,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:01,094 INFO L225 Difference]: With dead ends: 60 [2018-11-28 22:44:01,095 INFO L226 Difference]: Without dead ends: 60 [2018-11-28 22:44:01,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-11-28 22:44:01,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-28 22:44:01,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 37. [2018-11-28 22:44:01,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-28 22:44:01,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-11-28 22:44:01,102 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 17 [2018-11-28 22:44:01,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:01,102 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-11-28 22:44:01,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 22:44:01,102 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-11-28 22:44:01,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-28 22:44:01,103 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:01,103 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:01,103 INFO L423 AbstractCegarLoop]: === Iteration 11 === [cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-11-28 22:44:01,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:01,104 INFO L82 PathProgramCache]: Analyzing trace with hash 218739601, now seen corresponding path program 1 times [2018-11-28 22:44:01,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:01,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:01,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:01,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:01,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:01,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:01,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:01,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:44:01,399 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 22:44:01,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:01,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:01,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:44:01,530 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 22:44:01,537 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 22:44:01,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:01,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:01,558 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 22:44:01,558 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-11-28 22:44:01,827 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 18 treesize of output 14 [2018-11-28 22:44:01,842 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 14 treesize of output 11 [2018-11-28 22:44:01,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 22:44:01,850 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:44:01,870 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 22:44:01,871 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-11-28 22:44:02,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:02,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:44:02,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2018-11-28 22:44:02,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-28 22:44:02,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-28 22:44:02,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-11-28 22:44:02,059 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 15 states. [2018-11-28 22:44:02,755 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 23 [2018-11-28 22:44:02,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:02,982 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-11-28 22:44:02,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 22:44:02,983 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2018-11-28 22:44:02,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:02,984 INFO L225 Difference]: With dead ends: 50 [2018-11-28 22:44:02,984 INFO L226 Difference]: Without dead ends: 50 [2018-11-28 22:44:02,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2018-11-28 22:44:02,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-28 22:44:02,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 40. [2018-11-28 22:44:02,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-28 22:44:02,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-11-28 22:44:02,992 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 17 [2018-11-28 22:44:02,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:02,992 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-11-28 22:44:02,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-28 22:44:02,992 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-28 22:44:02,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 22:44:02,993 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:02,993 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 22:44:02,993 INFO L423 AbstractCegarLoop]: === Iteration 12 === [cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-11-28 22:44:02,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:02,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1809007014, now seen corresponding path program 1 times [2018-11-28 22:44:02,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:02,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:02,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:02,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:02,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:03,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:03,133 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 22:44:03,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:44:03,134 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 22:44:03,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:03,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:03,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:44:03,198 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 22:44:03,198 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:03,214 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 22:44:03,224 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 22:44:03,225 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:03,230 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:03,275 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 22:44:03,275 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:25, output treesize:15 [2018-11-28 22:44:03,601 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 22:44:03,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:44:03,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2018-11-28 22:44:03,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-28 22:44:03,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-28 22:44:03,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-11-28 22:44:03,632 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 15 states. [2018-11-28 22:44:04,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:04,651 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-11-28 22:44:04,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 22:44:04,652 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2018-11-28 22:44:04,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:04,653 INFO L225 Difference]: With dead ends: 48 [2018-11-28 22:44:04,654 INFO L226 Difference]: Without dead ends: 48 [2018-11-28 22:44:04,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2018-11-28 22:44:04,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-28 22:44:04,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 39. [2018-11-28 22:44:04,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-28 22:44:04,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-11-28 22:44:04,659 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 18 [2018-11-28 22:44:04,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:04,660 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-11-28 22:44:04,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-28 22:44:04,660 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-28 22:44:04,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 22:44:04,661 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:04,661 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] [2018-11-28 22:44:04,661 INFO L423 AbstractCegarLoop]: === Iteration 13 === [cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-11-28 22:44:04,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:04,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1744040704, now seen corresponding path program 1 times [2018-11-28 22:44:04,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:04,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:04,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:04,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:04,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:04,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:04,766 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 22:44:04,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:44:04,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 22:44:04,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 22:44:04,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 22:44:04,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 22:44:04,768 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 4 states. [2018-11-28 22:44:04,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:04,839 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2018-11-28 22:44:04,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 22:44:04,840 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-11-28 22:44:04,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:04,840 INFO L225 Difference]: With dead ends: 38 [2018-11-28 22:44:04,841 INFO L226 Difference]: Without dead ends: 22 [2018-11-28 22:44:04,841 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 22:44:04,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-28 22:44:04,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-28 22:44:04,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-28 22:44:04,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-11-28 22:44:04,844 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-11-28 22:44:04,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:04,846 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-11-28 22:44:04,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 22:44:04,846 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-28 22:44:04,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 22:44:04,846 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:44:04,847 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:44:04,847 INFO L423 AbstractCegarLoop]: === Iteration 14 === [cstrcpyErr0REQUIRES_VIOLATION, cstrcpyErr1REQUIRES_VIOLATION, cstrcpyErr2REQUIRES_VIOLATION, cstrcpyErr3REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-11-28 22:44:04,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:44:04,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1121630508, now seen corresponding path program 2 times [2018-11-28 22:44:04,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:44:04,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:44:04,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:04,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:44:04,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:44:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:44:05,167 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2018-11-28 22:44:05,459 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:05,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:44:05,459 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 22:44:05,469 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 22:44:05,516 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 22:44:05,516 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 22:44:05,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:44:05,652 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-28 22:44:05,667 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 22:44:05,667 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:05,767 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 22:44:05,804 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 22:44:05,804 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:05,899 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:05,930 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 22:44:05,930 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2018-11-28 22:44:06,000 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 16 treesize of output 13 [2018-11-28 22:44:06,003 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 13 treesize of output 12 [2018-11-28 22:44:06,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:06,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:06,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:06,015 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-11-28 22:44:06,118 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 24 treesize of output 25 [2018-11-28 22:44:06,121 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 22:44:06,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:44:06,136 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:44:06,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 22:44:06,152 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:26 [2018-11-28 22:44:06,193 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 22:44:06,231 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 22:44:06,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 22:44:06,238 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:44:06,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:44:06,255 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2018-11-28 22:44:06,313 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:44:06,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:44:06,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-11-28 22:44:06,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-28 22:44:06,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-28 22:44:06,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-11-28 22:44:06,334 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 16 states. [2018-11-28 22:44:07,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:44:07,038 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-28 22:44:07,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 22:44:07,040 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2018-11-28 22:44:07,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:44:07,040 INFO L225 Difference]: With dead ends: 24 [2018-11-28 22:44:07,040 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 22:44:07,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2018-11-28 22:44:07,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 22:44:07,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 22:44:07,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 22:44:07,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 22:44:07,043 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-11-28 22:44:07,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:44:07,043 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 22:44:07,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-28 22:44:07,043 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 22:44:07,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 22:44:07,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 10:44:07 BoogieIcfgContainer [2018-11-28 22:44:07,048 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 22:44:07,048 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 22:44:07,049 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 22:44:07,049 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 22:44:07,049 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:43:57" (3/4) ... [2018-11-28 22:44:07,053 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 22:44:07,060 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrcpy [2018-11-28 22:44:07,060 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 22:44:07,060 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-11-28 22:44:07,061 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-11-28 22:44:07,061 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 22:44:07,066 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-11-28 22:44:07,066 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-28 22:44:07,066 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-28 22:44:07,123 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 22:44:07,123 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 22:44:07,124 INFO L168 Benchmark]: Toolchain (without parser) took 10784.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 211.8 MB). Free memory was 951.3 MB in the beginning and 865.4 MB in the end (delta: 85.9 MB). Peak memory consumption was 297.8 MB. Max. memory is 11.5 GB. [2018-11-28 22:44:07,126 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 22:44:07,129 INFO L168 Benchmark]: CACSL2BoogieTranslator took 654.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -191.3 MB). Peak memory consumption was 37.1 MB. Max. memory is 11.5 GB. [2018-11-28 22:44:07,129 INFO L168 Benchmark]: Boogie Preprocessor took 78.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-11-28 22:44:07,133 INFO L168 Benchmark]: RCFGBuilder took 761.80 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: 38.6 MB). Peak memory consumption was 38.6 MB. Max. memory is 11.5 GB. [2018-11-28 22:44:07,135 INFO L168 Benchmark]: TraceAbstraction took 9209.46 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 63.4 MB). Free memory was 1.1 GB in the beginning and 872.9 MB in the end (delta: 224.5 MB). Peak memory consumption was 287.9 MB. Max. memory is 11.5 GB. [2018-11-28 22:44:07,137 INFO L168 Benchmark]: Witness Printer took 75.07 ms. Allocated memory is still 1.2 GB. Free memory was 872.9 MB in the beginning and 865.4 MB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 11.5 GB. [2018-11-28 22:44:07,143 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 654.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -191.3 MB). Peak memory consumption was 37.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 78.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 761.80 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: 38.6 MB). Peak memory consumption was 38.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9209.46 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 63.4 MB). Free memory was 1.1 GB in the beginning and 872.9 MB in the end (delta: 224.5 MB). Peak memory consumption was 287.9 MB. Max. memory is 11.5 GB. * Witness Printer took 75.07 ms. Allocated memory is still 1.2 GB. Free memory was 872.9 MB in the beginning and 865.4 MB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 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: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 559]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 559]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 7 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 37 locations, 7 error locations. SAFE Result, 9.1s OverallTime, 14 OverallIterations, 2 TraceHistogramMax, 4.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 291 SDtfs, 312 SDslu, 901 SDs, 0 SdLazy, 707 SolverSat, 88 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 171 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred 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, 14 MinimizatonAttempts, 63 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 260 NumberOfCodeBlocks, 260 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 243 ConstructedInterpolants, 10 QuantifiedInterpolants, 27939 SizeOfPredicates, 28 NumberOfNonLiveVariables, 344 ConjunctsInSsa, 89 ConjunctsInUnsatCore, 17 InterpolantComputations, 11 PerfectInterpolantSequences, 2/20 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...