./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/array-memsafety/cstrncpy-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0ed9222f 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/cstrncpy-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 a42c021ebd0de645918b065980a1f8d912cba85d ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 18:07:34,216 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 18:07:34,218 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 18:07:34,230 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 18:07:34,231 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 18:07:34,232 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 18:07:34,236 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 18:07:34,238 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 18:07:34,240 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 18:07:34,241 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 18:07:34,242 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 18:07:34,242 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 18:07:34,244 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 18:07:34,245 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 18:07:34,246 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 18:07:34,247 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 18:07:34,247 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 18:07:34,250 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 18:07:34,252 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 18:07:34,254 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 18:07:34,255 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 18:07:34,256 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 18:07:34,259 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 18:07:34,259 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 18:07:34,260 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 18:07:34,261 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 18:07:34,262 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 18:07:34,263 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 18:07:34,264 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 18:07:34,265 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 18:07:34,265 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 18:07:34,266 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 18:07:34,267 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 18:07:34,267 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 18:07:34,268 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 18:07:34,268 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 18:07:34,269 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-14 18:07:34,285 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 18:07:34,285 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 18:07:34,286 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 18:07:34,286 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 18:07:34,286 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 18:07:34,287 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 18:07:34,287 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 18:07:34,288 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 18:07:34,288 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 18:07:34,288 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 18:07:34,288 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 18:07:34,288 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-14 18:07:34,289 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-14 18:07:34,289 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-14 18:07:34,289 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 18:07:34,289 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 18:07:34,289 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 18:07:34,289 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 18:07:34,290 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 18:07:34,291 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 18:07:34,291 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 18:07:34,291 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 18:07:34,292 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 18:07:34,292 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 18:07:34,292 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 18:07:34,293 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 -> a42c021ebd0de645918b065980a1f8d912cba85d [2019-01-14 18:07:34,327 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 18:07:34,338 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 18:07:34,341 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 18:07:34,342 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 18:07:34,343 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 18:07:34,344 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/cstrncpy-alloca_true-valid-memsafety_true-termination.i [2019-01-14 18:07:34,397 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56c903975/00512a5c31d04edba22a78dbaaf2f7c3/FLAG62b322ab4 [2019-01-14 18:07:34,942 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 18:07:34,942 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/cstrncpy-alloca_true-valid-memsafety_true-termination.i [2019-01-14 18:07:34,962 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56c903975/00512a5c31d04edba22a78dbaaf2f7c3/FLAG62b322ab4 [2019-01-14 18:07:35,277 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56c903975/00512a5c31d04edba22a78dbaaf2f7c3 [2019-01-14 18:07:35,280 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 18:07:35,282 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-14 18:07:35,283 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 18:07:35,283 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 18:07:35,287 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 18:07:35,289 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 06:07:35" (1/1) ... [2019-01-14 18:07:35,291 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@201a032c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:07:35, skipping insertion in model container [2019-01-14 18:07:35,292 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 06:07:35" (1/1) ... [2019-01-14 18:07:35,300 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 18:07:35,339 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 18:07:35,748 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 18:07:35,760 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 18:07:35,894 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 18:07:35,949 INFO L195 MainTranslator]: Completed translation [2019-01-14 18:07:35,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:07:35 WrapperNode [2019-01-14 18:07:35,951 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 18:07:35,952 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 18:07:35,952 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 18:07:35,952 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 18:07:35,964 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:07:35" (1/1) ... [2019-01-14 18:07:35,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:07:35" (1/1) ... [2019-01-14 18:07:35,978 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:07:35" (1/1) ... [2019-01-14 18:07:35,978 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:07:35" (1/1) ... [2019-01-14 18:07:36,000 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:07:35" (1/1) ... [2019-01-14 18:07:36,005 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:07:35" (1/1) ... [2019-01-14 18:07:36,008 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:07:35" (1/1) ... [2019-01-14 18:07:36,017 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 18:07:36,018 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 18:07:36,018 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 18:07:36,018 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 18:07:36,019 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:07:35" (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 [2019-01-14 18:07:36,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-14 18:07:36,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 18:07:36,075 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-14 18:07:36,075 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-14 18:07:36,075 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrncpy [2019-01-14 18:07:36,076 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-14 18:07:36,076 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-14 18:07:36,076 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-14 18:07:36,076 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-14 18:07:36,076 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-14 18:07:36,076 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-14 18:07:36,076 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-14 18:07:36,077 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-14 18:07:36,077 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-14 18:07:36,077 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-14 18:07:36,077 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-14 18:07:36,077 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-14 18:07:36,077 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-14 18:07:36,078 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-14 18:07:36,079 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-14 18:07:36,079 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-14 18:07:36,080 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-14 18:07:36,080 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-14 18:07:36,080 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-14 18:07:36,080 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-14 18:07:36,081 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-14 18:07:36,081 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-14 18:07:36,081 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-14 18:07:36,081 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-14 18:07:36,081 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-14 18:07:36,081 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-14 18:07:36,081 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-14 18:07:36,081 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-14 18:07:36,082 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-14 18:07:36,082 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-14 18:07:36,082 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-14 18:07:36,082 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-14 18:07:36,082 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-14 18:07:36,082 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-14 18:07:36,082 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-14 18:07:36,082 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-14 18:07:36,083 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-14 18:07:36,085 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-14 18:07:36,085 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-14 18:07:36,085 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-14 18:07:36,085 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-14 18:07:36,085 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-14 18:07:36,085 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-14 18:07:36,086 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-14 18:07:36,086 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-14 18:07:36,087 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-14 18:07:36,087 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-14 18:07:36,087 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-14 18:07:36,087 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-14 18:07:36,087 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-14 18:07:36,087 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-14 18:07:36,087 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-14 18:07:36,087 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-14 18:07:36,088 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-14 18:07:36,089 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-14 18:07:36,089 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-14 18:07:36,089 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-14 18:07:36,089 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-14 18:07:36,089 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-14 18:07:36,089 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-14 18:07:36,089 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-14 18:07:36,090 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-14 18:07:36,090 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-14 18:07:36,090 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-14 18:07:36,090 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-14 18:07:36,090 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-14 18:07:36,090 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-14 18:07:36,090 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-14 18:07:36,091 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-14 18:07:36,092 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-14 18:07:36,092 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-14 18:07:36,092 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-14 18:07:36,093 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-14 18:07:36,093 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-14 18:07:36,093 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-14 18:07:36,093 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-14 18:07:36,093 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-14 18:07:36,093 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-14 18:07:36,093 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-14 18:07:36,094 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-14 18:07:36,094 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-14 18:07:36,095 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-14 18:07:36,095 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-14 18:07:36,095 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-14 18:07:36,095 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-14 18:07:36,095 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-14 18:07:36,096 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-14 18:07:36,096 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-14 18:07:36,096 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-14 18:07:36,097 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-14 18:07:36,097 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-14 18:07:36,097 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-14 18:07:36,097 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-14 18:07:36,097 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-14 18:07:36,097 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-14 18:07:36,097 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-14 18:07:36,098 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-14 18:07:36,099 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-14 18:07:36,099 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-14 18:07:36,099 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-14 18:07:36,099 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-14 18:07:36,099 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-14 18:07:36,099 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-14 18:07:36,100 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-14 18:07:36,100 INFO L130 BoogieDeclarations]: Found specification of procedure cstrncpy [2019-01-14 18:07:36,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 18:07:36,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 18:07:36,100 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-14 18:07:36,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 18:07:36,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 18:07:36,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-14 18:07:36,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 18:07:36,648 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 18:07:36,648 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-14 18:07:36,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 06:07:36 BoogieIcfgContainer [2019-01-14 18:07:36,650 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 18:07:36,651 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 18:07:36,651 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 18:07:36,654 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 18:07:36,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 06:07:35" (1/3) ... [2019-01-14 18:07:36,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c321771 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 06:07:36, skipping insertion in model container [2019-01-14 18:07:36,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 06:07:35" (2/3) ... [2019-01-14 18:07:36,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c321771 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 06:07:36, skipping insertion in model container [2019-01-14 18:07:36,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 06:07:36" (3/3) ... [2019-01-14 18:07:36,657 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrncpy-alloca_true-valid-memsafety_true-termination.i [2019-01-14 18:07:36,667 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 18:07:36,676 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2019-01-14 18:07:36,693 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2019-01-14 18:07:36,720 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 18:07:36,721 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 18:07:36,721 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-14 18:07:36,721 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 18:07:36,721 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 18:07:36,721 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 18:07:36,722 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 18:07:36,722 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 18:07:36,722 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 18:07:36,738 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2019-01-14 18:07:36,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 18:07:36,759 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:36,760 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:36,762 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-14 18:07:36,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:36,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1056841845, now seen corresponding path program 1 times [2019-01-14 18:07:36,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:36,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:36,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:36,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:36,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:36,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:36,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:36,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:07:36,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 18:07:36,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 18:07:36,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 18:07:36,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 18:07:36,975 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 3 states. [2019-01-14 18:07:37,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:37,101 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2019-01-14 18:07:37,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 18:07:37,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-14 18:07:37,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:37,113 INFO L225 Difference]: With dead ends: 36 [2019-01-14 18:07:37,113 INFO L226 Difference]: Without dead ends: 33 [2019-01-14 18:07:37,115 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 [2019-01-14 18:07:37,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-14 18:07:37,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-01-14 18:07:37,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-14 18:07:37,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-01-14 18:07:37,149 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 10 [2019-01-14 18:07:37,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:37,150 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-01-14 18:07:37,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 18:07:37,150 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-01-14 18:07:37,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 18:07:37,151 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:37,151 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:37,151 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-14 18:07:37,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:37,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1056841844, now seen corresponding path program 1 times [2019-01-14 18:07:37,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:37,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:37,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:37,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:37,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:37,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:37,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:37,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:07:37,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 18:07:37,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 18:07:37,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 18:07:37,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 18:07:37,364 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 4 states. [2019-01-14 18:07:37,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:37,392 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2019-01-14 18:07:37,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 18:07:37,393 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-14 18:07:37,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:37,394 INFO L225 Difference]: With dead ends: 32 [2019-01-14 18:07:37,394 INFO L226 Difference]: Without dead ends: 32 [2019-01-14 18:07:37,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 18:07:37,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-14 18:07:37,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-01-14 18:07:37,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-14 18:07:37,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-01-14 18:07:37,400 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 10 [2019-01-14 18:07:37,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:37,400 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-01-14 18:07:37,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 18:07:37,401 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-01-14 18:07:37,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-14 18:07:37,401 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:37,402 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:37,402 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-14 18:07:37,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:37,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1498133944, now seen corresponding path program 1 times [2019-01-14 18:07:37,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:37,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:37,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:37,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:37,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:37,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:37,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:37,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:07:37,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 18:07:37,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 18:07:37,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 18:07:37,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-14 18:07:37,689 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 8 states. [2019-01-14 18:07:38,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:38,314 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2019-01-14 18:07:38,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 18:07:38,315 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-01-14 18:07:38,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:38,319 INFO L225 Difference]: With dead ends: 42 [2019-01-14 18:07:38,319 INFO L226 Difference]: Without dead ends: 42 [2019-01-14 18:07:38,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-01-14 18:07:38,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-14 18:07:38,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2019-01-14 18:07:38,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-14 18:07:38,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2019-01-14 18:07:38,326 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 14 [2019-01-14 18:07:38,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:38,327 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2019-01-14 18:07:38,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 18:07:38,327 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2019-01-14 18:07:38,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-14 18:07:38,328 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:38,328 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:38,328 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-14 18:07:38,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:38,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1498133945, now seen corresponding path program 1 times [2019-01-14 18:07:38,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:38,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:38,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:38,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:38,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:38,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:38,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:38,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:07:38,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 18:07:38,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 18:07:38,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 18:07:38,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 18:07:38,480 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 6 states. [2019-01-14 18:07:38,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:38,628 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2019-01-14 18:07:38,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 18:07:38,629 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-01-14 18:07:38,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:38,630 INFO L225 Difference]: With dead ends: 33 [2019-01-14 18:07:38,630 INFO L226 Difference]: Without dead ends: 33 [2019-01-14 18:07:38,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-14 18:07:38,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-14 18:07:38,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-01-14 18:07:38,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-14 18:07:38,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2019-01-14 18:07:38,636 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 14 [2019-01-14 18:07:38,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:38,636 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2019-01-14 18:07:38,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 18:07:38,637 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2019-01-14 18:07:38,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 18:07:38,637 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:38,637 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:38,638 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-14 18:07:38,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:38,638 INFO L82 PathProgramCache]: Analyzing trace with hash 802487948, now seen corresponding path program 1 times [2019-01-14 18:07:38,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:38,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:38,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:38,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:38,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:38,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:38,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:38,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:07:38,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 18:07:38,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 18:07:38,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 18:07:38,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-14 18:07:38,878 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 7 states. [2019-01-14 18:07:39,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:39,004 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2019-01-14 18:07:39,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 18:07:39,006 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-01-14 18:07:39,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:39,007 INFO L225 Difference]: With dead ends: 32 [2019-01-14 18:07:39,007 INFO L226 Difference]: Without dead ends: 32 [2019-01-14 18:07:39,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-01-14 18:07:39,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-14 18:07:39,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-01-14 18:07:39,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-14 18:07:39,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2019-01-14 18:07:39,012 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 15 [2019-01-14 18:07:39,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:39,012 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-01-14 18:07:39,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 18:07:39,012 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2019-01-14 18:07:39,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 18:07:39,013 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:39,013 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:39,013 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-14 18:07:39,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:39,014 INFO L82 PathProgramCache]: Analyzing trace with hash 802487949, now seen corresponding path program 1 times [2019-01-14 18:07:39,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:39,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:39,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:39,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:39,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:39,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:39,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:39,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:07:39,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 18:07:39,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 18:07:39,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 18:07:39,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-14 18:07:39,169 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 7 states. [2019-01-14 18:07:39,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:39,288 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2019-01-14 18:07:39,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 18:07:39,289 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-01-14 18:07:39,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:39,291 INFO L225 Difference]: With dead ends: 37 [2019-01-14 18:07:39,291 INFO L226 Difference]: Without dead ends: 37 [2019-01-14 18:07:39,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-01-14 18:07:39,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-14 18:07:39,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2019-01-14 18:07:39,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-14 18:07:39,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2019-01-14 18:07:39,296 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 15 [2019-01-14 18:07:39,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:39,296 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2019-01-14 18:07:39,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 18:07:39,297 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2019-01-14 18:07:39,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-14 18:07:39,297 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:39,298 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:39,298 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-14 18:07:39,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:39,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1102767525, now seen corresponding path program 1 times [2019-01-14 18:07:39,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:39,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:39,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:39,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:39,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:39,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:39,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:39,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:07:39,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 18:07:39,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 18:07:39,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 18:07:39,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 18:07:39,392 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 5 states. [2019-01-14 18:07:39,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:39,467 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2019-01-14 18:07:39,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 18:07:39,468 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-01-14 18:07:39,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:39,469 INFO L225 Difference]: With dead ends: 36 [2019-01-14 18:07:39,469 INFO L226 Difference]: Without dead ends: 33 [2019-01-14 18:07:39,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 18:07:39,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-14 18:07:39,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-01-14 18:07:39,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-14 18:07:39,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-01-14 18:07:39,475 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 18 [2019-01-14 18:07:39,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:39,475 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-01-14 18:07:39,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 18:07:39,475 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-01-14 18:07:39,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-14 18:07:39,476 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:39,476 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:39,476 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-14 18:07:39,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:39,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1130499361, now seen corresponding path program 1 times [2019-01-14 18:07:39,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:39,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:39,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:39,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:39,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:39,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:39,568 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:39,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:07:39,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 18:07:39,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 18:07:39,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 18:07:39,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 18:07:39,570 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 6 states. [2019-01-14 18:07:39,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:39,689 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2019-01-14 18:07:39,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 18:07:39,690 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-01-14 18:07:39,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:39,692 INFO L225 Difference]: With dead ends: 57 [2019-01-14 18:07:39,692 INFO L226 Difference]: Without dead ends: 57 [2019-01-14 18:07:39,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-14 18:07:39,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-14 18:07:39,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 49. [2019-01-14 18:07:39,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-14 18:07:39,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2019-01-14 18:07:39,699 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 18 [2019-01-14 18:07:39,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:39,699 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2019-01-14 18:07:39,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 18:07:39,699 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2019-01-14 18:07:39,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-14 18:07:39,700 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:39,700 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:39,700 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-14 18:07:39,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:39,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1831563939, now seen corresponding path program 1 times [2019-01-14 18:07:39,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:39,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:39,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:39,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:39,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:39,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:39,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:39,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:07:39,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-14 18:07:39,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 18:07:39,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 18:07:39,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-01-14 18:07:39,988 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 9 states. [2019-01-14 18:07:40,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:40,163 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions. [2019-01-14 18:07:40,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 18:07:40,165 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-01-14 18:07:40,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:40,166 INFO L225 Difference]: With dead ends: 85 [2019-01-14 18:07:40,166 INFO L226 Difference]: Without dead ends: 85 [2019-01-14 18:07:40,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-01-14 18:07:40,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-14 18:07:40,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 65. [2019-01-14 18:07:40,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-14 18:07:40,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2019-01-14 18:07:40,174 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 18 [2019-01-14 18:07:40,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:40,175 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2019-01-14 18:07:40,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 18:07:40,175 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2019-01-14 18:07:40,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-14 18:07:40,176 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:40,176 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:40,176 INFO L423 AbstractCegarLoop]: === Iteration 10 === [cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-14 18:07:40,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:40,177 INFO L82 PathProgramCache]: Analyzing trace with hash 2089729377, now seen corresponding path program 1 times [2019-01-14 18:07:40,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:40,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:40,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:40,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:40,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:40,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:40,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:40,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:07:40,502 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 [2019-01-14 18:07:40,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:40,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:40,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:07:40,625 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 [2019-01-14 18:07:40,630 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 [2019-01-14 18:07:40,631 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:07:40,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:07:40,651 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. [2019-01-14 18:07:40,652 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-01-14 18:07:40,950 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 [2019-01-14 18:07:40,966 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 [2019-01-14 18:07:40,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 18:07:40,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:07:41,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:07:41,031 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2019-01-14 18:07:41,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:41,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:07:41,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2019-01-14 18:07:41,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-14 18:07:41,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-14 18:07:41,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-01-14 18:07:41,120 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand 16 states. [2019-01-14 18:07:42,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:42,287 INFO L93 Difference]: Finished difference Result 77 states and 92 transitions. [2019-01-14 18:07:42,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 18:07:42,287 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2019-01-14 18:07:42,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:42,290 INFO L225 Difference]: With dead ends: 77 [2019-01-14 18:07:42,290 INFO L226 Difference]: Without dead ends: 77 [2019-01-14 18:07:42,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2019-01-14 18:07:42,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-14 18:07:42,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 68. [2019-01-14 18:07:42,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-14 18:07:42,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2019-01-14 18:07:42,298 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 82 transitions. Word has length 18 [2019-01-14 18:07:42,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:42,299 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 82 transitions. [2019-01-14 18:07:42,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-14 18:07:42,299 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 82 transitions. [2019-01-14 18:07:42,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 18:07:42,300 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:42,300 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:42,300 INFO L423 AbstractCegarLoop]: === Iteration 11 === [cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-14 18:07:42,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:42,300 INFO L82 PathProgramCache]: Analyzing trace with hash 685189778, now seen corresponding path program 1 times [2019-01-14 18:07:42,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:42,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:42,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:42,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:42,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:42,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:42,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:42,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:07:42,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 18:07:42,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 18:07:42,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 18:07:42,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 18:07:42,366 INFO L87 Difference]: Start difference. First operand 68 states and 82 transitions. Second operand 6 states. [2019-01-14 18:07:42,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:42,521 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2019-01-14 18:07:42,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 18:07:42,523 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-01-14 18:07:42,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:42,524 INFO L225 Difference]: With dead ends: 73 [2019-01-14 18:07:42,524 INFO L226 Difference]: Without dead ends: 73 [2019-01-14 18:07:42,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-01-14 18:07:42,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-14 18:07:42,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2019-01-14 18:07:42,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-14 18:07:42,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2019-01-14 18:07:42,532 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 19 [2019-01-14 18:07:42,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:42,532 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2019-01-14 18:07:42,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 18:07:42,533 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2019-01-14 18:07:42,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 18:07:42,533 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:42,534 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:42,534 INFO L423 AbstractCegarLoop]: === Iteration 12 === [cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-14 18:07:42,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:42,534 INFO L82 PathProgramCache]: Analyzing trace with hash 685189779, now seen corresponding path program 1 times [2019-01-14 18:07:42,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:42,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:42,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:42,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:42,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:42,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:42,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:42,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:07:42,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-14 18:07:42,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 18:07:42,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 18:07:42,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-14 18:07:42,920 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand 8 states. [2019-01-14 18:07:43,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:43,067 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2019-01-14 18:07:43,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 18:07:43,068 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-01-14 18:07:43,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:43,070 INFO L225 Difference]: With dead ends: 81 [2019-01-14 18:07:43,070 INFO L226 Difference]: Without dead ends: 81 [2019-01-14 18:07:43,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-01-14 18:07:43,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-14 18:07:43,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2019-01-14 18:07:43,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-14 18:07:43,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2019-01-14 18:07:43,078 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 19 [2019-01-14 18:07:43,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:43,079 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2019-01-14 18:07:43,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 18:07:43,079 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2019-01-14 18:07:43,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 18:07:43,080 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:43,080 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:43,080 INFO L423 AbstractCegarLoop]: === Iteration 13 === [cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-14 18:07:43,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:43,081 INFO L82 PathProgramCache]: Analyzing trace with hash 943355217, now seen corresponding path program 1 times [2019-01-14 18:07:43,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:43,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:43,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:43,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:43,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:43,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:43,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:43,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:07:43,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-14 18:07:43,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 18:07:43,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 18:07:43,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-01-14 18:07:43,644 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand 10 states. [2019-01-14 18:07:44,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:44,063 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2019-01-14 18:07:44,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 18:07:44,064 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-01-14 18:07:44,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:44,065 INFO L225 Difference]: With dead ends: 86 [2019-01-14 18:07:44,065 INFO L226 Difference]: Without dead ends: 86 [2019-01-14 18:07:44,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2019-01-14 18:07:44,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-14 18:07:44,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2019-01-14 18:07:44,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-14 18:07:44,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 96 transitions. [2019-01-14 18:07:44,072 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 96 transitions. Word has length 19 [2019-01-14 18:07:44,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:44,073 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 96 transitions. [2019-01-14 18:07:44,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 18:07:44,073 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2019-01-14 18:07:44,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 18:07:44,074 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:44,074 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:44,074 INFO L423 AbstractCegarLoop]: === Iteration 14 === [cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-14 18:07:44,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:44,075 INFO L82 PathProgramCache]: Analyzing trace with hash 357101204, now seen corresponding path program 1 times [2019-01-14 18:07:44,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:44,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:44,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:44,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:44,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:44,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:44,313 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:44,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:07:44,313 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 [2019-01-14 18:07:44,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:44,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:44,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:07:44,422 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 [2019-01-14 18:07:44,423 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:07:44,434 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 [2019-01-14 18:07:44,440 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 [2019-01-14 18:07:44,440 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 18:07:44,448 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:07:44,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:07:44,473 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2019-01-14 18:07:44,657 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:44,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:07:44,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2019-01-14 18:07:44,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-14 18:07:44,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-14 18:07:44,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-01-14 18:07:44,677 INFO L87 Difference]: Start difference. First operand 84 states and 96 transitions. Second operand 14 states. [2019-01-14 18:07:45,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:45,103 INFO L93 Difference]: Finished difference Result 96 states and 111 transitions. [2019-01-14 18:07:45,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 18:07:45,104 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 19 [2019-01-14 18:07:45,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:45,105 INFO L225 Difference]: With dead ends: 96 [2019-01-14 18:07:45,105 INFO L226 Difference]: Without dead ends: 96 [2019-01-14 18:07:45,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2019-01-14 18:07:45,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-01-14 18:07:45,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 83. [2019-01-14 18:07:45,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-14 18:07:45,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 95 transitions. [2019-01-14 18:07:45,112 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 95 transitions. Word has length 19 [2019-01-14 18:07:45,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:45,112 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 95 transitions. [2019-01-14 18:07:45,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-14 18:07:45,112 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 95 transitions. [2019-01-14 18:07:45,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-14 18:07:45,113 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:45,113 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:45,114 INFO L423 AbstractCegarLoop]: === Iteration 15 === [cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-14 18:07:45,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:45,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1020088252, now seen corresponding path program 1 times [2019-01-14 18:07:45,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:45,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:45,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:45,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:45,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:45,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:45,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 18:07:45,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 18:07:45,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 18:07:45,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 18:07:45,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 18:07:45,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 18:07:45,250 INFO L87 Difference]: Start difference. First operand 83 states and 95 transitions. Second operand 4 states. [2019-01-14 18:07:45,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:45,337 INFO L93 Difference]: Finished difference Result 82 states and 94 transitions. [2019-01-14 18:07:45,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 18:07:45,338 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-01-14 18:07:45,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:45,339 INFO L225 Difference]: With dead ends: 82 [2019-01-14 18:07:45,339 INFO L226 Difference]: Without dead ends: 47 [2019-01-14 18:07:45,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 18:07:45,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-14 18:07:45,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2019-01-14 18:07:45,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-14 18:07:45,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2019-01-14 18:07:45,345 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 22 [2019-01-14 18:07:45,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:45,346 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2019-01-14 18:07:45,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 18:07:45,346 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2019-01-14 18:07:45,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-14 18:07:45,347 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:45,347 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:45,347 INFO L423 AbstractCegarLoop]: === Iteration 16 === [cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-14 18:07:45,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:45,347 INFO L82 PathProgramCache]: Analyzing trace with hash -232043590, now seen corresponding path program 2 times [2019-01-14 18:07:45,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:45,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:45,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:45,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:45,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:45,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:45,864 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:45,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:07:45,865 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 [2019-01-14 18:07:45,875 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 18:07:45,907 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 18:07:45,907 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 18:07:45,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:07:45,937 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 [2019-01-14 18:07:45,937 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:07:45,950 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 [2019-01-14 18:07:45,960 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 [2019-01-14 18:07:45,960 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 18:07:45,972 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:07:46,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:07:46,001 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2019-01-14 18:07:46,043 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 [2019-01-14 18:07:46,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2019-01-14 18:07:46,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:07:46,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:07:46,059 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. [2019-01-14 18:07:46,059 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2019-01-14 18:07:46,287 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 [2019-01-14 18:07:46,296 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 [2019-01-14 18:07:46,297 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 18:07:46,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:07:46,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 18:07:46,333 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:22 [2019-01-14 18:07:46,416 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 22 treesize of output 18 [2019-01-14 18:07:46,428 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 18 treesize of output 15 [2019-01-14 18:07:46,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 18:07:46,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:07:46,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 18:07:46,464 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2019-01-14 18:07:46,531 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:46,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:07:46,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2019-01-14 18:07:46,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-14 18:07:46,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-14 18:07:46,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2019-01-14 18:07:46,551 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 22 states. [2019-01-14 18:07:47,618 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2019-01-14 18:07:48,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:48,107 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2019-01-14 18:07:48,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-14 18:07:48,108 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-01-14 18:07:48,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:48,109 INFO L225 Difference]: With dead ends: 49 [2019-01-14 18:07:48,109 INFO L226 Difference]: Without dead ends: 49 [2019-01-14 18:07:48,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=158, Invalid=1032, Unknown=0, NotChecked=0, Total=1190 [2019-01-14 18:07:48,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-14 18:07:48,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 33. [2019-01-14 18:07:48,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-14 18:07:48,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2019-01-14 18:07:48,112 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 22 [2019-01-14 18:07:48,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:48,113 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-01-14 18:07:48,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-14 18:07:48,113 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2019-01-14 18:07:48,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-14 18:07:48,113 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 18:07:48,114 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 18:07:48,114 INFO L423 AbstractCegarLoop]: === Iteration 17 === [cstrncpyErr2REQUIRES_VIOLATION, cstrncpyErr1REQUIRES_VIOLATION, cstrncpyErr0REQUIRES_VIOLATION, cstrncpyErr5REQUIRES_VIOLATION, cstrncpyErr4REQUIRES_VIOLATION, cstrncpyErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-01-14 18:07:48,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 18:07:48,114 INFO L82 PathProgramCache]: Analyzing trace with hash 6421641, now seen corresponding path program 1 times [2019-01-14 18:07:48,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 18:07:48,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 18:07:48,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:48,115 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 18:07:48,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 18:07:48,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:48,453 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:48,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 18:07:48,453 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 18:07:48,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 18:07:48,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 18:07:48,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 18:07:48,609 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-14 18:07:48,612 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 [2019-01-14 18:07:48,612 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 18:07:48,624 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 [2019-01-14 18:07:48,630 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 [2019-01-14 18:07:48,631 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 18:07:48,635 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:07:48,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 18:07:48,648 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2019-01-14 18:07:48,934 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 18:07:48,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 18:07:48,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2019-01-14 18:07:48,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-14 18:07:48,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-14 18:07:48,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=456, Unknown=0, NotChecked=0, Total=506 [2019-01-14 18:07:48,965 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 23 states. [2019-01-14 18:07:50,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 18:07:50,859 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2019-01-14 18:07:50,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-14 18:07:50,861 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-01-14 18:07:50,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 18:07:50,861 INFO L225 Difference]: With dead ends: 50 [2019-01-14 18:07:50,861 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 18:07:50,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=275, Invalid=1531, Unknown=0, NotChecked=0, Total=1806 [2019-01-14 18:07:50,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 18:07:50,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 18:07:50,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 18:07:50,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 18:07:50,864 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2019-01-14 18:07:50,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 18:07:50,864 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 18:07:50,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-14 18:07:50,864 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 18:07:50,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 18:07:50,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 06:07:50 BoogieIcfgContainer [2019-01-14 18:07:50,869 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 18:07:50,870 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 18:07:50,870 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 18:07:50,870 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 18:07:50,871 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 06:07:36" (3/4) ... [2019-01-14 18:07:50,875 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 18:07:50,881 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrncpy [2019-01-14 18:07:50,881 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-14 18:07:50,881 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-14 18:07:50,884 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-14 18:07:50,884 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-14 18:07:50,889 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2019-01-14 18:07:50,890 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-01-14 18:07:50,890 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-14 18:07:50,945 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 18:07:50,946 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 18:07:50,947 INFO L168 Benchmark]: Toolchain (without parser) took 15665.69 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 308.8 MB). Free memory was 952.7 MB in the beginning and 1.3 GB in the end (delta: -320.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 18:07:50,947 INFO L168 Benchmark]: CDTParser took 0.15 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. [2019-01-14 18:07:50,948 INFO L168 Benchmark]: CACSL2BoogieTranslator took 667.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -157.9 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. [2019-01-14 18:07:50,948 INFO L168 Benchmark]: Boogie Preprocessor took 66.11 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 18:07:50,949 INFO L168 Benchmark]: RCFGBuilder took 631.71 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: 45.4 MB). Peak memory consumption was 45.4 MB. Max. memory is 11.5 GB. [2019-01-14 18:07:50,949 INFO L168 Benchmark]: TraceAbstraction took 14219.01 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 178.3 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -222.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 18:07:50,950 INFO L168 Benchmark]: Witness Printer took 75.74 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 11.5 GB. [2019-01-14 18:07:50,955 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 667.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -157.9 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 66.11 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 631.71 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: 45.4 MB). Peak memory consumption was 45.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14219.01 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 178.3 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -222.8 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 75.74 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 558]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 43 locations, 9 error locations. SAFE Result, 14.1s OverallTime, 17 OverallIterations, 3 TraceHistogramMax, 7.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 429 SDtfs, 520 SDslu, 1802 SDs, 0 SdLazy, 1464 SolverSat, 163 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 267 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 8.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=13, 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.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 96 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 375 NumberOfCodeBlocks, 375 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 354 ConstructedInterpolants, 12 QuantifiedInterpolants, 48471 SizeOfPredicates, 57 NumberOfNonLiveVariables, 639 ConjunctsInSsa, 173 ConjunctsInUnsatCore, 21 InterpolantComputations, 13 PerfectInterpolantSequences, 5/37 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...