./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/cstrchr_unsafe.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/array-memsafety/cstrchr_unsafe.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 efc45e5708d4a9b560055cd5abf7b168f9024833 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:03:58,244 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:03:58,247 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:03:58,266 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:03:58,267 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:03:58,269 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:03:58,271 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:03:58,281 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:03:58,287 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:03:58,291 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:03:58,294 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:03:58,296 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:03:58,296 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:03:58,299 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:03:58,300 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:03:58,302 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:03:58,304 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:03:58,306 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:03:58,308 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:03:58,312 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:03:58,317 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:03:58,322 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:03:58,324 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:03:58,325 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:03:58,330 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:03:58,330 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:03:58,330 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:03:58,332 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:03:58,333 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:03:58,334 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:03:58,334 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:03:58,335 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:03:58,336 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:03:58,337 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:03:58,339 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:03:58,339 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:03:58,340 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:03:58,341 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:03:58,341 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:03:58,342 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:03:58,344 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:03:58,345 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-28 20:03:58,381 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:03:58,383 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:03:58,386 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:03:58,386 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:03:58,388 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:03:58,388 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:03:58,388 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 20:03:58,389 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:03:58,390 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:03:58,390 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 20:03:58,390 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:03:58,391 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 20:03:58,391 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 20:03:58,391 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 20:03:58,391 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 20:03:58,392 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 20:03:58,392 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 20:03:58,392 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:03:58,393 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:03:58,393 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:03:58,393 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 20:03:58,393 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 20:03:58,394 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:03:58,394 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:03:58,394 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 20:03:58,395 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:03:58,395 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 20:03:58,395 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:03:58,396 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /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 -> efc45e5708d4a9b560055cd5abf7b168f9024833 [2019-11-28 20:03:58,751 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:03:58,765 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:03:58,768 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:03:58,770 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:03:58,770 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:03:58,771 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrchr_unsafe.i [2019-11-28 20:03:58,844 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25b41c1a8/8005aa7e934f4ede82100be063221688/FLAGd4386d37a [2019-11-28 20:03:59,351 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:03:59,352 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrchr_unsafe.i [2019-11-28 20:03:59,368 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25b41c1a8/8005aa7e934f4ede82100be063221688/FLAGd4386d37a [2019-11-28 20:03:59,650 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25b41c1a8/8005aa7e934f4ede82100be063221688 [2019-11-28 20:03:59,653 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:03:59,655 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 20:03:59,656 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:03:59,656 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:03:59,660 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:03:59,661 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:03:59" (1/1) ... [2019-11-28 20:03:59,664 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@275b90c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:03:59, skipping insertion in model container [2019-11-28 20:03:59,665 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:03:59" (1/1) ... [2019-11-28 20:03:59,673 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:03:59,709 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:04:00,226 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:04:00,236 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:04:00,278 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:04:00,331 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:04:00,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:04:00 WrapperNode [2019-11-28 20:04:00,332 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:04:00,333 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:04:00,333 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:04:00,333 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:04:00,347 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:04:00" (1/1) ... [2019-11-28 20:04:00,348 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:04:00" (1/1) ... [2019-11-28 20:04:00,364 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:04:00" (1/1) ... [2019-11-28 20:04:00,364 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:04:00" (1/1) ... [2019-11-28 20:04:00,380 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:04:00" (1/1) ... [2019-11-28 20:04:00,385 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:04:00" (1/1) ... [2019-11-28 20:04:00,389 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:04:00" (1/1) ... [2019-11-28 20:04:00,395 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:04:00,396 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:04:00,396 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:04:00,396 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:04:00,397 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:04:00" (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-11-28 20:04:00,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 20:04:00,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:04:00,451 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-28 20:04:00,451 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-28 20:04:00,451 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-28 20:04:00,452 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-28 20:04:00,452 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-28 20:04:00,452 INFO L138 BoogieDeclarations]: Found implementation of procedure build_nondet_String [2019-11-28 20:04:00,452 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrchr [2019-11-28 20:04:00,453 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 20:04:00,453 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-28 20:04:00,453 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-28 20:04:00,453 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-28 20:04:00,453 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-28 20:04:00,453 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-28 20:04:00,453 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-28 20:04:00,454 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-28 20:04:00,454 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-28 20:04:00,454 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-28 20:04:00,454 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-28 20:04:00,454 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-28 20:04:00,454 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-28 20:04:00,454 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-28 20:04:00,454 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-28 20:04:00,455 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-28 20:04:00,456 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-28 20:04:00,456 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-28 20:04:00,456 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-28 20:04:00,456 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-28 20:04:00,456 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-28 20:04:00,456 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-28 20:04:00,457 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-28 20:04:00,458 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-28 20:04:00,458 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-28 20:04:00,458 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-28 20:04:00,459 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-28 20:04:00,459 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-28 20:04:00,459 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-28 20:04:00,459 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-28 20:04:00,459 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-28 20:04:00,460 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-28 20:04:00,460 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-28 20:04:00,460 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-28 20:04:00,460 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-28 20:04:00,460 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-28 20:04:00,460 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-28 20:04:00,460 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-28 20:04:00,460 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-28 20:04:00,461 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-28 20:04:00,461 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-28 20:04:00,461 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-28 20:04:00,461 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-28 20:04:00,461 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-28 20:04:00,461 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-28 20:04:00,461 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-28 20:04:00,462 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-28 20:04:00,462 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-28 20:04:00,462 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-28 20:04:00,462 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-28 20:04:00,462 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-28 20:04:00,462 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-28 20:04:00,462 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-28 20:04:00,463 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-28 20:04:00,463 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-28 20:04:00,463 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-28 20:04:00,463 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-28 20:04:00,463 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-28 20:04:00,464 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-28 20:04:00,464 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-28 20:04:00,464 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-28 20:04:00,464 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-28 20:04:00,464 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-28 20:04:00,465 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-28 20:04:00,465 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-28 20:04:00,465 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-28 20:04:00,465 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-28 20:04:00,465 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-28 20:04:00,466 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-28 20:04:00,466 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-28 20:04:00,466 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-28 20:04:00,466 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-28 20:04:00,467 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-28 20:04:00,467 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-28 20:04:00,467 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-28 20:04:00,467 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-28 20:04:00,467 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-28 20:04:00,468 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-28 20:04:00,468 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-28 20:04:00,468 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-28 20:04:00,468 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-28 20:04:00,468 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-28 20:04:00,468 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-28 20:04:00,468 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-28 20:04:00,468 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-28 20:04:00,468 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-28 20:04:00,469 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-28 20:04:00,469 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-28 20:04:00,469 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-28 20:04:00,469 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-28 20:04:00,469 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-28 20:04:00,470 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-28 20:04:00,470 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-28 20:04:00,470 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-28 20:04:00,470 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-28 20:04:00,470 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-28 20:04:00,471 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-28 20:04:00,471 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-28 20:04:00,471 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-28 20:04:00,471 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-28 20:04:00,471 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-28 20:04:00,472 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-28 20:04:00,472 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-28 20:04:00,472 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-28 20:04:00,472 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-28 20:04:00,472 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-28 20:04:00,473 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-28 20:04:00,473 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-28 20:04:00,473 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-28 20:04:00,473 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-28 20:04:00,473 INFO L130 BoogieDeclarations]: Found specification of procedure build_nondet_String [2019-11-28 20:04:00,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 20:04:00,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 20:04:00,474 INFO L130 BoogieDeclarations]: Found specification of procedure cstrchr [2019-11-28 20:04:00,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 20:04:00,474 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 20:04:00,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 20:04:00,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 20:04:00,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:04:01,084 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:04:01,084 INFO L287 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-28 20:04:01,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:04:01 BoogieIcfgContainer [2019-11-28 20:04:01,086 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:04:01,087 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 20:04:01,088 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 20:04:01,091 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 20:04:01,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:03:59" (1/3) ... [2019-11-28 20:04:01,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e3a5d34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:04:01, skipping insertion in model container [2019-11-28 20:04:01,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:04:00" (2/3) ... [2019-11-28 20:04:01,093 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e3a5d34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:04:01, skipping insertion in model container [2019-11-28 20:04:01,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:04:01" (3/3) ... [2019-11-28 20:04:01,095 INFO L109 eAbstractionObserver]: Analyzing ICFG cstrchr_unsafe.i [2019-11-28 20:04:01,104 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 20:04:01,111 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-11-28 20:04:01,123 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-11-28 20:04:01,145 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 20:04:01,145 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 20:04:01,145 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 20:04:01,146 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:04:01,146 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:04:01,146 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 20:04:01,147 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:04:01,147 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 20:04:01,165 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2019-11-28 20:04:01,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 20:04:01,175 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:04:01,176 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:04:01,177 INFO L410 AbstractCegarLoop]: === Iteration 1 === [build_nondet_StringErr3REQUIRES_VIOLATION, build_nondet_StringErr2REQUIRES_VIOLATION, build_nondet_StringErr1REQUIRES_VIOLATION, build_nondet_StringErr0REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, cstrchrErr4REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:04:01,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:04:01,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1524183926, now seen corresponding path program 1 times [2019-11-28 20:04:01,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:04:01,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067441627] [2019-11-28 20:04:01,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:04:01,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:01,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:01,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:04:01,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067441627] [2019-11-28 20:04:01,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:04:01,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:04:01,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563485491] [2019-11-28 20:04:01,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:04:01,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:04:01,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:04:01,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:04:01,406 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 3 states. [2019-11-28 20:04:01,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:04:01,535 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2019-11-28 20:04:01,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:04:01,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-28 20:04:01,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:04:01,549 INFO L225 Difference]: With dead ends: 56 [2019-11-28 20:04:01,549 INFO L226 Difference]: Without dead ends: 53 [2019-11-28 20:04:01,551 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:04:01,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-28 20:04:01,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-11-28 20:04:01,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-28 20:04:01,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-11-28 20:04:01,597 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 11 [2019-11-28 20:04:01,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:04:01,598 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-11-28 20:04:01,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:04:01,599 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2019-11-28 20:04:01,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 20:04:01,600 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:04:01,600 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:04:01,600 INFO L410 AbstractCegarLoop]: === Iteration 2 === [build_nondet_StringErr3REQUIRES_VIOLATION, build_nondet_StringErr2REQUIRES_VIOLATION, build_nondet_StringErr1REQUIRES_VIOLATION, build_nondet_StringErr0REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, cstrchrErr4REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:04:01,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:04:01,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1524183616, now seen corresponding path program 1 times [2019-11-28 20:04:01,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:04:01,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084831441] [2019-11-28 20:04:01,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:04:01,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:01,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:01,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:04:01,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084831441] [2019-11-28 20:04:01,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:04:01,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:04:01,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176523309] [2019-11-28 20:04:01,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:04:01,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:04:01,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:04:01,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:04:01,688 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 4 states. [2019-11-28 20:04:01,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:04:01,843 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2019-11-28 20:04:01,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:04:01,844 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 20:04:01,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:04:01,845 INFO L225 Difference]: With dead ends: 51 [2019-11-28 20:04:01,845 INFO L226 Difference]: Without dead ends: 51 [2019-11-28 20:04:01,846 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:04:01,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-28 20:04:01,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-11-28 20:04:01,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-28 20:04:01,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-11-28 20:04:01,854 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 11 [2019-11-28 20:04:01,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:04:01,854 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-11-28 20:04:01,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:04:01,855 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-11-28 20:04:01,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 20:04:01,856 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:04:01,856 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:04:01,857 INFO L410 AbstractCegarLoop]: === Iteration 3 === [build_nondet_StringErr3REQUIRES_VIOLATION, build_nondet_StringErr2REQUIRES_VIOLATION, build_nondet_StringErr1REQUIRES_VIOLATION, build_nondet_StringErr0REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, cstrchrErr4REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:04:01,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:04:01,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1524183617, now seen corresponding path program 1 times [2019-11-28 20:04:01,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:04:01,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682292458] [2019-11-28 20:04:01,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:04:01,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:01,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:01,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:04:01,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682292458] [2019-11-28 20:04:01,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:04:01,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:04:01,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187510914] [2019-11-28 20:04:01,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:04:01,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:04:01,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:04:01,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:04:01,974 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 5 states. [2019-11-28 20:04:02,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:04:02,109 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2019-11-28 20:04:02,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:04:02,109 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-28 20:04:02,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:04:02,110 INFO L225 Difference]: With dead ends: 50 [2019-11-28 20:04:02,111 INFO L226 Difference]: Without dead ends: 50 [2019-11-28 20:04:02,111 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:04:02,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-28 20:04:02,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-11-28 20:04:02,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-28 20:04:02,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-11-28 20:04:02,118 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 11 [2019-11-28 20:04:02,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:04:02,118 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-11-28 20:04:02,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:04:02,119 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-11-28 20:04:02,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 20:04:02,119 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:04:02,120 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:04:02,120 INFO L410 AbstractCegarLoop]: === Iteration 4 === [build_nondet_StringErr3REQUIRES_VIOLATION, build_nondet_StringErr2REQUIRES_VIOLATION, build_nondet_StringErr1REQUIRES_VIOLATION, build_nondet_StringErr0REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, cstrchrErr4REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:04:02,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:04:02,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1524183670, now seen corresponding path program 1 times [2019-11-28 20:04:02,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:04:02,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326950808] [2019-11-28 20:04:02,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:04:02,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:02,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:02,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:04:02,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326950808] [2019-11-28 20:04:02,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:04:02,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 20:04:02,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324834653] [2019-11-28 20:04:02,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:04:02,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:04:02,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:04:02,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:04:02,225 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 5 states. [2019-11-28 20:04:02,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:04:02,339 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2019-11-28 20:04:02,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:04:02,340 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-28 20:04:02,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:04:02,343 INFO L225 Difference]: With dead ends: 56 [2019-11-28 20:04:02,344 INFO L226 Difference]: Without dead ends: 56 [2019-11-28 20:04:02,344 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:04:02,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-28 20:04:02,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2019-11-28 20:04:02,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-28 20:04:02,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-11-28 20:04:02,355 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 11 [2019-11-28 20:04:02,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:04:02,357 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-11-28 20:04:02,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:04:02,357 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-11-28 20:04:02,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 20:04:02,358 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:04:02,358 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:04:02,359 INFO L410 AbstractCegarLoop]: === Iteration 5 === [build_nondet_StringErr3REQUIRES_VIOLATION, build_nondet_StringErr2REQUIRES_VIOLATION, build_nondet_StringErr1REQUIRES_VIOLATION, build_nondet_StringErr0REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, cstrchrErr4REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:04:02,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:04:02,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1524243252, now seen corresponding path program 1 times [2019-11-28 20:04:02,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:04:02,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127187600] [2019-11-28 20:04:02,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:04:02,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:02,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:02,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:04:02,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127187600] [2019-11-28 20:04:02,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:04:02,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:04:02,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16225903] [2019-11-28 20:04:02,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:04:02,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:04:02,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:04:02,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:04:02,463 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 5 states. [2019-11-28 20:04:02,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:04:02,654 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2019-11-28 20:04:02,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:04:02,655 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-28 20:04:02,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:04:02,656 INFO L225 Difference]: With dead ends: 60 [2019-11-28 20:04:02,657 INFO L226 Difference]: Without dead ends: 60 [2019-11-28 20:04:02,658 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:04:02,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-28 20:04:02,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2019-11-28 20:04:02,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-28 20:04:02,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2019-11-28 20:04:02,671 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 11 [2019-11-28 20:04:02,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:04:02,671 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2019-11-28 20:04:02,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:04:02,672 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2019-11-28 20:04:02,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 20:04:02,673 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:04:02,673 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:04:02,674 INFO L410 AbstractCegarLoop]: === Iteration 6 === [build_nondet_StringErr3REQUIRES_VIOLATION, build_nondet_StringErr2REQUIRES_VIOLATION, build_nondet_StringErr1REQUIRES_VIOLATION, build_nondet_StringErr0REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, cstrchrErr4REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:04:02,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:04:02,674 INFO L82 PathProgramCache]: Analyzing trace with hash -583933833, now seen corresponding path program 1 times [2019-11-28 20:04:02,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:04:02,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442484018] [2019-11-28 20:04:02,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:04:02,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:02,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:02,792 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:04:02,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442484018] [2019-11-28 20:04:02,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988750693] [2019-11-28 20:04:02,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:04:02,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:02,911 INFO L264 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 20:04:02,918 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:04:02,988 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 20:04:02,988 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:04:02,999 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:04:03,000 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:04:03,001 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-28 20:04:03,046 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:04:03,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:04:03,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 6 [2019-11-28 20:04:03,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107263372] [2019-11-28 20:04:03,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:04:03,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:04:03,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:04:03,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:04:03,049 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 7 states. [2019-11-28 20:04:03,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:04:03,216 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2019-11-28 20:04:03,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:04:03,217 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-11-28 20:04:03,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:04:03,218 INFO L225 Difference]: With dead ends: 59 [2019-11-28 20:04:03,218 INFO L226 Difference]: Without dead ends: 59 [2019-11-28 20:04:03,219 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:04:03,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-28 20:04:03,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 51. [2019-11-28 20:04:03,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-28 20:04:03,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-11-28 20:04:03,225 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 15 [2019-11-28 20:04:03,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:04:03,225 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-11-28 20:04:03,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:04:03,226 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-11-28 20:04:03,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 20:04:03,227 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:04:03,227 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:04:03,427 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:04:03,433 INFO L410 AbstractCegarLoop]: === Iteration 7 === [build_nondet_StringErr3REQUIRES_VIOLATION, build_nondet_StringErr2REQUIRES_VIOLATION, build_nondet_StringErr1REQUIRES_VIOLATION, build_nondet_StringErr0REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, cstrchrErr4REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:04:03,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:04:03,434 INFO L82 PathProgramCache]: Analyzing trace with hash -269979680, now seen corresponding path program 1 times [2019-11-28 20:04:03,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:04:03,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757720744] [2019-11-28 20:04:03,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:04:03,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:03,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:03,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:03,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:04:03,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757720744] [2019-11-28 20:04:03,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:04:03,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 20:04:03,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355103383] [2019-11-28 20:04:03,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 20:04:03,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:04:03,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 20:04:03,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:04:03,609 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 10 states. [2019-11-28 20:04:03,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:04:03,963 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2019-11-28 20:04:03,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 20:04:03,963 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-11-28 20:04:03,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:04:03,964 INFO L225 Difference]: With dead ends: 47 [2019-11-28 20:04:03,964 INFO L226 Difference]: Without dead ends: 47 [2019-11-28 20:04:03,965 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-11-28 20:04:03,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-28 20:04:03,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-11-28 20:04:03,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-28 20:04:03,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-11-28 20:04:03,969 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 18 [2019-11-28 20:04:03,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:04:03,970 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-11-28 20:04:03,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 20:04:03,970 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-11-28 20:04:03,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 20:04:03,974 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:04:03,974 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:04:03,975 INFO L410 AbstractCegarLoop]: === Iteration 8 === [build_nondet_StringErr3REQUIRES_VIOLATION, build_nondet_StringErr2REQUIRES_VIOLATION, build_nondet_StringErr1REQUIRES_VIOLATION, build_nondet_StringErr0REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, cstrchrErr4REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:04:03,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:04:03,975 INFO L82 PathProgramCache]: Analyzing trace with hash -269979679, now seen corresponding path program 1 times [2019-11-28 20:04:03,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:04:03,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569191463] [2019-11-28 20:04:03,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:04:03,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:04,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:04,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:04,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:04:04,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569191463] [2019-11-28 20:04:04,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:04:04,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-28 20:04:04,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244148793] [2019-11-28 20:04:04,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 20:04:04,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:04:04,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 20:04:04,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-11-28 20:04:04,215 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 12 states. [2019-11-28 20:04:04,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:04:04,619 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2019-11-28 20:04:04,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 20:04:04,619 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-11-28 20:04:04,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:04:04,620 INFO L225 Difference]: With dead ends: 57 [2019-11-28 20:04:04,621 INFO L226 Difference]: Without dead ends: 57 [2019-11-28 20:04:04,621 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-11-28 20:04:04,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-28 20:04:04,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2019-11-28 20:04:04,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-28 20:04:04,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2019-11-28 20:04:04,627 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 18 [2019-11-28 20:04:04,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:04:04,628 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2019-11-28 20:04:04,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 20:04:04,628 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2019-11-28 20:04:04,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 20:04:04,629 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:04:04,629 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:04:04,630 INFO L410 AbstractCegarLoop]: === Iteration 9 === [build_nondet_StringErr3REQUIRES_VIOLATION, build_nondet_StringErr2REQUIRES_VIOLATION, build_nondet_StringErr1REQUIRES_VIOLATION, build_nondet_StringErr0REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, cstrchrErr4REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:04:04,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:04:04,630 INFO L82 PathProgramCache]: Analyzing trace with hash -463192456, now seen corresponding path program 1 times [2019-11-28 20:04:04,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:04:04,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233211697] [2019-11-28 20:04:04,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:04:04,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:04,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:04,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:04,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:04:04,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233211697] [2019-11-28 20:04:04,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:04:04,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 20:04:04,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264107501] [2019-11-28 20:04:04,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:04:04,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:04:04,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:04:04,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:04:04,682 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 5 states. [2019-11-28 20:04:04,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:04:04,785 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2019-11-28 20:04:04,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:04:04,785 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-28 20:04:04,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:04:04,787 INFO L225 Difference]: With dead ends: 55 [2019-11-28 20:04:04,787 INFO L226 Difference]: Without dead ends: 55 [2019-11-28 20:04:04,787 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:04:04,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-28 20:04:04,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-11-28 20:04:04,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-28 20:04:04,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2019-11-28 20:04:04,792 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 22 [2019-11-28 20:04:04,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:04:04,793 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2019-11-28 20:04:04,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:04:04,793 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2019-11-28 20:04:04,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 20:04:04,794 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:04:04,794 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:04:04,795 INFO L410 AbstractCegarLoop]: === Iteration 10 === [build_nondet_StringErr3REQUIRES_VIOLATION, build_nondet_StringErr2REQUIRES_VIOLATION, build_nondet_StringErr1REQUIRES_VIOLATION, build_nondet_StringErr0REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, cstrchrErr4REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:04:04,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:04:04,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1542788213, now seen corresponding path program 1 times [2019-11-28 20:04:04,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:04:04,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774543866] [2019-11-28 20:04:04,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:04:04,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:04,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:04,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:05,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:04:05,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774543866] [2019-11-28 20:04:05,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:04:05,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-28 20:04:05,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157852787] [2019-11-28 20:04:05,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 20:04:05,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:04:05,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 20:04:05,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2019-11-28 20:04:05,031 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 14 states. [2019-11-28 20:04:05,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:04:05,580 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2019-11-28 20:04:05,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 20:04:05,581 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2019-11-28 20:04:05,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:04:05,582 INFO L225 Difference]: With dead ends: 81 [2019-11-28 20:04:05,582 INFO L226 Difference]: Without dead ends: 81 [2019-11-28 20:04:05,582 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2019-11-28 20:04:05,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-11-28 20:04:05,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 71. [2019-11-28 20:04:05,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-28 20:04:05,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2019-11-28 20:04:05,589 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 24 [2019-11-28 20:04:05,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:04:05,590 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2019-11-28 20:04:05,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 20:04:05,590 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2019-11-28 20:04:05,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 20:04:05,591 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:04:05,592 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:04:05,592 INFO L410 AbstractCegarLoop]: === Iteration 11 === [build_nondet_StringErr3REQUIRES_VIOLATION, build_nondet_StringErr2REQUIRES_VIOLATION, build_nondet_StringErr1REQUIRES_VIOLATION, build_nondet_StringErr0REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, cstrchrErr4REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:04:05,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:04:05,592 INFO L82 PathProgramCache]: Analyzing trace with hash -45559689, now seen corresponding path program 1 times [2019-11-28 20:04:05,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:04:05,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96529291] [2019-11-28 20:04:05,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:04:05,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:05,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:05,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:05,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:04:05,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96529291] [2019-11-28 20:04:05,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:04:05,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-11-28 20:04:05,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2200732] [2019-11-28 20:04:05,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-28 20:04:05,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:04:05,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 20:04:05,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-11-28 20:04:05,825 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand 15 states. [2019-11-28 20:04:06,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:04:06,385 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2019-11-28 20:04:06,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 20:04:06,386 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2019-11-28 20:04:06,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:04:06,387 INFO L225 Difference]: With dead ends: 101 [2019-11-28 20:04:06,387 INFO L226 Difference]: Without dead ends: 101 [2019-11-28 20:04:06,388 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2019-11-28 20:04:06,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-28 20:04:06,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 72. [2019-11-28 20:04:06,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-28 20:04:06,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2019-11-28 20:04:06,393 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 24 [2019-11-28 20:04:06,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:04:06,394 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2019-11-28 20:04:06,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-28 20:04:06,394 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2019-11-28 20:04:06,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 20:04:06,395 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:04:06,395 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:04:06,396 INFO L410 AbstractCegarLoop]: === Iteration 12 === [build_nondet_StringErr3REQUIRES_VIOLATION, build_nondet_StringErr2REQUIRES_VIOLATION, build_nondet_StringErr1REQUIRES_VIOLATION, build_nondet_StringErr0REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, cstrchrErr4REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:04:06,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:04:06,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1919056224, now seen corresponding path program 1 times [2019-11-28 20:04:06,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:04:06,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829943475] [2019-11-28 20:04:06,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:04:06,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:06,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:06,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:06,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:06,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:04:06,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829943475] [2019-11-28 20:04:06,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:04:06,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-28 20:04:06,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106554152] [2019-11-28 20:04:06,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 20:04:06,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:04:06,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 20:04:06,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-11-28 20:04:06,542 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand 12 states. [2019-11-28 20:04:06,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:04:06,957 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2019-11-28 20:04:06,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 20:04:06,958 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2019-11-28 20:04:06,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:04:06,960 INFO L225 Difference]: With dead ends: 80 [2019-11-28 20:04:06,960 INFO L226 Difference]: Without dead ends: 80 [2019-11-28 20:04:06,960 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2019-11-28 20:04:06,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-28 20:04:06,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-11-28 20:04:06,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-28 20:04:06,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2019-11-28 20:04:06,968 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 27 [2019-11-28 20:04:06,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:04:06,968 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2019-11-28 20:04:06,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 20:04:06,969 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2019-11-28 20:04:06,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 20:04:06,970 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:04:06,970 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:04:06,971 INFO L410 AbstractCegarLoop]: === Iteration 13 === [build_nondet_StringErr3REQUIRES_VIOLATION, build_nondet_StringErr2REQUIRES_VIOLATION, build_nondet_StringErr1REQUIRES_VIOLATION, build_nondet_StringErr0REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, cstrchrErr4REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:04:06,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:04:06,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1919056223, now seen corresponding path program 1 times [2019-11-28 20:04:06,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:04:06,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745246] [2019-11-28 20:04:06,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:04:06,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:07,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:07,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:07,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:04:07,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:04:07,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745246] [2019-11-28 20:04:07,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:04:07,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-28 20:04:07,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906774542] [2019-11-28 20:04:07,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 20:04:07,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:04:07,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 20:04:07,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-11-28 20:04:07,206 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand 13 states. [2019-11-28 20:04:07,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:04:07,649 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2019-11-28 20:04:07,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 20:04:07,650 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2019-11-28 20:04:07,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:04:07,652 INFO L225 Difference]: With dead ends: 88 [2019-11-28 20:04:07,652 INFO L226 Difference]: Without dead ends: 88 [2019-11-28 20:04:07,652 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2019-11-28 20:04:07,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-28 20:04:07,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2019-11-28 20:04:07,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-28 20:04:07,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2019-11-28 20:04:07,658 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 27 [2019-11-28 20:04:07,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:04:07,659 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2019-11-28 20:04:07,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 20:04:07,659 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2019-11-28 20:04:07,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 20:04:07,660 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:04:07,660 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:04:07,661 INFO L410 AbstractCegarLoop]: === Iteration 14 === [build_nondet_StringErr3REQUIRES_VIOLATION, build_nondet_StringErr2REQUIRES_VIOLATION, build_nondet_StringErr1REQUIRES_VIOLATION, build_nondet_StringErr0REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, cstrchrErr4REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:04:07,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:04:07,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1917209182, now seen corresponding path program 1 times [2019-11-28 20:04:07,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:04:07,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300529990] [2019-11-28 20:04:07,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:04:07,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:04:07,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:04:07,716 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:04:07,716 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 20:04:07,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:04:07 BoogieIcfgContainer [2019-11-28 20:04:07,753 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 20:04:07,754 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:04:07,754 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:04:07,754 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:04:07,755 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:04:01" (3/4) ... [2019-11-28 20:04:07,757 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 20:04:07,803 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 20:04:07,803 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:04:07,805 INFO L168 Benchmark]: Toolchain (without parser) took 8150.10 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 306.7 MB). Free memory was 955.0 MB in the beginning and 1.2 GB in the end (delta: -265.6 MB). Peak memory consumption was 41.1 MB. Max. memory is 11.5 GB. [2019-11-28 20:04:07,805 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:04:07,806 INFO L168 Benchmark]: CACSL2BoogieTranslator took 676.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -143.2 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-11-28 20:04:07,807 INFO L168 Benchmark]: Boogie Preprocessor took 62.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-28 20:04:07,807 INFO L168 Benchmark]: RCFGBuilder took 690.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.8 MB). Peak memory consumption was 45.8 MB. Max. memory is 11.5 GB. [2019-11-28 20:04:07,808 INFO L168 Benchmark]: TraceAbstraction took 6666.00 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 184.0 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -175.1 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. [2019-11-28 20:04:07,809 INFO L168 Benchmark]: Witness Printer took 49.41 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:04:07,812 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 676.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -143.2 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 62.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 690.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.8 MB). Peak memory consumption was 45.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6666.00 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 184.0 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -175.1 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. * Witness Printer took 49.41 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 537]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L536] CALL, EXPR build_nondet_String() [L515] int length = __VERIFIER_nondet_int(); [L516] COND TRUE length < 1 [L517] length = 1 VAL [length=1] [L519] char* nondetString = (char*) malloc(length * sizeof(char)); [L521] int i = 0; VAL [i=0, length=1, malloc(length * sizeof(char))={-1:0}, nondetString={-1:0}] [L521] COND FALSE !(i < length - 1) VAL [i=0, length=1, malloc(length * sizeof(char))={-1:0}, nondetString={-1:0}] [L526] nondetString[length-1] = '\0' VAL [i=0, length=1, malloc(length * sizeof(char))={-1:0}, nondetString={-1:0}] [L527] return nondetString; VAL [\result={-1:0}, i=0, length=1, malloc(length * sizeof(char))={-1:0}, nondetString={-1:0}] [L536] RET, EXPR build_nondet_String() VAL [build_nondet_String()={-1:0}] [L536] char* s = build_nondet_String(); [L537] CALL cstrchr(s,__VERIFIER_nondet_int()) VAL [\old(c)=1, s={-1:0}] [L531] EXPR \read(*s) VAL [\old(c)=1, \read(*s)=0, c=1, s={-1:0}, s={-1:0}] [L531] *s != '\0' && *s != (char)c VAL [*s != '\0' && *s != (char)c=0, \old(c)=1, \read(*s)=0, c=1, s={-1:0}, s={-1:0}] [L531] COND FALSE !(*s != '\0' && *s != (char)c) [L533] EXPR \read(*s) VAL [\old(c)=1, \read(*s)=0, c=1, s={-1:0}, s={-1:0}] [L533] EXPR (*s == c) ? (char *) s : 0 VAL [(*s == c) ? (char *) s : 0={0:0}, \old(c)=1, \read(*s)=0, c=1, s={-1:0}, s={-1:0}] [L533] return ( (*s == c) ? (char *) s : 0 ); [L537] RET cstrchr(s,__VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=1, cstrchr(s,__VERIFIER_nondet_int())={0:0}, s={-1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 71 locations, 16 error locations. Result: UNSAFE, OverallTime: 6.5s, OverallIterations: 14, TraceHistogramMax: 2, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 456 SDtfs, 844 SDslu, 807 SDs, 0 SdLazy, 2463 SolverSat, 122 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 193 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 2.1s 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 DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 66 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 272 NumberOfCodeBlocks, 272 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 231 ConstructedInterpolants, 0 QuantifiedInterpolants, 20896 SizeOfPredicates, 3 NumberOfNonLiveVariables, 69 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 14 InterpolantComputations, 12 PerfectInterpolantSequences, 5/7 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...