./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/forester-heap/dll-token-2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -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/forester-heap/dll-token-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 35a5ccff58935eefedf723cd2243fac7c8b8e61b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup) --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:18:47,313 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:18:47,316 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:18:47,336 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:18:47,336 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:18:47,338 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:18:47,341 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:18:47,351 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:18:47,356 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:18:47,361 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:18:47,363 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:18:47,365 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:18:47,365 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:18:47,368 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:18:47,369 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:18:47,371 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:18:47,373 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:18:47,374 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:18:47,377 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:18:47,381 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:18:47,386 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:18:47,390 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:18:47,392 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:18:47,393 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:18:47,396 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:18:47,396 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:18:47,397 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:18:47,399 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:18:47,399 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:18:47,400 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:18:47,401 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:18:47,402 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:18:47,403 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:18:47,403 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:18:47,405 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:18:47,405 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:18:47,406 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:18:47,406 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:18:47,407 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:18:47,408 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:18:47,409 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:18:47,410 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2020-07-29 01:18:47,443 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:18:47,443 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:18:47,447 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:18:47,448 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:18:47,448 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:18:47,448 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:18:47,448 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 01:18:47,448 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:18:47,449 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:18:47,449 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 01:18:47,449 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:18:47,450 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-07-29 01:18:47,451 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-07-29 01:18:47,451 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-29 01:18:47,451 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-07-29 01:18:47,452 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 01:18:47,452 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:18:47,452 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:18:47,453 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:18:47,453 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-29 01:18:47,453 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-29 01:18:47,453 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 01:18:47,454 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:18:47,454 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-29 01:18:47,455 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:18:47,455 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-29 01:18:47,455 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:18:47,456 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-memcleanup) ) 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 -> 35a5ccff58935eefedf723cd2243fac7c8b8e61b [2020-07-29 01:18:47,820 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:18:47,836 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:18:47,840 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:18:47,841 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:18:47,842 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:18:47,843 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-token-2.i [2020-07-29 01:18:47,902 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1ffdb7c1/2ddbeb0e0a2140358a1d1ec1f90d0f85/FLAGa294dc1d8 [2020-07-29 01:18:48,476 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:18:48,477 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-2.i [2020-07-29 01:18:48,490 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1ffdb7c1/2ddbeb0e0a2140358a1d1ec1f90d0f85/FLAGa294dc1d8 [2020-07-29 01:18:48,746 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1ffdb7c1/2ddbeb0e0a2140358a1d1ec1f90d0f85 [2020-07-29 01:18:48,749 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:18:48,753 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-07-29 01:18:48,754 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:18:48,754 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:18:48,758 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:18:48,760 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:18:48" (1/1) ... [2020-07-29 01:18:48,765 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ed5985d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:18:48, skipping insertion in model container [2020-07-29 01:18:48,766 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:18:48" (1/1) ... [2020-07-29 01:18:48,774 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:18:48,813 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:18:49,234 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:18:49,245 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:18:49,295 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:18:49,367 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:18:49,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:18:49 WrapperNode [2020-07-29 01:18:49,368 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:18:49,369 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:18:49,369 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:18:49,369 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:18:49,383 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:18:49" (1/1) ... [2020-07-29 01:18:49,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:18:49" (1/1) ... [2020-07-29 01:18:49,403 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:18:49" (1/1) ... [2020-07-29 01:18:49,404 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:18:49" (1/1) ... [2020-07-29 01:18:49,434 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:18:49" (1/1) ... [2020-07-29 01:18:49,444 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:18:49" (1/1) ... [2020-07-29 01:18:49,447 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:18:49" (1/1) ... [2020-07-29 01:18:49,455 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:18:49,455 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:18:49,455 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:18:49,456 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:18:49,457 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:18:49" (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 [2020-07-29 01:18:49,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-29 01:18:49,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:18:49,527 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-29 01:18:49,527 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-29 01:18:49,528 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-29 01:18:49,528 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-29 01:18:49,529 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-29 01:18:49,529 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-29 01:18:49,529 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-29 01:18:49,530 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-29 01:18:49,530 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-29 01:18:49,531 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-29 01:18:49,531 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-29 01:18:49,531 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-29 01:18:49,531 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-29 01:18:49,532 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-29 01:18:49,532 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-29 01:18:49,533 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-29 01:18:49,533 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-29 01:18:49,533 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-29 01:18:49,533 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-29 01:18:49,534 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-29 01:18:49,535 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-29 01:18:49,536 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-29 01:18:49,536 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-29 01:18:49,536 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-29 01:18:49,538 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-29 01:18:49,539 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-29 01:18:49,539 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-29 01:18:49,540 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-29 01:18:49,540 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-29 01:18:49,540 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-29 01:18:49,540 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-29 01:18:49,541 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-29 01:18:49,541 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-29 01:18:49,541 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-29 01:18:49,541 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-29 01:18:49,541 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-29 01:18:49,542 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-29 01:18:49,542 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-29 01:18:49,542 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-29 01:18:49,542 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-29 01:18:49,542 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-29 01:18:49,543 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-29 01:18:49,544 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-29 01:18:49,544 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-29 01:18:49,545 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-29 01:18:49,545 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-29 01:18:49,545 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-29 01:18:49,545 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-29 01:18:49,546 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-29 01:18:49,546 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-29 01:18:49,546 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-29 01:18:49,546 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-29 01:18:49,547 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-29 01:18:49,547 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-29 01:18:49,547 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-29 01:18:49,547 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-29 01:18:49,547 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-29 01:18:49,548 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-29 01:18:49,548 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-29 01:18:49,548 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-29 01:18:49,549 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-29 01:18:49,549 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-29 01:18:49,549 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-29 01:18:49,549 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-29 01:18:49,549 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-29 01:18:49,550 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-29 01:18:49,550 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-29 01:18:49,551 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-29 01:18:49,551 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-29 01:18:49,551 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-29 01:18:49,552 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-29 01:18:49,553 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-29 01:18:49,553 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-29 01:18:49,554 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-29 01:18:49,555 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-29 01:18:49,555 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-29 01:18:49,555 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-29 01:18:49,556 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-29 01:18:49,556 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-29 01:18:49,556 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-29 01:18:49,556 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-29 01:18:49,556 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-29 01:18:49,557 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-29 01:18:49,557 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-29 01:18:49,557 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-29 01:18:49,557 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-29 01:18:49,557 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-29 01:18:49,558 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-29 01:18:49,558 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-29 01:18:49,558 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-29 01:18:49,558 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-29 01:18:49,558 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-29 01:18:49,559 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-29 01:18:49,559 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-29 01:18:49,559 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-29 01:18:49,559 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-29 01:18:49,560 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-29 01:18:49,560 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-29 01:18:49,560 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-29 01:18:49,560 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-29 01:18:49,561 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-29 01:18:49,561 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-29 01:18:49,561 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-29 01:18:49,561 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-29 01:18:49,561 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-29 01:18:49,562 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-29 01:18:49,562 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-29 01:18:49,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-29 01:18:49,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-29 01:18:49,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:18:49,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-29 01:18:49,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:18:49,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:18:49,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-29 01:18:49,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:18:50,535 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:18:50,536 INFO L295 CfgBuilder]: Removed 15 assume(true) statements. [2020-07-29 01:18:50,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:18:50 BoogieIcfgContainer [2020-07-29 01:18:50,541 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:18:50,543 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-29 01:18:50,543 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-29 01:18:50,547 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-29 01:18:50,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.07 01:18:48" (1/3) ... [2020-07-29 01:18:50,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c82eb63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:18:50, skipping insertion in model container [2020-07-29 01:18:50,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:18:49" (2/3) ... [2020-07-29 01:18:50,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c82eb63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:18:50, skipping insertion in model container [2020-07-29 01:18:50,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:18:50" (3/3) ... [2020-07-29 01:18:50,551 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-token-2.i [2020-07-29 01:18:50,562 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-29 01:18:50,571 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 64 error locations. [2020-07-29 01:18:50,587 INFO L251 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2020-07-29 01:18:50,609 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-29 01:18:50,609 INFO L376 AbstractCegarLoop]: Hoare is false [2020-07-29 01:18:50,610 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-29 01:18:50,610 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:18:50,610 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:18:50,610 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-29 01:18:50,611 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:18:50,611 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-29 01:18:50,633 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states. [2020-07-29 01:18:50,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-29 01:18:50,643 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:18:50,645 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:18:50,646 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr63ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr54ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:18:50,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:18:50,653 INFO L82 PathProgramCache]: Analyzing trace with hash 289074493, now seen corresponding path program 1 times [2020-07-29 01:18:50,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:18:50,665 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484005443] [2020-07-29 01:18:50,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:18:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:50,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:18:50,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:50,902 INFO L280 TraceCheckUtils]: 0: Hoare triple {148#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {142#true} is VALID [2020-07-29 01:18:50,903 INFO L280 TraceCheckUtils]: 1: Hoare triple {142#true} assume true; {142#true} is VALID [2020-07-29 01:18:50,904 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {142#true} {142#true} #251#return; {142#true} is VALID [2020-07-29 01:18:50,916 INFO L263 TraceCheckUtils]: 0: Hoare triple {142#true} call ULTIMATE.init(); {148#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:18:50,916 INFO L280 TraceCheckUtils]: 1: Hoare triple {148#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {142#true} is VALID [2020-07-29 01:18:50,917 INFO L280 TraceCheckUtils]: 2: Hoare triple {142#true} assume true; {142#true} is VALID [2020-07-29 01:18:50,917 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {142#true} {142#true} #251#return; {142#true} is VALID [2020-07-29 01:18:50,918 INFO L263 TraceCheckUtils]: 4: Hoare triple {142#true} call #t~ret18 := main(); {142#true} is VALID [2020-07-29 01:18:50,922 INFO L280 TraceCheckUtils]: 5: Hoare triple {142#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {147#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-29 01:18:50,923 INFO L280 TraceCheckUtils]: 6: Hoare triple {147#(= 1 (select |#valid| main_~head~0.base))} assume !(1 == #valid[~head~0.base]); {143#false} is VALID [2020-07-29 01:18:50,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:18:50,925 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484005443] [2020-07-29 01:18:50,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:18:50,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:18:50,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345259872] [2020-07-29 01:18:50,937 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-29 01:18:50,943 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:18:50,948 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:18:50,969 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:50,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:18:50,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:18:50,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:18:50,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:18:50,984 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 4 states. [2020-07-29 01:18:51,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:51,783 INFO L93 Difference]: Finished difference Result 156 states and 159 transitions. [2020-07-29 01:18:51,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:18:51,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-29 01:18:51,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:18:51,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:18:51,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2020-07-29 01:18:51,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:18:51,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2020-07-29 01:18:51,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 187 transitions. [2020-07-29 01:18:52,074 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:52,097 INFO L225 Difference]: With dead ends: 156 [2020-07-29 01:18:52,097 INFO L226 Difference]: Without dead ends: 153 [2020-07-29 01:18:52,099 INFO L675 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 [2020-07-29 01:18:52,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2020-07-29 01:18:52,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 133. [2020-07-29 01:18:52,144 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:18:52,144 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand 133 states. [2020-07-29 01:18:52,145 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 133 states. [2020-07-29 01:18:52,146 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 133 states. [2020-07-29 01:18:52,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:52,157 INFO L93 Difference]: Finished difference Result 153 states and 156 transitions. [2020-07-29 01:18:52,158 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 156 transitions. [2020-07-29 01:18:52,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:52,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:52,160 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 153 states. [2020-07-29 01:18:52,161 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 153 states. [2020-07-29 01:18:52,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:52,172 INFO L93 Difference]: Finished difference Result 153 states and 156 transitions. [2020-07-29 01:18:52,172 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 156 transitions. [2020-07-29 01:18:52,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:52,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:52,175 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:18:52,175 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:18:52,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-07-29 01:18:52,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 135 transitions. [2020-07-29 01:18:52,185 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 135 transitions. Word has length 7 [2020-07-29 01:18:52,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:18:52,186 INFO L479 AbstractCegarLoop]: Abstraction has 133 states and 135 transitions. [2020-07-29 01:18:52,186 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:18:52,186 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 135 transitions. [2020-07-29 01:18:52,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-29 01:18:52,187 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:18:52,188 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:18:52,188 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-29 01:18:52,189 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr63ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr54ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:18:52,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:18:52,190 INFO L82 PathProgramCache]: Analyzing trace with hash 289074494, now seen corresponding path program 1 times [2020-07-29 01:18:52,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:18:52,190 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298835860] [2020-07-29 01:18:52,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:18:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:52,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:18:52,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:52,321 INFO L280 TraceCheckUtils]: 0: Hoare triple {752#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {746#true} is VALID [2020-07-29 01:18:52,322 INFO L280 TraceCheckUtils]: 1: Hoare triple {746#true} assume true; {746#true} is VALID [2020-07-29 01:18:52,322 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {746#true} {746#true} #251#return; {746#true} is VALID [2020-07-29 01:18:52,323 INFO L263 TraceCheckUtils]: 0: Hoare triple {746#true} call ULTIMATE.init(); {752#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:18:52,324 INFO L280 TraceCheckUtils]: 1: Hoare triple {752#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {746#true} is VALID [2020-07-29 01:18:52,324 INFO L280 TraceCheckUtils]: 2: Hoare triple {746#true} assume true; {746#true} is VALID [2020-07-29 01:18:52,324 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {746#true} {746#true} #251#return; {746#true} is VALID [2020-07-29 01:18:52,325 INFO L263 TraceCheckUtils]: 4: Hoare triple {746#true} call #t~ret18 := main(); {746#true} is VALID [2020-07-29 01:18:52,326 INFO L280 TraceCheckUtils]: 5: Hoare triple {746#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {751#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)))} is VALID [2020-07-29 01:18:52,327 INFO L280 TraceCheckUtils]: 6: Hoare triple {751#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)))} assume !(4 + ~head~0.offset <= #length[~head~0.base] && 0 <= ~head~0.offset); {747#false} is VALID [2020-07-29 01:18:52,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:18:52,329 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298835860] [2020-07-29 01:18:52,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:18:52,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:18:52,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781341345] [2020-07-29 01:18:52,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-29 01:18:52,332 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:18:52,332 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:18:52,345 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:52,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:18:52,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:18:52,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:18:52,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:18:52,347 INFO L87 Difference]: Start difference. First operand 133 states and 135 transitions. Second operand 4 states. [2020-07-29 01:18:53,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:53,037 INFO L93 Difference]: Finished difference Result 158 states and 160 transitions. [2020-07-29 01:18:53,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:18:53,037 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-29 01:18:53,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:18:53,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:18:53,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2020-07-29 01:18:53,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:18:53,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2020-07-29 01:18:53,046 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 163 transitions. [2020-07-29 01:18:53,245 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:53,251 INFO L225 Difference]: With dead ends: 158 [2020-07-29 01:18:53,251 INFO L226 Difference]: Without dead ends: 158 [2020-07-29 01:18:53,252 INFO L675 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 [2020-07-29 01:18:53,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-07-29 01:18:53,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 130. [2020-07-29 01:18:53,264 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:18:53,264 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand 130 states. [2020-07-29 01:18:53,264 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 130 states. [2020-07-29 01:18:53,265 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 130 states. [2020-07-29 01:18:53,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:53,273 INFO L93 Difference]: Finished difference Result 158 states and 160 transitions. [2020-07-29 01:18:53,273 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 160 transitions. [2020-07-29 01:18:53,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:53,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:53,275 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand 158 states. [2020-07-29 01:18:53,276 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 158 states. [2020-07-29 01:18:53,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:53,284 INFO L93 Difference]: Finished difference Result 158 states and 160 transitions. [2020-07-29 01:18:53,285 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 160 transitions. [2020-07-29 01:18:53,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:53,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:53,287 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:18:53,287 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:18:53,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2020-07-29 01:18:53,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 132 transitions. [2020-07-29 01:18:53,294 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 132 transitions. Word has length 7 [2020-07-29 01:18:53,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:18:53,294 INFO L479 AbstractCegarLoop]: Abstraction has 130 states and 132 transitions. [2020-07-29 01:18:53,294 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:18:53,294 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 132 transitions. [2020-07-29 01:18:53,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-29 01:18:53,295 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:18:53,295 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:18:53,296 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-29 01:18:53,296 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr63ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr54ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:18:53,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:18:53,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1397534318, now seen corresponding path program 1 times [2020-07-29 01:18:53,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:18:53,298 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957870671] [2020-07-29 01:18:53,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:18:53,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:53,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:18:53,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:53,371 INFO L280 TraceCheckUtils]: 0: Hoare triple {1366#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1359#true} is VALID [2020-07-29 01:18:53,371 INFO L280 TraceCheckUtils]: 1: Hoare triple {1359#true} assume true; {1359#true} is VALID [2020-07-29 01:18:53,372 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1359#true} {1359#true} #251#return; {1359#true} is VALID [2020-07-29 01:18:53,373 INFO L263 TraceCheckUtils]: 0: Hoare triple {1359#true} call ULTIMATE.init(); {1366#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:18:53,373 INFO L280 TraceCheckUtils]: 1: Hoare triple {1366#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1359#true} is VALID [2020-07-29 01:18:53,373 INFO L280 TraceCheckUtils]: 2: Hoare triple {1359#true} assume true; {1359#true} is VALID [2020-07-29 01:18:53,374 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1359#true} {1359#true} #251#return; {1359#true} is VALID [2020-07-29 01:18:53,374 INFO L263 TraceCheckUtils]: 4: Hoare triple {1359#true} call #t~ret18 := main(); {1359#true} is VALID [2020-07-29 01:18:53,375 INFO L280 TraceCheckUtils]: 5: Hoare triple {1359#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {1359#true} is VALID [2020-07-29 01:18:53,375 INFO L280 TraceCheckUtils]: 6: Hoare triple {1359#true} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); srcloc: L994 {1364#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-29 01:18:53,376 INFO L280 TraceCheckUtils]: 7: Hoare triple {1364#(= 1 (select |#valid| main_~head~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L994-1 {1364#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-29 01:18:53,377 INFO L280 TraceCheckUtils]: 8: Hoare triple {1364#(= 1 (select |#valid| main_~head~0.base))} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L995 {1364#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-29 01:18:53,378 INFO L280 TraceCheckUtils]: 9: Hoare triple {1364#(= 1 (select |#valid| main_~head~0.base))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1365#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-29 01:18:53,378 INFO L280 TraceCheckUtils]: 10: Hoare triple {1365#(= 1 (select |#valid| main_~x~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1365#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-29 01:18:53,379 INFO L280 TraceCheckUtils]: 11: Hoare triple {1365#(= 1 (select |#valid| main_~x~0.base))} assume !(0 != #t~nondet1);havoc #t~nondet1; {1365#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-29 01:18:53,380 INFO L280 TraceCheckUtils]: 12: Hoare triple {1365#(= 1 (select |#valid| main_~x~0.base))} assume !(1 == #valid[~x~0.base]); {1360#false} is VALID [2020-07-29 01:18:53,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:18:53,381 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957870671] [2020-07-29 01:18:53,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:18:53,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:18:53,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129320204] [2020-07-29 01:18:53,382 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-29 01:18:53,383 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:18:53,383 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:18:53,399 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:53,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 01:18:53,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:18:53,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:18:53,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:18:53,400 INFO L87 Difference]: Start difference. First operand 130 states and 132 transitions. Second operand 5 states. [2020-07-29 01:18:54,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:54,090 INFO L93 Difference]: Finished difference Result 134 states and 137 transitions. [2020-07-29 01:18:54,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:18:54,091 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-29 01:18:54,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:18:54,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:18:54,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 156 transitions. [2020-07-29 01:18:54,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:18:54,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 156 transitions. [2020-07-29 01:18:54,099 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 156 transitions. [2020-07-29 01:18:54,264 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:54,268 INFO L225 Difference]: With dead ends: 134 [2020-07-29 01:18:54,268 INFO L226 Difference]: Without dead ends: 134 [2020-07-29 01:18:54,269 INFO L675 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 [2020-07-29 01:18:54,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-07-29 01:18:54,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 117. [2020-07-29 01:18:54,276 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:18:54,276 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand 117 states. [2020-07-29 01:18:54,276 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand 117 states. [2020-07-29 01:18:54,276 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 117 states. [2020-07-29 01:18:54,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:54,282 INFO L93 Difference]: Finished difference Result 134 states and 137 transitions. [2020-07-29 01:18:54,282 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 137 transitions. [2020-07-29 01:18:54,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:54,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:54,283 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 134 states. [2020-07-29 01:18:54,284 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 134 states. [2020-07-29 01:18:54,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:54,289 INFO L93 Difference]: Finished difference Result 134 states and 137 transitions. [2020-07-29 01:18:54,289 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 137 transitions. [2020-07-29 01:18:54,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:54,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:54,290 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:18:54,291 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:18:54,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-07-29 01:18:54,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 121 transitions. [2020-07-29 01:18:54,295 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 121 transitions. Word has length 13 [2020-07-29 01:18:54,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:18:54,296 INFO L479 AbstractCegarLoop]: Abstraction has 117 states and 121 transitions. [2020-07-29 01:18:54,296 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 01:18:54,296 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2020-07-29 01:18:54,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-29 01:18:54,297 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:18:54,297 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:18:54,297 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-29 01:18:54,298 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr63ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr54ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:18:54,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:18:54,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1397534319, now seen corresponding path program 1 times [2020-07-29 01:18:54,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:18:54,299 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121997711] [2020-07-29 01:18:54,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:18:54,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:54,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:18:54,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:54,400 INFO L280 TraceCheckUtils]: 0: Hoare triple {1897#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1890#true} is VALID [2020-07-29 01:18:54,400 INFO L280 TraceCheckUtils]: 1: Hoare triple {1890#true} assume true; {1890#true} is VALID [2020-07-29 01:18:54,400 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1890#true} {1890#true} #251#return; {1890#true} is VALID [2020-07-29 01:18:54,402 INFO L263 TraceCheckUtils]: 0: Hoare triple {1890#true} call ULTIMATE.init(); {1897#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:18:54,402 INFO L280 TraceCheckUtils]: 1: Hoare triple {1897#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1890#true} is VALID [2020-07-29 01:18:54,402 INFO L280 TraceCheckUtils]: 2: Hoare triple {1890#true} assume true; {1890#true} is VALID [2020-07-29 01:18:54,403 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1890#true} {1890#true} #251#return; {1890#true} is VALID [2020-07-29 01:18:54,403 INFO L263 TraceCheckUtils]: 4: Hoare triple {1890#true} call #t~ret18 := main(); {1890#true} is VALID [2020-07-29 01:18:54,404 INFO L280 TraceCheckUtils]: 5: Hoare triple {1890#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {1895#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)))} is VALID [2020-07-29 01:18:54,406 INFO L280 TraceCheckUtils]: 6: Hoare triple {1895#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)))} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); srcloc: L994 {1895#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)))} is VALID [2020-07-29 01:18:54,407 INFO L280 TraceCheckUtils]: 7: Hoare triple {1895#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)))} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L994-1 {1895#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)))} is VALID [2020-07-29 01:18:54,408 INFO L280 TraceCheckUtils]: 8: Hoare triple {1895#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)))} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L995 {1895#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)))} is VALID [2020-07-29 01:18:54,409 INFO L280 TraceCheckUtils]: 9: Hoare triple {1895#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1896#(and (= 12 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0))} is VALID [2020-07-29 01:18:54,410 INFO L280 TraceCheckUtils]: 10: Hoare triple {1896#(and (= 12 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1896#(and (= 12 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0))} is VALID [2020-07-29 01:18:54,411 INFO L280 TraceCheckUtils]: 11: Hoare triple {1896#(and (= 12 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0))} assume !(0 != #t~nondet1);havoc #t~nondet1; {1896#(and (= 12 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0))} is VALID [2020-07-29 01:18:54,413 INFO L280 TraceCheckUtils]: 12: Hoare triple {1896#(and (= 12 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0))} assume !(4 + (8 + ~x~0.offset) <= #length[~x~0.base] && 0 <= 8 + ~x~0.offset); {1891#false} is VALID [2020-07-29 01:18:54,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:18:54,414 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121997711] [2020-07-29 01:18:54,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:18:54,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:18:54,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923019726] [2020-07-29 01:18:54,415 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-29 01:18:54,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:18:54,416 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:18:54,434 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:54,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 01:18:54,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:18:54,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:18:54,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:18:54,435 INFO L87 Difference]: Start difference. First operand 117 states and 121 transitions. Second operand 5 states. [2020-07-29 01:18:55,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:55,408 INFO L93 Difference]: Finished difference Result 207 states and 211 transitions. [2020-07-29 01:18:55,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:18:55,409 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-29 01:18:55,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:18:55,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:18:55,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 229 transitions. [2020-07-29 01:18:55,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:18:55,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 229 transitions. [2020-07-29 01:18:55,418 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 229 transitions. [2020-07-29 01:18:55,733 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 229 edges. 229 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:55,738 INFO L225 Difference]: With dead ends: 207 [2020-07-29 01:18:55,739 INFO L226 Difference]: Without dead ends: 207 [2020-07-29 01:18:55,739 INFO L675 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 [2020-07-29 01:18:55,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2020-07-29 01:18:55,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 152. [2020-07-29 01:18:55,749 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:18:55,749 INFO L82 GeneralOperation]: Start isEquivalent. First operand 207 states. Second operand 152 states. [2020-07-29 01:18:55,749 INFO L74 IsIncluded]: Start isIncluded. First operand 207 states. Second operand 152 states. [2020-07-29 01:18:55,749 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 152 states. [2020-07-29 01:18:55,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:55,757 INFO L93 Difference]: Finished difference Result 207 states and 211 transitions. [2020-07-29 01:18:55,757 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 211 transitions. [2020-07-29 01:18:55,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:55,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:55,758 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 207 states. [2020-07-29 01:18:55,759 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 207 states. [2020-07-29 01:18:55,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:55,766 INFO L93 Difference]: Finished difference Result 207 states and 211 transitions. [2020-07-29 01:18:55,767 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 211 transitions. [2020-07-29 01:18:55,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:55,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:55,768 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:18:55,768 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:18:55,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-07-29 01:18:55,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 167 transitions. [2020-07-29 01:18:55,773 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 167 transitions. Word has length 13 [2020-07-29 01:18:55,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:18:55,774 INFO L479 AbstractCegarLoop]: Abstraction has 152 states and 167 transitions. [2020-07-29 01:18:55,774 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 01:18:55,774 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 167 transitions. [2020-07-29 01:18:55,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-29 01:18:55,775 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:18:55,775 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:18:55,775 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-29 01:18:55,776 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr63ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr54ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:18:55,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:18:55,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1294261111, now seen corresponding path program 1 times [2020-07-29 01:18:55,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:18:55,777 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292990997] [2020-07-29 01:18:55,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:18:55,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:55,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:18:55,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:55,892 INFO L280 TraceCheckUtils]: 0: Hoare triple {2683#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2675#true} is VALID [2020-07-29 01:18:55,892 INFO L280 TraceCheckUtils]: 1: Hoare triple {2675#true} assume true; {2675#true} is VALID [2020-07-29 01:18:55,893 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2675#true} {2675#true} #251#return; {2675#true} is VALID [2020-07-29 01:18:55,894 INFO L263 TraceCheckUtils]: 0: Hoare triple {2675#true} call ULTIMATE.init(); {2683#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:18:55,894 INFO L280 TraceCheckUtils]: 1: Hoare triple {2683#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2675#true} is VALID [2020-07-29 01:18:55,895 INFO L280 TraceCheckUtils]: 2: Hoare triple {2675#true} assume true; {2675#true} is VALID [2020-07-29 01:18:55,895 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2675#true} {2675#true} #251#return; {2675#true} is VALID [2020-07-29 01:18:55,895 INFO L263 TraceCheckUtils]: 4: Hoare triple {2675#true} call #t~ret18 := main(); {2675#true} is VALID [2020-07-29 01:18:55,896 INFO L280 TraceCheckUtils]: 5: Hoare triple {2675#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {2675#true} is VALID [2020-07-29 01:18:55,896 INFO L280 TraceCheckUtils]: 6: Hoare triple {2675#true} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); srcloc: L994 {2675#true} is VALID [2020-07-29 01:18:55,896 INFO L280 TraceCheckUtils]: 7: Hoare triple {2675#true} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L994-1 {2675#true} is VALID [2020-07-29 01:18:55,896 INFO L280 TraceCheckUtils]: 8: Hoare triple {2675#true} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L995 {2675#true} is VALID [2020-07-29 01:18:55,897 INFO L280 TraceCheckUtils]: 9: Hoare triple {2675#true} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {2675#true} is VALID [2020-07-29 01:18:55,897 INFO L280 TraceCheckUtils]: 10: Hoare triple {2675#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2675#true} is VALID [2020-07-29 01:18:55,898 INFO L280 TraceCheckUtils]: 11: Hoare triple {2675#true} assume !!(0 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12); {2680#(= (select |#valid| |main_#t~malloc2.base|) 1)} is VALID [2020-07-29 01:18:55,900 INFO L280 TraceCheckUtils]: 12: Hoare triple {2680#(= (select |#valid| |main_#t~malloc2.base|) 1)} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L1004 {2681#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-29 01:18:55,901 INFO L280 TraceCheckUtils]: 13: Hoare triple {2681#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1004-1 {2682#(= 1 (select |#valid| |main_#t~mem3.base|))} is VALID [2020-07-29 01:18:55,902 INFO L280 TraceCheckUtils]: 14: Hoare triple {2682#(= 1 (select |#valid| |main_#t~mem3.base|))} assume !(1 == #valid[#t~mem3.base]); {2676#false} is VALID [2020-07-29 01:18:55,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:18:55,903 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292990997] [2020-07-29 01:18:55,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:18:55,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 01:18:55,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291176214] [2020-07-29 01:18:55,904 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-07-29 01:18:55,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:18:55,905 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:18:55,928 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:55,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-29 01:18:55,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:18:55,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:18:55,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:18:55,929 INFO L87 Difference]: Start difference. First operand 152 states and 167 transitions. Second operand 6 states. [2020-07-29 01:18:57,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:57,204 INFO L93 Difference]: Finished difference Result 221 states and 238 transitions. [2020-07-29 01:18:57,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:18:57,205 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-07-29 01:18:57,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:18:57,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:18:57,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 189 transitions. [2020-07-29 01:18:57,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:18:57,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 189 transitions. [2020-07-29 01:18:57,213 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 189 transitions. [2020-07-29 01:18:57,420 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:57,425 INFO L225 Difference]: With dead ends: 221 [2020-07-29 01:18:57,426 INFO L226 Difference]: Without dead ends: 221 [2020-07-29 01:18:57,426 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-29 01:18:57,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2020-07-29 01:18:57,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 151. [2020-07-29 01:18:57,435 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:18:57,435 INFO L82 GeneralOperation]: Start isEquivalent. First operand 221 states. Second operand 151 states. [2020-07-29 01:18:57,436 INFO L74 IsIncluded]: Start isIncluded. First operand 221 states. Second operand 151 states. [2020-07-29 01:18:57,436 INFO L87 Difference]: Start difference. First operand 221 states. Second operand 151 states. [2020-07-29 01:18:57,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:57,443 INFO L93 Difference]: Finished difference Result 221 states and 238 transitions. [2020-07-29 01:18:57,443 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 238 transitions. [2020-07-29 01:18:57,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:57,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:57,444 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand 221 states. [2020-07-29 01:18:57,444 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 221 states. [2020-07-29 01:18:57,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:57,452 INFO L93 Difference]: Finished difference Result 221 states and 238 transitions. [2020-07-29 01:18:57,452 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 238 transitions. [2020-07-29 01:18:57,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:57,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:57,453 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:18:57,453 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:18:57,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-07-29 01:18:57,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 165 transitions. [2020-07-29 01:18:57,459 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 165 transitions. Word has length 15 [2020-07-29 01:18:57,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:18:57,459 INFO L479 AbstractCegarLoop]: Abstraction has 151 states and 165 transitions. [2020-07-29 01:18:57,459 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-29 01:18:57,459 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 165 transitions. [2020-07-29 01:18:57,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-29 01:18:57,460 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:18:57,460 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:18:57,461 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-29 01:18:57,461 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr63ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr54ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:18:57,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:18:57,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1294261110, now seen corresponding path program 1 times [2020-07-29 01:18:57,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:18:57,462 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461668321] [2020-07-29 01:18:57,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:18:57,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:57,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:18:57,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:57,564 INFO L280 TraceCheckUtils]: 0: Hoare triple {3512#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3504#true} is VALID [2020-07-29 01:18:57,565 INFO L280 TraceCheckUtils]: 1: Hoare triple {3504#true} assume true; {3504#true} is VALID [2020-07-29 01:18:57,565 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3504#true} {3504#true} #251#return; {3504#true} is VALID [2020-07-29 01:18:57,566 INFO L263 TraceCheckUtils]: 0: Hoare triple {3504#true} call ULTIMATE.init(); {3512#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:18:57,567 INFO L280 TraceCheckUtils]: 1: Hoare triple {3512#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3504#true} is VALID [2020-07-29 01:18:57,567 INFO L280 TraceCheckUtils]: 2: Hoare triple {3504#true} assume true; {3504#true} is VALID [2020-07-29 01:18:57,568 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3504#true} {3504#true} #251#return; {3504#true} is VALID [2020-07-29 01:18:57,568 INFO L263 TraceCheckUtils]: 4: Hoare triple {3504#true} call #t~ret18 := main(); {3504#true} is VALID [2020-07-29 01:18:57,568 INFO L280 TraceCheckUtils]: 5: Hoare triple {3504#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {3504#true} is VALID [2020-07-29 01:18:57,569 INFO L280 TraceCheckUtils]: 6: Hoare triple {3504#true} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); srcloc: L994 {3504#true} is VALID [2020-07-29 01:18:57,569 INFO L280 TraceCheckUtils]: 7: Hoare triple {3504#true} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L994-1 {3504#true} is VALID [2020-07-29 01:18:57,570 INFO L280 TraceCheckUtils]: 8: Hoare triple {3504#true} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L995 {3504#true} is VALID [2020-07-29 01:18:57,570 INFO L280 TraceCheckUtils]: 9: Hoare triple {3504#true} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {3504#true} is VALID [2020-07-29 01:18:57,570 INFO L280 TraceCheckUtils]: 10: Hoare triple {3504#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3504#true} is VALID [2020-07-29 01:18:57,574 INFO L280 TraceCheckUtils]: 11: Hoare triple {3504#true} assume !!(0 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12); {3509#(and (= 12 (select |#length| |main_#t~malloc2.base|)) (= 0 |main_#t~malloc2.offset|))} is VALID [2020-07-29 01:18:57,578 INFO L280 TraceCheckUtils]: 12: Hoare triple {3509#(and (= 12 (select |#length| |main_#t~malloc2.base|)) (= 0 |main_#t~malloc2.offset|))} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L1004 {3510#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} is VALID [2020-07-29 01:18:57,580 INFO L280 TraceCheckUtils]: 13: Hoare triple {3510#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1004-1 {3511#(and (= 12 (select |#length| |main_#t~mem3.base|)) (= 0 |main_#t~mem3.offset|))} is VALID [2020-07-29 01:18:57,581 INFO L280 TraceCheckUtils]: 14: Hoare triple {3511#(and (= 12 (select |#length| |main_#t~mem3.base|)) (= 0 |main_#t~mem3.offset|))} assume !(4 + (4 + #t~mem3.offset) <= #length[#t~mem3.base] && 0 <= 4 + #t~mem3.offset); {3505#false} is VALID [2020-07-29 01:18:57,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:18:57,582 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461668321] [2020-07-29 01:18:57,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:18:57,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 01:18:57,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977690337] [2020-07-29 01:18:57,583 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-07-29 01:18:57,584 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:18:57,584 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:18:57,602 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:57,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-29 01:18:57,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:18:57,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:18:57,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:18:57,603 INFO L87 Difference]: Start difference. First operand 151 states and 165 transitions. Second operand 6 states. [2020-07-29 01:18:59,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:59,202 INFO L93 Difference]: Finished difference Result 247 states and 267 transitions. [2020-07-29 01:18:59,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 01:18:59,202 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-07-29 01:18:59,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:18:59,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:18:59,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 201 transitions. [2020-07-29 01:18:59,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:18:59,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 201 transitions. [2020-07-29 01:18:59,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 201 transitions. [2020-07-29 01:18:59,430 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 201 edges. 201 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:59,436 INFO L225 Difference]: With dead ends: 247 [2020-07-29 01:18:59,436 INFO L226 Difference]: Without dead ends: 247 [2020-07-29 01:18:59,437 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:18:59,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2020-07-29 01:18:59,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 150. [2020-07-29 01:18:59,456 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:18:59,456 INFO L82 GeneralOperation]: Start isEquivalent. First operand 247 states. Second operand 150 states. [2020-07-29 01:18:59,457 INFO L74 IsIncluded]: Start isIncluded. First operand 247 states. Second operand 150 states. [2020-07-29 01:18:59,457 INFO L87 Difference]: Start difference. First operand 247 states. Second operand 150 states. [2020-07-29 01:18:59,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:59,470 INFO L93 Difference]: Finished difference Result 247 states and 267 transitions. [2020-07-29 01:18:59,470 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 267 transitions. [2020-07-29 01:18:59,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:59,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:59,471 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand 247 states. [2020-07-29 01:18:59,472 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 247 states. [2020-07-29 01:18:59,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:18:59,480 INFO L93 Difference]: Finished difference Result 247 states and 267 transitions. [2020-07-29 01:18:59,480 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 267 transitions. [2020-07-29 01:18:59,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:18:59,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:18:59,482 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:18:59,482 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:18:59,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-07-29 01:18:59,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 163 transitions. [2020-07-29 01:18:59,487 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 163 transitions. Word has length 15 [2020-07-29 01:18:59,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:18:59,487 INFO L479 AbstractCegarLoop]: Abstraction has 150 states and 163 transitions. [2020-07-29 01:18:59,487 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-29 01:18:59,488 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 163 transitions. [2020-07-29 01:18:59,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-29 01:18:59,488 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:18:59,489 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:18:59,489 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-29 01:18:59,489 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr63ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr54ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:18:59,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:18:59,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1734591538, now seen corresponding path program 1 times [2020-07-29 01:18:59,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:18:59,490 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577067991] [2020-07-29 01:18:59,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:18:59,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:59,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:18:59,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:18:59,565 INFO L280 TraceCheckUtils]: 0: Hoare triple {4420#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4412#true} is VALID [2020-07-29 01:18:59,565 INFO L280 TraceCheckUtils]: 1: Hoare triple {4412#true} assume true; {4412#true} is VALID [2020-07-29 01:18:59,565 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4412#true} {4412#true} #251#return; {4412#true} is VALID [2020-07-29 01:18:59,566 INFO L263 TraceCheckUtils]: 0: Hoare triple {4412#true} call ULTIMATE.init(); {4420#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:18:59,567 INFO L280 TraceCheckUtils]: 1: Hoare triple {4420#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4412#true} is VALID [2020-07-29 01:18:59,567 INFO L280 TraceCheckUtils]: 2: Hoare triple {4412#true} assume true; {4412#true} is VALID [2020-07-29 01:18:59,567 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4412#true} {4412#true} #251#return; {4412#true} is VALID [2020-07-29 01:18:59,568 INFO L263 TraceCheckUtils]: 4: Hoare triple {4412#true} call #t~ret18 := main(); {4412#true} is VALID [2020-07-29 01:18:59,568 INFO L280 TraceCheckUtils]: 5: Hoare triple {4412#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {4412#true} is VALID [2020-07-29 01:18:59,568 INFO L280 TraceCheckUtils]: 6: Hoare triple {4412#true} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); srcloc: L994 {4412#true} is VALID [2020-07-29 01:18:59,568 INFO L280 TraceCheckUtils]: 7: Hoare triple {4412#true} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L994-1 {4412#true} is VALID [2020-07-29 01:18:59,569 INFO L280 TraceCheckUtils]: 8: Hoare triple {4412#true} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L995 {4412#true} is VALID [2020-07-29 01:18:59,569 INFO L280 TraceCheckUtils]: 9: Hoare triple {4412#true} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {4412#true} is VALID [2020-07-29 01:18:59,569 INFO L280 TraceCheckUtils]: 10: Hoare triple {4412#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {4412#true} is VALID [2020-07-29 01:18:59,569 INFO L280 TraceCheckUtils]: 11: Hoare triple {4412#true} assume !(0 != #t~nondet1);havoc #t~nondet1; {4412#true} is VALID [2020-07-29 01:18:59,570 INFO L280 TraceCheckUtils]: 12: Hoare triple {4412#true} SUMMARY for call write~int(1, ~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1001-3 {4412#true} is VALID [2020-07-29 01:18:59,571 INFO L280 TraceCheckUtils]: 13: Hoare triple {4412#true} call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(12); {4417#(= 1 (select |#valid| |main_#t~malloc5.base|))} is VALID [2020-07-29 01:18:59,573 INFO L280 TraceCheckUtils]: 14: Hoare triple {4417#(= 1 (select |#valid| |main_#t~malloc5.base|))} SUMMARY for call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L1011 {4418#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-29 01:18:59,574 INFO L280 TraceCheckUtils]: 15: Hoare triple {4418#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1011-1 {4419#(= 1 (select |#valid| |main_#t~mem6.base|))} is VALID [2020-07-29 01:18:59,574 INFO L280 TraceCheckUtils]: 16: Hoare triple {4419#(= 1 (select |#valid| |main_#t~mem6.base|))} assume !(1 == #valid[#t~mem6.base]); {4413#false} is VALID [2020-07-29 01:18:59,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:18:59,575 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577067991] [2020-07-29 01:18:59,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:18:59,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 01:18:59,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167831596] [2020-07-29 01:18:59,576 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-07-29 01:18:59,577 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:18:59,577 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:18:59,595 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:18:59,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-29 01:18:59,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:18:59,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:18:59,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:18:59,596 INFO L87 Difference]: Start difference. First operand 150 states and 163 transitions. Second operand 6 states. [2020-07-29 01:19:00,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:00,396 INFO L93 Difference]: Finished difference Result 157 states and 165 transitions. [2020-07-29 01:19:00,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:19:00,396 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-07-29 01:19:00,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:00,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:19:00,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 136 transitions. [2020-07-29 01:19:00,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:19:00,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 136 transitions. [2020-07-29 01:19:00,402 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 136 transitions. [2020-07-29 01:19:00,570 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:00,574 INFO L225 Difference]: With dead ends: 157 [2020-07-29 01:19:00,574 INFO L226 Difference]: Without dead ends: 157 [2020-07-29 01:19:00,575 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-29 01:19:00,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-07-29 01:19:00,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 149. [2020-07-29 01:19:00,579 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:00,580 INFO L82 GeneralOperation]: Start isEquivalent. First operand 157 states. Second operand 149 states. [2020-07-29 01:19:00,580 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand 149 states. [2020-07-29 01:19:00,580 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 149 states. [2020-07-29 01:19:00,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:00,585 INFO L93 Difference]: Finished difference Result 157 states and 165 transitions. [2020-07-29 01:19:00,585 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 165 transitions. [2020-07-29 01:19:00,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:00,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:00,586 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand 157 states. [2020-07-29 01:19:00,586 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 157 states. [2020-07-29 01:19:00,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:00,592 INFO L93 Difference]: Finished difference Result 157 states and 165 transitions. [2020-07-29 01:19:00,592 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 165 transitions. [2020-07-29 01:19:00,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:00,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:00,595 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:00,595 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:00,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-07-29 01:19:00,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 161 transitions. [2020-07-29 01:19:00,609 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 161 transitions. Word has length 17 [2020-07-29 01:19:00,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:00,609 INFO L479 AbstractCegarLoop]: Abstraction has 149 states and 161 transitions. [2020-07-29 01:19:00,611 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-29 01:19:00,612 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 161 transitions. [2020-07-29 01:19:00,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-29 01:19:00,612 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:00,612 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:19:00,613 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-29 01:19:00,613 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr63ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr54ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:19:00,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:00,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1734591539, now seen corresponding path program 1 times [2020-07-29 01:19:00,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:00,615 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342607457] [2020-07-29 01:19:00,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:00,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:00,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:00,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:00,761 INFO L280 TraceCheckUtils]: 0: Hoare triple {5055#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {5047#true} is VALID [2020-07-29 01:19:00,762 INFO L280 TraceCheckUtils]: 1: Hoare triple {5047#true} assume true; {5047#true} is VALID [2020-07-29 01:19:00,762 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5047#true} {5047#true} #251#return; {5047#true} is VALID [2020-07-29 01:19:00,763 INFO L263 TraceCheckUtils]: 0: Hoare triple {5047#true} call ULTIMATE.init(); {5055#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:00,763 INFO L280 TraceCheckUtils]: 1: Hoare triple {5055#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {5047#true} is VALID [2020-07-29 01:19:00,763 INFO L280 TraceCheckUtils]: 2: Hoare triple {5047#true} assume true; {5047#true} is VALID [2020-07-29 01:19:00,763 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5047#true} {5047#true} #251#return; {5047#true} is VALID [2020-07-29 01:19:00,764 INFO L263 TraceCheckUtils]: 4: Hoare triple {5047#true} call #t~ret18 := main(); {5047#true} is VALID [2020-07-29 01:19:00,764 INFO L280 TraceCheckUtils]: 5: Hoare triple {5047#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {5047#true} is VALID [2020-07-29 01:19:00,765 INFO L280 TraceCheckUtils]: 6: Hoare triple {5047#true} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); srcloc: L994 {5047#true} is VALID [2020-07-29 01:19:00,765 INFO L280 TraceCheckUtils]: 7: Hoare triple {5047#true} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L994-1 {5047#true} is VALID [2020-07-29 01:19:00,765 INFO L280 TraceCheckUtils]: 8: Hoare triple {5047#true} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L995 {5047#true} is VALID [2020-07-29 01:19:00,765 INFO L280 TraceCheckUtils]: 9: Hoare triple {5047#true} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {5047#true} is VALID [2020-07-29 01:19:00,766 INFO L280 TraceCheckUtils]: 10: Hoare triple {5047#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {5047#true} is VALID [2020-07-29 01:19:00,766 INFO L280 TraceCheckUtils]: 11: Hoare triple {5047#true} assume !(0 != #t~nondet1);havoc #t~nondet1; {5047#true} is VALID [2020-07-29 01:19:00,766 INFO L280 TraceCheckUtils]: 12: Hoare triple {5047#true} SUMMARY for call write~int(1, ~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1001-3 {5047#true} is VALID [2020-07-29 01:19:00,773 INFO L280 TraceCheckUtils]: 13: Hoare triple {5047#true} call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(12); {5052#(and (= 0 |main_#t~malloc5.offset|) (= 12 (select |#length| |main_#t~malloc5.base|)))} is VALID [2020-07-29 01:19:00,775 INFO L280 TraceCheckUtils]: 14: Hoare triple {5052#(and (= 0 |main_#t~malloc5.offset|) (= 12 (select |#length| |main_#t~malloc5.base|)))} SUMMARY for call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L1011 {5053#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} is VALID [2020-07-29 01:19:00,776 INFO L280 TraceCheckUtils]: 15: Hoare triple {5053#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1011-1 {5054#(and (= 0 |main_#t~mem6.offset|) (= 12 (select |#length| |main_#t~mem6.base|)))} is VALID [2020-07-29 01:19:00,777 INFO L280 TraceCheckUtils]: 16: Hoare triple {5054#(and (= 0 |main_#t~mem6.offset|) (= 12 (select |#length| |main_#t~mem6.base|)))} assume !(4 + (4 + #t~mem6.offset) <= #length[#t~mem6.base] && 0 <= 4 + #t~mem6.offset); {5048#false} is VALID [2020-07-29 01:19:00,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:19:00,779 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342607457] [2020-07-29 01:19:00,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:00,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 01:19:00,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835637573] [2020-07-29 01:19:00,780 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-07-29 01:19:00,780 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:00,780 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:19:00,803 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:00,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-29 01:19:00,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:00,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:19:00,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:19:00,804 INFO L87 Difference]: Start difference. First operand 149 states and 161 transitions. Second operand 6 states. [2020-07-29 01:19:01,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:01,718 INFO L93 Difference]: Finished difference Result 148 states and 159 transitions. [2020-07-29 01:19:01,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 01:19:01,718 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-07-29 01:19:01,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:01,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:19:01,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2020-07-29 01:19:01,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:19:01,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2020-07-29 01:19:01,721 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 114 transitions. [2020-07-29 01:19:01,868 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:01,871 INFO L225 Difference]: With dead ends: 148 [2020-07-29 01:19:01,871 INFO L226 Difference]: Without dead ends: 148 [2020-07-29 01:19:01,872 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:19:01,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-07-29 01:19:01,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2020-07-29 01:19:01,876 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:01,876 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand 148 states. [2020-07-29 01:19:01,876 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand 148 states. [2020-07-29 01:19:01,876 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 148 states. [2020-07-29 01:19:01,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:01,880 INFO L93 Difference]: Finished difference Result 148 states and 159 transitions. [2020-07-29 01:19:01,880 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 159 transitions. [2020-07-29 01:19:01,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:01,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:01,881 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand 148 states. [2020-07-29 01:19:01,881 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 148 states. [2020-07-29 01:19:01,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:01,885 INFO L93 Difference]: Finished difference Result 148 states and 159 transitions. [2020-07-29 01:19:01,885 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 159 transitions. [2020-07-29 01:19:01,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:01,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:01,886 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:01,887 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:01,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-07-29 01:19:01,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 159 transitions. [2020-07-29 01:19:01,890 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 159 transitions. Word has length 17 [2020-07-29 01:19:01,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:01,891 INFO L479 AbstractCegarLoop]: Abstraction has 148 states and 159 transitions. [2020-07-29 01:19:01,891 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-29 01:19:01,891 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 159 transitions. [2020-07-29 01:19:01,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-29 01:19:01,892 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:01,892 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:19:01,892 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-29 01:19:01,892 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr63ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr54ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:19:01,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:01,893 INFO L82 PathProgramCache]: Analyzing trace with hash -801854261, now seen corresponding path program 1 times [2020-07-29 01:19:01,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:01,893 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488239385] [2020-07-29 01:19:01,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:01,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:02,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:02,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:02,085 INFO L280 TraceCheckUtils]: 0: Hoare triple {5668#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {5656#true} is VALID [2020-07-29 01:19:02,085 INFO L280 TraceCheckUtils]: 1: Hoare triple {5656#true} assume true; {5656#true} is VALID [2020-07-29 01:19:02,085 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5656#true} {5656#true} #251#return; {5656#true} is VALID [2020-07-29 01:19:02,086 INFO L263 TraceCheckUtils]: 0: Hoare triple {5656#true} call ULTIMATE.init(); {5668#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:02,087 INFO L280 TraceCheckUtils]: 1: Hoare triple {5668#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {5656#true} is VALID [2020-07-29 01:19:02,087 INFO L280 TraceCheckUtils]: 2: Hoare triple {5656#true} assume true; {5656#true} is VALID [2020-07-29 01:19:02,087 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5656#true} {5656#true} #251#return; {5656#true} is VALID [2020-07-29 01:19:02,087 INFO L263 TraceCheckUtils]: 4: Hoare triple {5656#true} call #t~ret18 := main(); {5656#true} is VALID [2020-07-29 01:19:02,088 INFO L280 TraceCheckUtils]: 5: Hoare triple {5656#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {5656#true} is VALID [2020-07-29 01:19:02,088 INFO L280 TraceCheckUtils]: 6: Hoare triple {5656#true} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); srcloc: L994 {5661#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-29 01:19:02,089 INFO L280 TraceCheckUtils]: 7: Hoare triple {5661#(= 1 (select |#valid| main_~head~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L994-1 {5661#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-29 01:19:02,089 INFO L280 TraceCheckUtils]: 8: Hoare triple {5661#(= 1 (select |#valid| main_~head~0.base))} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L995 {5661#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-29 01:19:02,090 INFO L280 TraceCheckUtils]: 9: Hoare triple {5661#(= 1 (select |#valid| main_~head~0.base))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {5662#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-29 01:19:02,091 INFO L280 TraceCheckUtils]: 10: Hoare triple {5662#(= 1 (select |#valid| main_~x~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {5662#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-29 01:19:02,094 INFO L280 TraceCheckUtils]: 11: Hoare triple {5662#(= 1 (select |#valid| main_~x~0.base))} assume !!(0 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12); {5663#(and (= (select |#valid| |main_#t~malloc2.base|) 1) (not (= |main_#t~malloc2.base| main_~x~0.base)))} is VALID [2020-07-29 01:19:02,096 INFO L280 TraceCheckUtils]: 12: Hoare triple {5663#(and (= (select |#valid| |main_#t~malloc2.base|) 1) (not (= |main_#t~malloc2.base| main_~x~0.base)))} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L1004 {5664#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} is VALID [2020-07-29 01:19:02,097 INFO L280 TraceCheckUtils]: 13: Hoare triple {5664#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1004-1 {5665#(and (not (= |main_#t~mem3.base| main_~x~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} is VALID [2020-07-29 01:19:02,103 INFO L280 TraceCheckUtils]: 14: Hoare triple {5665#(and (not (= |main_#t~mem3.base| main_~x~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} SUMMARY for call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem3.base, 4 + #t~mem3.offset, 4); srcloc: L1005 {5666#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-29 01:19:02,104 INFO L280 TraceCheckUtils]: 15: Hoare triple {5666#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} havoc #t~mem3.base, #t~mem3.offset; {5666#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-29 01:19:02,105 INFO L280 TraceCheckUtils]: 16: Hoare triple {5666#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} SUMMARY for call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1006 {5667#(= 1 (select |#valid| |main_#t~mem4.base|))} is VALID [2020-07-29 01:19:02,106 INFO L280 TraceCheckUtils]: 17: Hoare triple {5667#(= 1 (select |#valid| |main_#t~mem4.base|))} ~x~0.base, ~x~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset; {5662#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-29 01:19:02,106 INFO L280 TraceCheckUtils]: 18: Hoare triple {5662#(= 1 (select |#valid| main_~x~0.base))} assume !(1 == #valid[~x~0.base]); {5657#false} is VALID [2020-07-29 01:19:02,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:19:02,108 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488239385] [2020-07-29 01:19:02,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:02,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-29 01:19:02,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708353360] [2020-07-29 01:19:02,109 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2020-07-29 01:19:02,110 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:02,110 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-29 01:19:02,139 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:02,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-29 01:19:02,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:02,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-29 01:19:02,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:19:02,140 INFO L87 Difference]: Start difference. First operand 148 states and 159 transitions. Second operand 10 states. [2020-07-29 01:19:03,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:03,846 INFO L93 Difference]: Finished difference Result 152 states and 159 transitions. [2020-07-29 01:19:03,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-29 01:19:03,846 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2020-07-29 01:19:03,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:03,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:19:03,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2020-07-29 01:19:03,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:19:03,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2020-07-29 01:19:03,851 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 129 transitions. [2020-07-29 01:19:04,026 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:04,029 INFO L225 Difference]: With dead ends: 152 [2020-07-29 01:19:04,029 INFO L226 Difference]: Without dead ends: 152 [2020-07-29 01:19:04,030 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2020-07-29 01:19:04,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-07-29 01:19:04,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 147. [2020-07-29 01:19:04,039 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:04,039 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand 147 states. [2020-07-29 01:19:04,039 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 147 states. [2020-07-29 01:19:04,039 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 147 states. [2020-07-29 01:19:04,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:04,043 INFO L93 Difference]: Finished difference Result 152 states and 159 transitions. [2020-07-29 01:19:04,043 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 159 transitions. [2020-07-29 01:19:04,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:04,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:04,044 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand 152 states. [2020-07-29 01:19:04,045 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 152 states. [2020-07-29 01:19:04,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:04,049 INFO L93 Difference]: Finished difference Result 152 states and 159 transitions. [2020-07-29 01:19:04,049 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 159 transitions. [2020-07-29 01:19:04,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:04,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:04,050 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:04,051 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:04,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-07-29 01:19:04,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 158 transitions. [2020-07-29 01:19:04,054 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 158 transitions. Word has length 19 [2020-07-29 01:19:04,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:04,055 INFO L479 AbstractCegarLoop]: Abstraction has 147 states and 158 transitions. [2020-07-29 01:19:04,055 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-29 01:19:04,055 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 158 transitions. [2020-07-29 01:19:04,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-29 01:19:04,056 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:04,056 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:19:04,056 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-29 01:19:04,057 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr63ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr54ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:19:04,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:04,058 INFO L82 PathProgramCache]: Analyzing trace with hash -801854260, now seen corresponding path program 1 times [2020-07-29 01:19:04,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:04,059 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276108004] [2020-07-29 01:19:04,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:04,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:04,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:04,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:04,316 INFO L280 TraceCheckUtils]: 0: Hoare triple {6297#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {6284#true} is VALID [2020-07-29 01:19:04,316 INFO L280 TraceCheckUtils]: 1: Hoare triple {6284#true} assume true; {6284#true} is VALID [2020-07-29 01:19:04,317 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {6284#true} {6284#true} #251#return; {6284#true} is VALID [2020-07-29 01:19:04,318 INFO L263 TraceCheckUtils]: 0: Hoare triple {6284#true} call ULTIMATE.init(); {6297#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:04,318 INFO L280 TraceCheckUtils]: 1: Hoare triple {6297#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {6284#true} is VALID [2020-07-29 01:19:04,318 INFO L280 TraceCheckUtils]: 2: Hoare triple {6284#true} assume true; {6284#true} is VALID [2020-07-29 01:19:04,318 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6284#true} {6284#true} #251#return; {6284#true} is VALID [2020-07-29 01:19:04,319 INFO L263 TraceCheckUtils]: 4: Hoare triple {6284#true} call #t~ret18 := main(); {6284#true} is VALID [2020-07-29 01:19:04,319 INFO L280 TraceCheckUtils]: 5: Hoare triple {6284#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {6284#true} is VALID [2020-07-29 01:19:04,320 INFO L280 TraceCheckUtils]: 6: Hoare triple {6284#true} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); srcloc: L994 {6289#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-29 01:19:04,321 INFO L280 TraceCheckUtils]: 7: Hoare triple {6289#(= 1 (select |#valid| main_~head~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L994-1 {6289#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-29 01:19:04,326 INFO L280 TraceCheckUtils]: 8: Hoare triple {6289#(= 1 (select |#valid| main_~head~0.base))} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L995 {6289#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-29 01:19:04,327 INFO L280 TraceCheckUtils]: 9: Hoare triple {6289#(= 1 (select |#valid| main_~head~0.base))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {6290#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-29 01:19:04,327 INFO L280 TraceCheckUtils]: 10: Hoare triple {6290#(= 1 (select |#valid| main_~x~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {6290#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-29 01:19:04,329 INFO L280 TraceCheckUtils]: 11: Hoare triple {6290#(= 1 (select |#valid| main_~x~0.base))} assume !!(0 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12); {6291#(and (= 12 (select |#length| |main_#t~malloc2.base|)) (= 0 |main_#t~malloc2.offset|) (not (= |main_#t~malloc2.base| main_~x~0.base)))} is VALID [2020-07-29 01:19:04,331 INFO L280 TraceCheckUtils]: 12: Hoare triple {6291#(and (= 12 (select |#length| |main_#t~malloc2.base|)) (= 0 |main_#t~malloc2.offset|) (not (= |main_#t~malloc2.base| main_~x~0.base)))} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L1004 {6292#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} is VALID [2020-07-29 01:19:04,332 INFO L280 TraceCheckUtils]: 13: Hoare triple {6292#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1004-1 {6293#(and (not (= |main_#t~mem3.base| main_~x~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} is VALID [2020-07-29 01:19:04,334 INFO L280 TraceCheckUtils]: 14: Hoare triple {6293#(and (not (= |main_#t~mem3.base| main_~x~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} SUMMARY for call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem3.base, 4 + #t~mem3.offset, 4); srcloc: L1005 {6294#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} is VALID [2020-07-29 01:19:04,335 INFO L280 TraceCheckUtils]: 15: Hoare triple {6294#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} havoc #t~mem3.base, #t~mem3.offset; {6294#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} is VALID [2020-07-29 01:19:04,337 INFO L280 TraceCheckUtils]: 16: Hoare triple {6294#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} SUMMARY for call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1006 {6295#(and (= 12 (select |#length| |main_#t~mem4.base|)) (= 0 |main_#t~mem4.offset|))} is VALID [2020-07-29 01:19:04,337 INFO L280 TraceCheckUtils]: 17: Hoare triple {6295#(and (= 12 (select |#length| |main_#t~mem4.base|)) (= 0 |main_#t~mem4.offset|))} ~x~0.base, ~x~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset; {6296#(and (= 12 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0))} is VALID [2020-07-29 01:19:04,338 INFO L280 TraceCheckUtils]: 18: Hoare triple {6296#(and (= 12 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0))} assume !(4 + (8 + ~x~0.offset) <= #length[~x~0.base] && 0 <= 8 + ~x~0.offset); {6285#false} is VALID [2020-07-29 01:19:04,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:19:04,341 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276108004] [2020-07-29 01:19:04,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:04,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-29 01:19:04,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743850863] [2020-07-29 01:19:04,342 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2020-07-29 01:19:04,342 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:04,342 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-29 01:19:04,367 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:04,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-29 01:19:04,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:04,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-29 01:19:04,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-07-29 01:19:04,368 INFO L87 Difference]: Start difference. First operand 147 states and 158 transitions. Second operand 11 states. [2020-07-29 01:19:06,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:06,835 INFO L93 Difference]: Finished difference Result 149 states and 156 transitions. [2020-07-29 01:19:06,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-29 01:19:06,835 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2020-07-29 01:19:06,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:06,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-29 01:19:06,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 148 transitions. [2020-07-29 01:19:06,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-29 01:19:06,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 148 transitions. [2020-07-29 01:19:06,841 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 148 transitions. [2020-07-29 01:19:07,055 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:07,059 INFO L225 Difference]: With dead ends: 149 [2020-07-29 01:19:07,060 INFO L226 Difference]: Without dead ends: 149 [2020-07-29 01:19:07,060 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2020-07-29 01:19:07,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2020-07-29 01:19:07,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 125. [2020-07-29 01:19:07,065 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:07,065 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand 125 states. [2020-07-29 01:19:07,065 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand 125 states. [2020-07-29 01:19:07,065 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 125 states. [2020-07-29 01:19:07,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:07,070 INFO L93 Difference]: Finished difference Result 149 states and 156 transitions. [2020-07-29 01:19:07,070 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 156 transitions. [2020-07-29 01:19:07,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:07,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:07,071 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 149 states. [2020-07-29 01:19:07,071 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 149 states. [2020-07-29 01:19:07,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:07,076 INFO L93 Difference]: Finished difference Result 149 states and 156 transitions. [2020-07-29 01:19:07,076 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 156 transitions. [2020-07-29 01:19:07,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:07,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:07,077 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:07,078 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:07,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-07-29 01:19:07,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions. [2020-07-29 01:19:07,081 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 135 transitions. Word has length 19 [2020-07-29 01:19:07,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:07,084 INFO L479 AbstractCegarLoop]: Abstraction has 125 states and 135 transitions. [2020-07-29 01:19:07,084 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-29 01:19:07,085 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions. [2020-07-29 01:19:07,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-29 01:19:07,085 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:07,086 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:19:07,086 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-29 01:19:07,088 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr63ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr54ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:19:07,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:07,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1829953186, now seen corresponding path program 1 times [2020-07-29 01:19:07,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:07,090 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389874420] [2020-07-29 01:19:07,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:07,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:07,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:07,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:07,325 INFO L280 TraceCheckUtils]: 0: Hoare triple {6906#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {6894#true} is VALID [2020-07-29 01:19:07,325 INFO L280 TraceCheckUtils]: 1: Hoare triple {6894#true} assume true; {6894#true} is VALID [2020-07-29 01:19:07,326 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {6894#true} {6894#true} #251#return; {6894#true} is VALID [2020-07-29 01:19:07,327 INFO L263 TraceCheckUtils]: 0: Hoare triple {6894#true} call ULTIMATE.init(); {6906#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:07,327 INFO L280 TraceCheckUtils]: 1: Hoare triple {6906#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {6894#true} is VALID [2020-07-29 01:19:07,327 INFO L280 TraceCheckUtils]: 2: Hoare triple {6894#true} assume true; {6894#true} is VALID [2020-07-29 01:19:07,328 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6894#true} {6894#true} #251#return; {6894#true} is VALID [2020-07-29 01:19:07,328 INFO L263 TraceCheckUtils]: 4: Hoare triple {6894#true} call #t~ret18 := main(); {6894#true} is VALID [2020-07-29 01:19:07,328 INFO L280 TraceCheckUtils]: 5: Hoare triple {6894#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {6894#true} is VALID [2020-07-29 01:19:07,329 INFO L280 TraceCheckUtils]: 6: Hoare triple {6894#true} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); srcloc: L994 {6899#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-29 01:19:07,330 INFO L280 TraceCheckUtils]: 7: Hoare triple {6899#(= 1 (select |#valid| main_~head~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L994-1 {6899#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-29 01:19:07,330 INFO L280 TraceCheckUtils]: 8: Hoare triple {6899#(= 1 (select |#valid| main_~head~0.base))} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L995 {6899#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-29 01:19:07,331 INFO L280 TraceCheckUtils]: 9: Hoare triple {6899#(= 1 (select |#valid| main_~head~0.base))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {6900#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-29 01:19:07,332 INFO L280 TraceCheckUtils]: 10: Hoare triple {6900#(= 1 (select |#valid| main_~x~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {6900#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-29 01:19:07,332 INFO L280 TraceCheckUtils]: 11: Hoare triple {6900#(= 1 (select |#valid| main_~x~0.base))} assume !(0 != #t~nondet1);havoc #t~nondet1; {6900#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-29 01:19:07,333 INFO L280 TraceCheckUtils]: 12: Hoare triple {6900#(= 1 (select |#valid| main_~x~0.base))} SUMMARY for call write~int(1, ~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1001-3 {6900#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-29 01:19:07,334 INFO L280 TraceCheckUtils]: 13: Hoare triple {6900#(= 1 (select |#valid| main_~x~0.base))} call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(12); {6901#(and (= 0 |main_#t~malloc5.offset|) (= 12 (select |#length| |main_#t~malloc5.base|)) (not (= |main_#t~malloc5.base| main_~x~0.base)))} is VALID [2020-07-29 01:19:07,336 INFO L280 TraceCheckUtils]: 14: Hoare triple {6901#(and (= 0 |main_#t~malloc5.offset|) (= 12 (select |#length| |main_#t~malloc5.base|)) (not (= |main_#t~malloc5.base| main_~x~0.base)))} SUMMARY for call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L1011 {6902#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} is VALID [2020-07-29 01:19:07,338 INFO L280 TraceCheckUtils]: 15: Hoare triple {6902#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1011-1 {6903#(and (not (= |main_#t~mem6.base| main_~x~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} is VALID [2020-07-29 01:19:07,340 INFO L280 TraceCheckUtils]: 16: Hoare triple {6903#(and (not (= |main_#t~mem6.base| main_~x~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} SUMMARY for call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem6.base, 4 + #t~mem6.offset, 4); srcloc: L1012 {6904#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} is VALID [2020-07-29 01:19:07,344 INFO L280 TraceCheckUtils]: 17: Hoare triple {6904#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} havoc #t~mem6.base, #t~mem6.offset; {6904#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} is VALID [2020-07-29 01:19:07,346 INFO L280 TraceCheckUtils]: 18: Hoare triple {6904#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} SUMMARY for call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1013 {6905#(and (= 12 (select |#length| |main_#t~mem7.base|)) (= 0 |main_#t~mem7.offset|))} is VALID [2020-07-29 01:19:07,347 INFO L280 TraceCheckUtils]: 19: Hoare triple {6905#(and (= 12 (select |#length| |main_#t~mem7.base|)) (= 0 |main_#t~mem7.offset|))} assume !(4 + (8 + #t~mem7.offset) <= #length[#t~mem7.base] && 0 <= 8 + #t~mem7.offset); {6895#false} is VALID [2020-07-29 01:19:07,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:19:07,350 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389874420] [2020-07-29 01:19:07,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:07,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-29 01:19:07,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164046657] [2020-07-29 01:19:07,351 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-07-29 01:19:07,351 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:07,352 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-29 01:19:07,379 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:07,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-29 01:19:07,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:07,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-29 01:19:07,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:19:07,380 INFO L87 Difference]: Start difference. First operand 125 states and 135 transitions. Second operand 10 states. [2020-07-29 01:19:08,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:08,982 INFO L93 Difference]: Finished difference Result 129 states and 135 transitions. [2020-07-29 01:19:08,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-29 01:19:08,983 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-07-29 01:19:08,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:08,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:19:08,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 120 transitions. [2020-07-29 01:19:08,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:19:08,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 120 transitions. [2020-07-29 01:19:08,987 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 120 transitions. [2020-07-29 01:19:09,145 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:09,148 INFO L225 Difference]: With dead ends: 129 [2020-07-29 01:19:09,148 INFO L226 Difference]: Without dead ends: 129 [2020-07-29 01:19:09,149 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2020-07-29 01:19:09,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-07-29 01:19:09,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 124. [2020-07-29 01:19:09,153 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:09,153 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand 124 states. [2020-07-29 01:19:09,153 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand 124 states. [2020-07-29 01:19:09,153 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 124 states. [2020-07-29 01:19:09,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:09,160 INFO L93 Difference]: Finished difference Result 129 states and 135 transitions. [2020-07-29 01:19:09,161 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 135 transitions. [2020-07-29 01:19:09,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:09,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:09,162 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand 129 states. [2020-07-29 01:19:09,162 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 129 states. [2020-07-29 01:19:09,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:09,167 INFO L93 Difference]: Finished difference Result 129 states and 135 transitions. [2020-07-29 01:19:09,167 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 135 transitions. [2020-07-29 01:19:09,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:09,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:09,168 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:09,168 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:09,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-07-29 01:19:09,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2020-07-29 01:19:09,172 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 20 [2020-07-29 01:19:09,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:09,172 INFO L479 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2020-07-29 01:19:09,173 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-29 01:19:09,173 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2020-07-29 01:19:09,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-29 01:19:09,173 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:09,174 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:19:09,174 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-29 01:19:09,179 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr63ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr54ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:19:09,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:09,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1829953187, now seen corresponding path program 1 times [2020-07-29 01:19:09,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:09,181 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409882909] [2020-07-29 01:19:09,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:09,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:09,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:09,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:09,363 INFO L280 TraceCheckUtils]: 0: Hoare triple {7444#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {7432#true} is VALID [2020-07-29 01:19:09,363 INFO L280 TraceCheckUtils]: 1: Hoare triple {7432#true} assume true; {7432#true} is VALID [2020-07-29 01:19:09,364 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {7432#true} {7432#true} #251#return; {7432#true} is VALID [2020-07-29 01:19:09,365 INFO L263 TraceCheckUtils]: 0: Hoare triple {7432#true} call ULTIMATE.init(); {7444#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:09,365 INFO L280 TraceCheckUtils]: 1: Hoare triple {7444#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {7432#true} is VALID [2020-07-29 01:19:09,365 INFO L280 TraceCheckUtils]: 2: Hoare triple {7432#true} assume true; {7432#true} is VALID [2020-07-29 01:19:09,366 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7432#true} {7432#true} #251#return; {7432#true} is VALID [2020-07-29 01:19:09,366 INFO L263 TraceCheckUtils]: 4: Hoare triple {7432#true} call #t~ret18 := main(); {7432#true} is VALID [2020-07-29 01:19:09,366 INFO L280 TraceCheckUtils]: 5: Hoare triple {7432#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {7432#true} is VALID [2020-07-29 01:19:09,372 INFO L280 TraceCheckUtils]: 6: Hoare triple {7432#true} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); srcloc: L994 {7437#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-29 01:19:09,373 INFO L280 TraceCheckUtils]: 7: Hoare triple {7437#(= 1 (select |#valid| main_~head~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L994-1 {7437#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-29 01:19:09,374 INFO L280 TraceCheckUtils]: 8: Hoare triple {7437#(= 1 (select |#valid| main_~head~0.base))} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L995 {7437#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-29 01:19:09,375 INFO L280 TraceCheckUtils]: 9: Hoare triple {7437#(= 1 (select |#valid| main_~head~0.base))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {7438#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-29 01:19:09,375 INFO L280 TraceCheckUtils]: 10: Hoare triple {7438#(= 1 (select |#valid| main_~x~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {7438#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-29 01:19:09,376 INFO L280 TraceCheckUtils]: 11: Hoare triple {7438#(= 1 (select |#valid| main_~x~0.base))} assume !(0 != #t~nondet1);havoc #t~nondet1; {7438#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-29 01:19:09,377 INFO L280 TraceCheckUtils]: 12: Hoare triple {7438#(= 1 (select |#valid| main_~x~0.base))} SUMMARY for call write~int(1, ~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1001-3 {7438#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-29 01:19:09,379 INFO L280 TraceCheckUtils]: 13: Hoare triple {7438#(= 1 (select |#valid| main_~x~0.base))} call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(12); {7439#(and (= 1 (select |#valid| |main_#t~malloc5.base|)) (not (= |main_#t~malloc5.base| main_~x~0.base)))} is VALID [2020-07-29 01:19:09,381 INFO L280 TraceCheckUtils]: 14: Hoare triple {7439#(and (= 1 (select |#valid| |main_#t~malloc5.base|)) (not (= |main_#t~malloc5.base| main_~x~0.base)))} SUMMARY for call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L1011 {7440#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} is VALID [2020-07-29 01:19:09,383 INFO L280 TraceCheckUtils]: 15: Hoare triple {7440#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1011-1 {7441#(and (not (= |main_#t~mem6.base| main_~x~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} is VALID [2020-07-29 01:19:09,384 INFO L280 TraceCheckUtils]: 16: Hoare triple {7441#(and (not (= |main_#t~mem6.base| main_~x~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} SUMMARY for call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem6.base, 4 + #t~mem6.offset, 4); srcloc: L1012 {7442#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-29 01:19:09,385 INFO L280 TraceCheckUtils]: 17: Hoare triple {7442#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} havoc #t~mem6.base, #t~mem6.offset; {7442#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-29 01:19:09,386 INFO L280 TraceCheckUtils]: 18: Hoare triple {7442#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} SUMMARY for call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1013 {7443#(= 1 (select |#valid| |main_#t~mem7.base|))} is VALID [2020-07-29 01:19:09,387 INFO L280 TraceCheckUtils]: 19: Hoare triple {7443#(= 1 (select |#valid| |main_#t~mem7.base|))} assume !(1 == #valid[#t~mem7.base]); {7433#false} is VALID [2020-07-29 01:19:09,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:19:09,389 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409882909] [2020-07-29 01:19:09,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:09,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-29 01:19:09,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261444810] [2020-07-29 01:19:09,390 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-07-29 01:19:09,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:09,390 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-29 01:19:09,416 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:09,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-29 01:19:09,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:09,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-29 01:19:09,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:19:09,418 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 10 states. [2020-07-29 01:19:10,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:10,925 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2020-07-29 01:19:10,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-29 01:19:10,925 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-07-29 01:19:10,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:10,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:19:10,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 119 transitions. [2020-07-29 01:19:10,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:19:10,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 119 transitions. [2020-07-29 01:19:10,929 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 119 transitions. [2020-07-29 01:19:11,095 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:11,098 INFO L225 Difference]: With dead ends: 128 [2020-07-29 01:19:11,098 INFO L226 Difference]: Without dead ends: 128 [2020-07-29 01:19:11,099 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2020-07-29 01:19:11,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-07-29 01:19:11,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 123. [2020-07-29 01:19:11,102 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:11,102 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand 123 states. [2020-07-29 01:19:11,102 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 123 states. [2020-07-29 01:19:11,102 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 123 states. [2020-07-29 01:19:11,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:11,105 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2020-07-29 01:19:11,106 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 134 transitions. [2020-07-29 01:19:11,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:11,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:11,106 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 128 states. [2020-07-29 01:19:11,107 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 128 states. [2020-07-29 01:19:11,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:11,110 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2020-07-29 01:19:11,110 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 134 transitions. [2020-07-29 01:19:11,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:11,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:11,111 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:11,111 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:11,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-07-29 01:19:11,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 133 transitions. [2020-07-29 01:19:11,115 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 133 transitions. Word has length 20 [2020-07-29 01:19:11,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:11,115 INFO L479 AbstractCegarLoop]: Abstraction has 123 states and 133 transitions. [2020-07-29 01:19:11,116 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-29 01:19:11,116 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2020-07-29 01:19:11,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-29 01:19:11,117 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:11,117 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:19:11,117 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-29 01:19:11,117 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr63ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr54ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:19:11,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:11,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1782798357, now seen corresponding path program 1 times [2020-07-29 01:19:11,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:11,119 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697722639] [2020-07-29 01:19:11,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:11,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:11,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:11,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:11,193 INFO L280 TraceCheckUtils]: 0: Hoare triple {7973#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {7971#(= 0 (select |#valid| 0))} is VALID [2020-07-29 01:19:11,195 INFO L280 TraceCheckUtils]: 1: Hoare triple {7971#(= 0 (select |#valid| 0))} assume true; {7971#(= 0 (select |#valid| 0))} is VALID [2020-07-29 01:19:11,196 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {7971#(= 0 (select |#valid| 0))} {7966#true} #251#return; {7971#(= 0 (select |#valid| 0))} is VALID [2020-07-29 01:19:11,197 INFO L263 TraceCheckUtils]: 0: Hoare triple {7966#true} call ULTIMATE.init(); {7973#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:11,198 INFO L280 TraceCheckUtils]: 1: Hoare triple {7973#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {7971#(= 0 (select |#valid| 0))} is VALID [2020-07-29 01:19:11,198 INFO L280 TraceCheckUtils]: 2: Hoare triple {7971#(= 0 (select |#valid| 0))} assume true; {7971#(= 0 (select |#valid| 0))} is VALID [2020-07-29 01:19:11,199 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7971#(= 0 (select |#valid| 0))} {7966#true} #251#return; {7971#(= 0 (select |#valid| 0))} is VALID [2020-07-29 01:19:11,200 INFO L263 TraceCheckUtils]: 4: Hoare triple {7971#(= 0 (select |#valid| 0))} call #t~ret18 := main(); {7971#(= 0 (select |#valid| 0))} is VALID [2020-07-29 01:19:11,201 INFO L280 TraceCheckUtils]: 5: Hoare triple {7971#(= 0 (select |#valid| 0))} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {7971#(= 0 (select |#valid| 0))} is VALID [2020-07-29 01:19:11,201 INFO L280 TraceCheckUtils]: 6: Hoare triple {7971#(= 0 (select |#valid| 0))} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); srcloc: L994 {7971#(= 0 (select |#valid| 0))} is VALID [2020-07-29 01:19:11,202 INFO L280 TraceCheckUtils]: 7: Hoare triple {7971#(= 0 (select |#valid| 0))} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L994-1 {7971#(= 0 (select |#valid| 0))} is VALID [2020-07-29 01:19:11,203 INFO L280 TraceCheckUtils]: 8: Hoare triple {7971#(= 0 (select |#valid| 0))} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L995 {7971#(= 0 (select |#valid| 0))} is VALID [2020-07-29 01:19:11,203 INFO L280 TraceCheckUtils]: 9: Hoare triple {7971#(= 0 (select |#valid| 0))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {7971#(= 0 (select |#valid| 0))} is VALID [2020-07-29 01:19:11,204 INFO L280 TraceCheckUtils]: 10: Hoare triple {7971#(= 0 (select |#valid| 0))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {7971#(= 0 (select |#valid| 0))} is VALID [2020-07-29 01:19:11,205 INFO L280 TraceCheckUtils]: 11: Hoare triple {7971#(= 0 (select |#valid| 0))} assume !!(0 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12); {7971#(= 0 (select |#valid| 0))} is VALID [2020-07-29 01:19:11,206 INFO L280 TraceCheckUtils]: 12: Hoare triple {7971#(= 0 (select |#valid| 0))} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L1004 {7971#(= 0 (select |#valid| 0))} is VALID [2020-07-29 01:19:11,206 INFO L280 TraceCheckUtils]: 13: Hoare triple {7971#(= 0 (select |#valid| 0))} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1004-1 {7971#(= 0 (select |#valid| 0))} is VALID [2020-07-29 01:19:11,207 INFO L280 TraceCheckUtils]: 14: Hoare triple {7971#(= 0 (select |#valid| 0))} SUMMARY for call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem3.base, 4 + #t~mem3.offset, 4); srcloc: L1005 {7971#(= 0 (select |#valid| 0))} is VALID [2020-07-29 01:19:11,208 INFO L280 TraceCheckUtils]: 15: Hoare triple {7971#(= 0 (select |#valid| 0))} havoc #t~mem3.base, #t~mem3.offset; {7971#(= 0 (select |#valid| 0))} is VALID [2020-07-29 01:19:11,208 INFO L280 TraceCheckUtils]: 16: Hoare triple {7971#(= 0 (select |#valid| 0))} SUMMARY for call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1006 {7971#(= 0 (select |#valid| 0))} is VALID [2020-07-29 01:19:11,214 INFO L280 TraceCheckUtils]: 17: Hoare triple {7971#(= 0 (select |#valid| 0))} ~x~0.base, ~x~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset; {7971#(= 0 (select |#valid| 0))} is VALID [2020-07-29 01:19:11,216 INFO L280 TraceCheckUtils]: 18: Hoare triple {7971#(= 0 (select |#valid| 0))} SUMMARY for call write~int(0, ~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1007 {7972#(not (= 0 main_~x~0.base))} is VALID [2020-07-29 01:19:11,216 INFO L280 TraceCheckUtils]: 19: Hoare triple {7972#(not (= 0 main_~x~0.base))} assume !(0 != ~x~0.base || 0 != ~x~0.offset); {7967#false} is VALID [2020-07-29 01:19:11,216 INFO L280 TraceCheckUtils]: 20: Hoare triple {7967#false} assume !false; {7967#false} is VALID [2020-07-29 01:19:11,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:19:11,218 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697722639] [2020-07-29 01:19:11,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:11,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:19:11,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344548182] [2020-07-29 01:19:11,218 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-07-29 01:19:11,219 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:11,219 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:19:11,252 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:11,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 01:19:11,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:11,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:19:11,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:19:11,253 INFO L87 Difference]: Start difference. First operand 123 states and 133 transitions. Second operand 5 states. [2020-07-29 01:19:11,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:11,760 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2020-07-29 01:19:11,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:19:11,760 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-07-29 01:19:11,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:11,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:19:11,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2020-07-29 01:19:11,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:19:11,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2020-07-29 01:19:11,763 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 106 transitions. [2020-07-29 01:19:11,892 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:11,895 INFO L225 Difference]: With dead ends: 125 [2020-07-29 01:19:11,895 INFO L226 Difference]: Without dead ends: 125 [2020-07-29 01:19:11,895 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:19:11,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-07-29 01:19:11,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 121. [2020-07-29 01:19:11,898 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:11,899 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand 121 states. [2020-07-29 01:19:11,899 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 121 states. [2020-07-29 01:19:11,899 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 121 states. [2020-07-29 01:19:11,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:11,902 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2020-07-29 01:19:11,902 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 136 transitions. [2020-07-29 01:19:11,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:11,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:11,903 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 125 states. [2020-07-29 01:19:11,904 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 125 states. [2020-07-29 01:19:11,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:11,907 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2020-07-29 01:19:11,907 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 136 transitions. [2020-07-29 01:19:11,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:11,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:11,908 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:11,909 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:11,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-07-29 01:19:11,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 131 transitions. [2020-07-29 01:19:11,912 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 131 transitions. Word has length 21 [2020-07-29 01:19:11,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:11,912 INFO L479 AbstractCegarLoop]: Abstraction has 121 states and 131 transitions. [2020-07-29 01:19:11,912 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 01:19:11,913 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 131 transitions. [2020-07-29 01:19:11,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-29 01:19:11,913 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:11,913 INFO L422 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] [2020-07-29 01:19:11,914 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-29 01:19:11,914 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr63ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr54ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:19:11,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:11,915 INFO L82 PathProgramCache]: Analyzing trace with hash -115454954, now seen corresponding path program 1 times [2020-07-29 01:19:11,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:11,920 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596392392] [2020-07-29 01:19:11,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:11,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:12,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:12,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:12,009 INFO L280 TraceCheckUtils]: 0: Hoare triple {8483#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {8476#true} is VALID [2020-07-29 01:19:12,010 INFO L280 TraceCheckUtils]: 1: Hoare triple {8476#true} assume true; {8476#true} is VALID [2020-07-29 01:19:12,010 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {8476#true} {8476#true} #251#return; {8476#true} is VALID [2020-07-29 01:19:12,011 INFO L263 TraceCheckUtils]: 0: Hoare triple {8476#true} call ULTIMATE.init(); {8483#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:12,011 INFO L280 TraceCheckUtils]: 1: Hoare triple {8483#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {8476#true} is VALID [2020-07-29 01:19:12,012 INFO L280 TraceCheckUtils]: 2: Hoare triple {8476#true} assume true; {8476#true} is VALID [2020-07-29 01:19:12,012 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8476#true} {8476#true} #251#return; {8476#true} is VALID [2020-07-29 01:19:12,012 INFO L263 TraceCheckUtils]: 4: Hoare triple {8476#true} call #t~ret18 := main(); {8476#true} is VALID [2020-07-29 01:19:12,013 INFO L280 TraceCheckUtils]: 5: Hoare triple {8476#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {8481#(not (= 0 main_~head~0.base))} is VALID [2020-07-29 01:19:12,015 INFO L280 TraceCheckUtils]: 6: Hoare triple {8481#(not (= 0 main_~head~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); srcloc: L994 {8481#(not (= 0 main_~head~0.base))} is VALID [2020-07-29 01:19:12,017 INFO L280 TraceCheckUtils]: 7: Hoare triple {8481#(not (= 0 main_~head~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L994-1 {8481#(not (= 0 main_~head~0.base))} is VALID [2020-07-29 01:19:12,021 INFO L280 TraceCheckUtils]: 8: Hoare triple {8481#(not (= 0 main_~head~0.base))} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L995 {8481#(not (= 0 main_~head~0.base))} is VALID [2020-07-29 01:19:12,022 INFO L280 TraceCheckUtils]: 9: Hoare triple {8481#(not (= 0 main_~head~0.base))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {8481#(not (= 0 main_~head~0.base))} is VALID [2020-07-29 01:19:12,027 INFO L280 TraceCheckUtils]: 10: Hoare triple {8481#(not (= 0 main_~head~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {8481#(not (= 0 main_~head~0.base))} is VALID [2020-07-29 01:19:12,028 INFO L280 TraceCheckUtils]: 11: Hoare triple {8481#(not (= 0 main_~head~0.base))} assume !(0 != #t~nondet1);havoc #t~nondet1; {8481#(not (= 0 main_~head~0.base))} is VALID [2020-07-29 01:19:12,029 INFO L280 TraceCheckUtils]: 12: Hoare triple {8481#(not (= 0 main_~head~0.base))} SUMMARY for call write~int(1, ~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1001-3 {8481#(not (= 0 main_~head~0.base))} is VALID [2020-07-29 01:19:12,029 INFO L280 TraceCheckUtils]: 13: Hoare triple {8481#(not (= 0 main_~head~0.base))} call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(12); {8481#(not (= 0 main_~head~0.base))} is VALID [2020-07-29 01:19:12,030 INFO L280 TraceCheckUtils]: 14: Hoare triple {8481#(not (= 0 main_~head~0.base))} SUMMARY for call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L1011 {8481#(not (= 0 main_~head~0.base))} is VALID [2020-07-29 01:19:12,030 INFO L280 TraceCheckUtils]: 15: Hoare triple {8481#(not (= 0 main_~head~0.base))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1011-1 {8481#(not (= 0 main_~head~0.base))} is VALID [2020-07-29 01:19:12,031 INFO L280 TraceCheckUtils]: 16: Hoare triple {8481#(not (= 0 main_~head~0.base))} SUMMARY for call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem6.base, 4 + #t~mem6.offset, 4); srcloc: L1012 {8481#(not (= 0 main_~head~0.base))} is VALID [2020-07-29 01:19:12,032 INFO L280 TraceCheckUtils]: 17: Hoare triple {8481#(not (= 0 main_~head~0.base))} havoc #t~mem6.base, #t~mem6.offset; {8481#(not (= 0 main_~head~0.base))} is VALID [2020-07-29 01:19:12,032 INFO L280 TraceCheckUtils]: 18: Hoare triple {8481#(not (= 0 main_~head~0.base))} SUMMARY for call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1013 {8481#(not (= 0 main_~head~0.base))} is VALID [2020-07-29 01:19:12,033 INFO L280 TraceCheckUtils]: 19: Hoare triple {8481#(not (= 0 main_~head~0.base))} SUMMARY for call write~int(2, #t~mem7.base, 8 + #t~mem7.offset, 4); srcloc: L1013-1 {8481#(not (= 0 main_~head~0.base))} is VALID [2020-07-29 01:19:12,034 INFO L280 TraceCheckUtils]: 20: Hoare triple {8481#(not (= 0 main_~head~0.base))} havoc #t~mem7.base, #t~mem7.offset;~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {8482#(not (= 0 main_~x~0.base))} is VALID [2020-07-29 01:19:12,034 INFO L280 TraceCheckUtils]: 21: Hoare triple {8482#(not (= 0 main_~x~0.base))} assume !(0 != ~x~0.base || 0 != ~x~0.offset); {8477#false} is VALID [2020-07-29 01:19:12,035 INFO L280 TraceCheckUtils]: 22: Hoare triple {8477#false} assume !false; {8477#false} is VALID [2020-07-29 01:19:12,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:19:12,039 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596392392] [2020-07-29 01:19:12,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:12,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 01:19:12,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452511868] [2020-07-29 01:19:12,040 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2020-07-29 01:19:12,043 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:12,044 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:19:12,078 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:12,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 01:19:12,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:12,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:19:12,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:19:12,079 INFO L87 Difference]: Start difference. First operand 121 states and 131 transitions. Second operand 5 states. [2020-07-29 01:19:12,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:12,650 INFO L93 Difference]: Finished difference Result 181 states and 186 transitions. [2020-07-29 01:19:12,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:19:12,650 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2020-07-29 01:19:12,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:12,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:19:12,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 187 transitions. [2020-07-29 01:19:12,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:19:12,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 187 transitions. [2020-07-29 01:19:12,656 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 187 transitions. [2020-07-29 01:19:12,869 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:12,873 INFO L225 Difference]: With dead ends: 181 [2020-07-29 01:19:12,873 INFO L226 Difference]: Without dead ends: 181 [2020-07-29 01:19:12,874 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:19:12,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2020-07-29 01:19:12,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 119. [2020-07-29 01:19:12,883 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:12,883 INFO L82 GeneralOperation]: Start isEquivalent. First operand 181 states. Second operand 119 states. [2020-07-29 01:19:12,883 INFO L74 IsIncluded]: Start isIncluded. First operand 181 states. Second operand 119 states. [2020-07-29 01:19:12,883 INFO L87 Difference]: Start difference. First operand 181 states. Second operand 119 states. [2020-07-29 01:19:12,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:12,888 INFO L93 Difference]: Finished difference Result 181 states and 186 transitions. [2020-07-29 01:19:12,888 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 186 transitions. [2020-07-29 01:19:12,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:12,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:12,889 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 181 states. [2020-07-29 01:19:12,890 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 181 states. [2020-07-29 01:19:12,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:12,894 INFO L93 Difference]: Finished difference Result 181 states and 186 transitions. [2020-07-29 01:19:12,895 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 186 transitions. [2020-07-29 01:19:12,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:12,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:12,896 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:12,896 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:12,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-07-29 01:19:12,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 129 transitions. [2020-07-29 01:19:12,899 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 129 transitions. Word has length 23 [2020-07-29 01:19:12,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:12,900 INFO L479 AbstractCegarLoop]: Abstraction has 119 states and 129 transitions. [2020-07-29 01:19:12,900 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 01:19:12,900 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 129 transitions. [2020-07-29 01:19:12,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-29 01:19:12,904 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:12,904 INFO L422 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, 1] [2020-07-29 01:19:12,905 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-29 01:19:12,906 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr63ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr54ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:19:12,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:12,906 INFO L82 PathProgramCache]: Analyzing trace with hash -991601776, now seen corresponding path program 1 times [2020-07-29 01:19:12,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:12,907 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764610470] [2020-07-29 01:19:12,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:12,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:12,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:12,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:13,001 INFO L280 TraceCheckUtils]: 0: Hoare triple {9158#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {9150#true} is VALID [2020-07-29 01:19:13,001 INFO L280 TraceCheckUtils]: 1: Hoare triple {9150#true} assume true; {9150#true} is VALID [2020-07-29 01:19:13,002 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {9150#true} {9150#true} #251#return; {9150#true} is VALID [2020-07-29 01:19:13,004 INFO L263 TraceCheckUtils]: 0: Hoare triple {9150#true} call ULTIMATE.init(); {9158#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:13,004 INFO L280 TraceCheckUtils]: 1: Hoare triple {9158#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {9150#true} is VALID [2020-07-29 01:19:13,004 INFO L280 TraceCheckUtils]: 2: Hoare triple {9150#true} assume true; {9150#true} is VALID [2020-07-29 01:19:13,005 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {9150#true} {9150#true} #251#return; {9150#true} is VALID [2020-07-29 01:19:13,005 INFO L263 TraceCheckUtils]: 4: Hoare triple {9150#true} call #t~ret18 := main(); {9150#true} is VALID [2020-07-29 01:19:13,005 INFO L280 TraceCheckUtils]: 5: Hoare triple {9150#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {9150#true} is VALID [2020-07-29 01:19:13,006 INFO L280 TraceCheckUtils]: 6: Hoare triple {9150#true} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); srcloc: L994 {9150#true} is VALID [2020-07-29 01:19:13,006 INFO L280 TraceCheckUtils]: 7: Hoare triple {9150#true} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L994-1 {9150#true} is VALID [2020-07-29 01:19:13,006 INFO L280 TraceCheckUtils]: 8: Hoare triple {9150#true} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L995 {9150#true} is VALID [2020-07-29 01:19:13,006 INFO L280 TraceCheckUtils]: 9: Hoare triple {9150#true} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {9150#true} is VALID [2020-07-29 01:19:13,007 INFO L280 TraceCheckUtils]: 10: Hoare triple {9150#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {9150#true} is VALID [2020-07-29 01:19:13,007 INFO L280 TraceCheckUtils]: 11: Hoare triple {9150#true} assume !(0 != #t~nondet1);havoc #t~nondet1; {9150#true} is VALID [2020-07-29 01:19:13,008 INFO L280 TraceCheckUtils]: 12: Hoare triple {9150#true} SUMMARY for call write~int(1, ~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1001-3 {9150#true} is VALID [2020-07-29 01:19:13,008 INFO L280 TraceCheckUtils]: 13: Hoare triple {9150#true} call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(12); {9150#true} is VALID [2020-07-29 01:19:13,008 INFO L280 TraceCheckUtils]: 14: Hoare triple {9150#true} SUMMARY for call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L1011 {9150#true} is VALID [2020-07-29 01:19:13,009 INFO L280 TraceCheckUtils]: 15: Hoare triple {9150#true} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1011-1 {9150#true} is VALID [2020-07-29 01:19:13,009 INFO L280 TraceCheckUtils]: 16: Hoare triple {9150#true} SUMMARY for call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem6.base, 4 + #t~mem6.offset, 4); srcloc: L1012 {9150#true} is VALID [2020-07-29 01:19:13,010 INFO L280 TraceCheckUtils]: 17: Hoare triple {9150#true} havoc #t~mem6.base, #t~mem6.offset; {9150#true} is VALID [2020-07-29 01:19:13,010 INFO L280 TraceCheckUtils]: 18: Hoare triple {9150#true} SUMMARY for call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1013 {9150#true} is VALID [2020-07-29 01:19:13,010 INFO L280 TraceCheckUtils]: 19: Hoare triple {9150#true} SUMMARY for call write~int(2, #t~mem7.base, 8 + #t~mem7.offset, 4); srcloc: L1013-1 {9150#true} is VALID [2020-07-29 01:19:13,010 INFO L280 TraceCheckUtils]: 20: Hoare triple {9150#true} havoc #t~mem7.base, #t~mem7.offset;~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {9150#true} is VALID [2020-07-29 01:19:13,011 INFO L280 TraceCheckUtils]: 21: Hoare triple {9150#true} assume !!(0 != ~x~0.base || 0 != ~x~0.offset); {9150#true} is VALID [2020-07-29 01:19:13,011 INFO L280 TraceCheckUtils]: 22: Hoare triple {9150#true} goto; {9150#true} is VALID [2020-07-29 01:19:13,012 INFO L280 TraceCheckUtils]: 23: Hoare triple {9150#true} SUMMARY for call #t~mem8 := read~int(~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1019-2 {9155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) |main_#t~mem8|)} is VALID [2020-07-29 01:19:13,014 INFO L280 TraceCheckUtils]: 24: Hoare triple {9155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) |main_#t~mem8|)} assume !(1 != #t~mem8);havoc #t~mem8; {9156#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))} is VALID [2020-07-29 01:19:13,015 INFO L280 TraceCheckUtils]: 25: Hoare triple {9156#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))} SUMMARY for call #t~mem11 := read~int(~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1024-4 {9157#(= |main_#t~mem11| 1)} is VALID [2020-07-29 01:19:13,016 INFO L280 TraceCheckUtils]: 26: Hoare triple {9157#(= |main_#t~mem11| 1)} assume !(1 == #t~mem11);havoc #t~mem11; {9151#false} is VALID [2020-07-29 01:19:13,016 INFO L280 TraceCheckUtils]: 27: Hoare triple {9151#false} assume !false; {9151#false} is VALID [2020-07-29 01:19:13,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:19:13,019 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764610470] [2020-07-29 01:19:13,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:13,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-29 01:19:13,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767549863] [2020-07-29 01:19:13,020 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2020-07-29 01:19:13,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:13,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:19:13,055 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:13,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-29 01:19:13,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:13,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:19:13,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:19:13,056 INFO L87 Difference]: Start difference. First operand 119 states and 129 transitions. Second operand 6 states. [2020-07-29 01:19:13,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:13,702 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2020-07-29 01:19:13,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:19:13,702 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2020-07-29 01:19:13,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:13,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:19:13,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2020-07-29 01:19:13,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:19:13,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2020-07-29 01:19:13,706 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 97 transitions. [2020-07-29 01:19:13,817 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:13,819 INFO L225 Difference]: With dead ends: 117 [2020-07-29 01:19:13,819 INFO L226 Difference]: Without dead ends: 117 [2020-07-29 01:19:13,820 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:19:13,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-07-29 01:19:13,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2020-07-29 01:19:13,826 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:13,827 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand 117 states. [2020-07-29 01:19:13,827 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 117 states. [2020-07-29 01:19:13,827 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 117 states. [2020-07-29 01:19:13,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:13,830 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2020-07-29 01:19:13,830 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 126 transitions. [2020-07-29 01:19:13,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:13,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:13,831 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 117 states. [2020-07-29 01:19:13,832 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 117 states. [2020-07-29 01:19:13,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:13,834 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2020-07-29 01:19:13,835 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 126 transitions. [2020-07-29 01:19:13,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:13,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:13,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:13,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:13,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-07-29 01:19:13,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 126 transitions. [2020-07-29 01:19:13,839 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 126 transitions. Word has length 28 [2020-07-29 01:19:13,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:13,839 INFO L479 AbstractCegarLoop]: Abstraction has 117 states and 126 transitions. [2020-07-29 01:19:13,840 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-29 01:19:13,840 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 126 transitions. [2020-07-29 01:19:13,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-29 01:19:13,842 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:13,842 INFO L422 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, 1] [2020-07-29 01:19:13,843 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-29 01:19:13,845 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr63ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr54ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:19:13,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:13,845 INFO L82 PathProgramCache]: Analyzing trace with hash -991569005, now seen corresponding path program 1 times [2020-07-29 01:19:13,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:13,846 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147017685] [2020-07-29 01:19:13,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:13,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:14,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:14,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:14,319 INFO L280 TraceCheckUtils]: 0: Hoare triple {9647#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {9631#true} is VALID [2020-07-29 01:19:14,319 INFO L280 TraceCheckUtils]: 1: Hoare triple {9631#true} assume true; {9631#true} is VALID [2020-07-29 01:19:14,320 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {9631#true} {9631#true} #251#return; {9631#true} is VALID [2020-07-29 01:19:14,322 INFO L263 TraceCheckUtils]: 0: Hoare triple {9631#true} call ULTIMATE.init(); {9647#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:14,322 INFO L280 TraceCheckUtils]: 1: Hoare triple {9647#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {9631#true} is VALID [2020-07-29 01:19:14,323 INFO L280 TraceCheckUtils]: 2: Hoare triple {9631#true} assume true; {9631#true} is VALID [2020-07-29 01:19:14,323 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {9631#true} {9631#true} #251#return; {9631#true} is VALID [2020-07-29 01:19:14,323 INFO L263 TraceCheckUtils]: 4: Hoare triple {9631#true} call #t~ret18 := main(); {9631#true} is VALID [2020-07-29 01:19:14,325 INFO L280 TraceCheckUtils]: 5: Hoare triple {9631#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {9636#(= 0 main_~head~0.offset)} is VALID [2020-07-29 01:19:14,326 INFO L280 TraceCheckUtils]: 6: Hoare triple {9636#(= 0 main_~head~0.offset)} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); srcloc: L994 {9637#(and (= 1 (select |#valid| main_~head~0.base)) (= 0 main_~head~0.offset))} is VALID [2020-07-29 01:19:14,328 INFO L280 TraceCheckUtils]: 7: Hoare triple {9637#(and (= 1 (select |#valid| main_~head~0.base)) (= 0 main_~head~0.offset))} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L994-1 {9637#(and (= 1 (select |#valid| main_~head~0.base)) (= 0 main_~head~0.offset))} is VALID [2020-07-29 01:19:14,329 INFO L280 TraceCheckUtils]: 8: Hoare triple {9637#(and (= 1 (select |#valid| main_~head~0.base)) (= 0 main_~head~0.offset))} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L995 {9637#(and (= 1 (select |#valid| main_~head~0.base)) (= 0 main_~head~0.offset))} is VALID [2020-07-29 01:19:14,330 INFO L280 TraceCheckUtils]: 9: Hoare triple {9637#(and (= 1 (select |#valid| main_~head~0.base)) (= 0 main_~head~0.offset))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {9638#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~x~0.base) (= 0 main_~head~0.offset))} is VALID [2020-07-29 01:19:14,331 INFO L280 TraceCheckUtils]: 10: Hoare triple {9638#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~x~0.base) (= 0 main_~head~0.offset))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {9638#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~x~0.base) (= 0 main_~head~0.offset))} is VALID [2020-07-29 01:19:14,332 INFO L280 TraceCheckUtils]: 11: Hoare triple {9638#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~x~0.base) (= 0 main_~head~0.offset))} assume !(0 != #t~nondet1);havoc #t~nondet1; {9638#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~x~0.base) (= 0 main_~head~0.offset))} is VALID [2020-07-29 01:19:14,334 INFO L280 TraceCheckUtils]: 12: Hoare triple {9638#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~x~0.base) (= 0 main_~head~0.offset))} SUMMARY for call write~int(1, ~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1001-3 {9639#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~x~0.base) (= 0 main_~head~0.offset))} is VALID [2020-07-29 01:19:14,335 INFO L280 TraceCheckUtils]: 13: Hoare triple {9639#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~x~0.base) (= 0 main_~head~0.offset))} call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(12); {9640#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (not (= |main_#t~malloc5.base| main_~head~0.base)) (= main_~head~0.base main_~x~0.base) (= 0 main_~head~0.offset))} is VALID [2020-07-29 01:19:14,337 INFO L280 TraceCheckUtils]: 14: Hoare triple {9640#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (not (= |main_#t~malloc5.base| main_~head~0.base)) (= main_~head~0.base main_~x~0.base) (= 0 main_~head~0.offset))} SUMMARY for call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L1011 {9641#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~head~0.base main_~x~0.base) (= 0 main_~head~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} is VALID [2020-07-29 01:19:14,338 INFO L280 TraceCheckUtils]: 15: Hoare triple {9641#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~head~0.base main_~x~0.base) (= 0 main_~head~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1011-1 {9642#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_#t~mem6.base|) (not (= |main_#t~mem6.base| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~head~0.base main_~x~0.base) (= 0 main_~head~0.offset))} is VALID [2020-07-29 01:19:14,340 INFO L280 TraceCheckUtils]: 16: Hoare triple {9642#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_#t~mem6.base|) (not (= |main_#t~mem6.base| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~head~0.base main_~x~0.base) (= 0 main_~head~0.offset))} SUMMARY for call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem6.base, 4 + #t~mem6.offset, 4); srcloc: L1012 {9641#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~head~0.base main_~x~0.base) (= 0 main_~head~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} is VALID [2020-07-29 01:19:14,341 INFO L280 TraceCheckUtils]: 17: Hoare triple {9641#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~head~0.base main_~x~0.base) (= 0 main_~head~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} havoc #t~mem6.base, #t~mem6.offset; {9641#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~head~0.base main_~x~0.base) (= 0 main_~head~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} is VALID [2020-07-29 01:19:14,342 INFO L280 TraceCheckUtils]: 18: Hoare triple {9641#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~head~0.base main_~x~0.base) (= 0 main_~head~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} SUMMARY for call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1013 {9643#(and (not (= |main_#t~mem7.base| main_~head~0.base)) (= 0 main_~head~0.offset) (= 1 (select (select |#memory_int| main_~head~0.base) (+ main_~head~0.offset 8))))} is VALID [2020-07-29 01:19:14,344 INFO L280 TraceCheckUtils]: 19: Hoare triple {9643#(and (not (= |main_#t~mem7.base| main_~head~0.base)) (= 0 main_~head~0.offset) (= 1 (select (select |#memory_int| main_~head~0.base) (+ main_~head~0.offset 8))))} SUMMARY for call write~int(2, #t~mem7.base, 8 + #t~mem7.offset, 4); srcloc: L1013-1 {9644#(and (= 0 main_~head~0.offset) (= 1 (select (select |#memory_int| main_~head~0.base) (+ main_~head~0.offset 8))))} is VALID [2020-07-29 01:19:14,345 INFO L280 TraceCheckUtils]: 20: Hoare triple {9644#(and (= 0 main_~head~0.offset) (= 1 (select (select |#memory_int| main_~head~0.base) (+ main_~head~0.offset 8))))} havoc #t~mem7.base, #t~mem7.offset;~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {9645#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))} is VALID [2020-07-29 01:19:14,346 INFO L280 TraceCheckUtils]: 21: Hoare triple {9645#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))} assume !!(0 != ~x~0.base || 0 != ~x~0.offset); {9645#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))} is VALID [2020-07-29 01:19:14,346 INFO L280 TraceCheckUtils]: 22: Hoare triple {9645#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))} goto; {9645#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))} is VALID [2020-07-29 01:19:14,347 INFO L280 TraceCheckUtils]: 23: Hoare triple {9645#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))} SUMMARY for call #t~mem8 := read~int(~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1019-2 {9646#(= 1 |main_#t~mem8|)} is VALID [2020-07-29 01:19:14,348 INFO L280 TraceCheckUtils]: 24: Hoare triple {9646#(= 1 |main_#t~mem8|)} assume !!(1 != #t~mem8);havoc #t~mem8; {9632#false} is VALID [2020-07-29 01:19:14,348 INFO L280 TraceCheckUtils]: 25: Hoare triple {9632#false} SUMMARY for call #t~mem9 := read~int(~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1021-5 {9632#false} is VALID [2020-07-29 01:19:14,349 INFO L280 TraceCheckUtils]: 26: Hoare triple {9632#false} assume !(0 == #t~mem9);havoc #t~mem9; {9632#false} is VALID [2020-07-29 01:19:14,349 INFO L280 TraceCheckUtils]: 27: Hoare triple {9632#false} assume !false; {9632#false} is VALID [2020-07-29 01:19:14,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:19:14,354 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147017685] [2020-07-29 01:19:14,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:14,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-07-29 01:19:14,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166297242] [2020-07-29 01:19:14,356 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2020-07-29 01:19:14,356 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:14,356 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-29 01:19:14,399 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:14,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-29 01:19:14,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:14,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-29 01:19:14,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2020-07-29 01:19:14,400 INFO L87 Difference]: Start difference. First operand 117 states and 126 transitions. Second operand 14 states. [2020-07-29 01:19:16,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:16,861 INFO L93 Difference]: Finished difference Result 216 states and 221 transitions. [2020-07-29 01:19:16,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-29 01:19:16,861 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2020-07-29 01:19:16,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:16,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-29 01:19:16,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 221 transitions. [2020-07-29 01:19:16,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-29 01:19:16,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 221 transitions. [2020-07-29 01:19:16,866 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 221 transitions. [2020-07-29 01:19:17,169 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 221 edges. 221 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:17,175 INFO L225 Difference]: With dead ends: 216 [2020-07-29 01:19:17,175 INFO L226 Difference]: Without dead ends: 216 [2020-07-29 01:19:17,175 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2020-07-29 01:19:17,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2020-07-29 01:19:17,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 132. [2020-07-29 01:19:17,179 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:17,180 INFO L82 GeneralOperation]: Start isEquivalent. First operand 216 states. Second operand 132 states. [2020-07-29 01:19:17,180 INFO L74 IsIncluded]: Start isIncluded. First operand 216 states. Second operand 132 states. [2020-07-29 01:19:17,180 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 132 states. [2020-07-29 01:19:17,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:17,184 INFO L93 Difference]: Finished difference Result 216 states and 221 transitions. [2020-07-29 01:19:17,184 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 221 transitions. [2020-07-29 01:19:17,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:17,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:17,186 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand 216 states. [2020-07-29 01:19:17,186 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 216 states. [2020-07-29 01:19:17,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:17,190 INFO L93 Difference]: Finished difference Result 216 states and 221 transitions. [2020-07-29 01:19:17,191 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 221 transitions. [2020-07-29 01:19:17,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:17,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:17,192 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:17,192 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:17,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-07-29 01:19:17,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 142 transitions. [2020-07-29 01:19:17,194 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 142 transitions. Word has length 28 [2020-07-29 01:19:17,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:17,195 INFO L479 AbstractCegarLoop]: Abstraction has 132 states and 142 transitions. [2020-07-29 01:19:17,195 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-29 01:19:17,195 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 142 transitions. [2020-07-29 01:19:17,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-29 01:19:17,196 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:17,196 INFO L422 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, 1, 1, 1, 1] [2020-07-29 01:19:17,196 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-29 01:19:17,197 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr63ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr54ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:19:17,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:17,197 INFO L82 PathProgramCache]: Analyzing trace with hash -19386319, now seen corresponding path program 1 times [2020-07-29 01:19:17,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:17,198 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622017457] [2020-07-29 01:19:17,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:17,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:17,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:17,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:17,440 INFO L280 TraceCheckUtils]: 0: Hoare triple {10461#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {10446#true} is VALID [2020-07-29 01:19:17,441 INFO L280 TraceCheckUtils]: 1: Hoare triple {10446#true} assume true; {10446#true} is VALID [2020-07-29 01:19:17,441 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {10446#true} {10446#true} #251#return; {10446#true} is VALID [2020-07-29 01:19:17,443 INFO L263 TraceCheckUtils]: 0: Hoare triple {10446#true} call ULTIMATE.init(); {10461#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:17,444 INFO L280 TraceCheckUtils]: 1: Hoare triple {10461#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {10446#true} is VALID [2020-07-29 01:19:17,444 INFO L280 TraceCheckUtils]: 2: Hoare triple {10446#true} assume true; {10446#true} is VALID [2020-07-29 01:19:17,444 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {10446#true} {10446#true} #251#return; {10446#true} is VALID [2020-07-29 01:19:17,444 INFO L263 TraceCheckUtils]: 4: Hoare triple {10446#true} call #t~ret18 := main(); {10446#true} is VALID [2020-07-29 01:19:17,444 INFO L280 TraceCheckUtils]: 5: Hoare triple {10446#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {10446#true} is VALID [2020-07-29 01:19:17,445 INFO L280 TraceCheckUtils]: 6: Hoare triple {10446#true} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); srcloc: L994 {10451#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-29 01:19:17,446 INFO L280 TraceCheckUtils]: 7: Hoare triple {10451#(= 1 (select |#valid| main_~head~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L994-1 {10451#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-29 01:19:17,447 INFO L280 TraceCheckUtils]: 8: Hoare triple {10451#(= 1 (select |#valid| main_~head~0.base))} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L995 {10451#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-29 01:19:17,447 INFO L280 TraceCheckUtils]: 9: Hoare triple {10451#(= 1 (select |#valid| main_~head~0.base))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {10452#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~x~0.base))} is VALID [2020-07-29 01:19:17,448 INFO L280 TraceCheckUtils]: 10: Hoare triple {10452#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~x~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {10452#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~x~0.base))} is VALID [2020-07-29 01:19:17,449 INFO L280 TraceCheckUtils]: 11: Hoare triple {10452#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~x~0.base))} assume !(0 != #t~nondet1);havoc #t~nondet1; {10452#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~x~0.base))} is VALID [2020-07-29 01:19:17,450 INFO L280 TraceCheckUtils]: 12: Hoare triple {10452#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~x~0.base))} SUMMARY for call write~int(1, ~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1001-3 {10452#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~x~0.base))} is VALID [2020-07-29 01:19:17,451 INFO L280 TraceCheckUtils]: 13: Hoare triple {10452#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~x~0.base))} call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(12); {10453#(and (= 1 (select |#valid| |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (not (= |main_#t~malloc5.base| main_~head~0.base)) (= main_~head~0.base main_~x~0.base))} is VALID [2020-07-29 01:19:17,453 INFO L280 TraceCheckUtils]: 14: Hoare triple {10453#(and (= 1 (select |#valid| |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (not (= |main_#t~malloc5.base| main_~head~0.base)) (= main_~head~0.base main_~x~0.base))} SUMMARY for call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L1011 {10454#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} is VALID [2020-07-29 01:19:17,454 INFO L280 TraceCheckUtils]: 15: Hoare triple {10454#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1011-1 {10455#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_#t~mem6.base|) (not (= |main_#t~mem6.base| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} is VALID [2020-07-29 01:19:17,457 INFO L280 TraceCheckUtils]: 16: Hoare triple {10455#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_#t~mem6.base|) (not (= |main_#t~mem6.base| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} SUMMARY for call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem6.base, 4 + #t~mem6.offset, 4); srcloc: L1012 {10454#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} is VALID [2020-07-29 01:19:17,458 INFO L280 TraceCheckUtils]: 17: Hoare triple {10454#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} havoc #t~mem6.base, #t~mem6.offset; {10454#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} is VALID [2020-07-29 01:19:17,459 INFO L280 TraceCheckUtils]: 18: Hoare triple {10454#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} SUMMARY for call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1013 {10456#(and (not (= |main_#t~mem7.base| main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))))} is VALID [2020-07-29 01:19:17,460 INFO L280 TraceCheckUtils]: 19: Hoare triple {10456#(and (not (= |main_#t~mem7.base| main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))))} SUMMARY for call write~int(2, #t~mem7.base, 8 + #t~mem7.offset, 4); srcloc: L1013-1 {10457#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))} is VALID [2020-07-29 01:19:17,461 INFO L280 TraceCheckUtils]: 20: Hoare triple {10457#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))} havoc #t~mem7.base, #t~mem7.offset;~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {10458#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-29 01:19:17,462 INFO L280 TraceCheckUtils]: 21: Hoare triple {10458#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} assume !!(0 != ~x~0.base || 0 != ~x~0.offset); {10458#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-29 01:19:17,463 INFO L280 TraceCheckUtils]: 22: Hoare triple {10458#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} goto; {10458#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-29 01:19:17,463 INFO L280 TraceCheckUtils]: 23: Hoare triple {10458#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} SUMMARY for call #t~mem8 := read~int(~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1019-2 {10458#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-29 01:19:17,464 INFO L280 TraceCheckUtils]: 24: Hoare triple {10458#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} assume !(1 != #t~mem8);havoc #t~mem8; {10458#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-29 01:19:17,465 INFO L280 TraceCheckUtils]: 25: Hoare triple {10458#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} SUMMARY for call #t~mem11 := read~int(~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1024-4 {10458#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-29 01:19:17,465 INFO L280 TraceCheckUtils]: 26: Hoare triple {10458#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} assume !!(1 == #t~mem11);havoc #t~mem11; {10458#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-29 01:19:17,466 INFO L280 TraceCheckUtils]: 27: Hoare triple {10458#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} goto; {10458#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-29 01:19:17,467 INFO L280 TraceCheckUtils]: 28: Hoare triple {10458#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} SUMMARY for call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1024-5 {10459#(= 1 (select |#valid| |main_#t~mem12.base|))} is VALID [2020-07-29 01:19:17,468 INFO L280 TraceCheckUtils]: 29: Hoare triple {10459#(= 1 (select |#valid| |main_#t~mem12.base|))} ~x~0.base, ~x~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset; {10460#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-29 01:19:17,469 INFO L280 TraceCheckUtils]: 30: Hoare triple {10460#(= 1 (select |#valid| main_~x~0.base))} assume !(1 == #valid[~x~0.base]); {10447#false} is VALID [2020-07-29 01:19:17,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:19:17,473 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622017457] [2020-07-29 01:19:17,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:17,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-29 01:19:17,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2450228] [2020-07-29 01:19:17,475 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2020-07-29 01:19:17,476 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:17,477 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-29 01:19:17,518 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:17,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-29 01:19:17,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:17,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-29 01:19:17,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2020-07-29 01:19:17,519 INFO L87 Difference]: Start difference. First operand 132 states and 142 transitions. Second operand 13 states. [2020-07-29 01:19:19,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:19,736 INFO L93 Difference]: Finished difference Result 179 states and 185 transitions. [2020-07-29 01:19:19,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-29 01:19:19,736 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2020-07-29 01:19:19,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:19,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-29 01:19:19,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 182 transitions. [2020-07-29 01:19:19,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-29 01:19:19,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 182 transitions. [2020-07-29 01:19:19,740 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 182 transitions. [2020-07-29 01:19:19,975 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:19,979 INFO L225 Difference]: With dead ends: 179 [2020-07-29 01:19:19,979 INFO L226 Difference]: Without dead ends: 179 [2020-07-29 01:19:19,979 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2020-07-29 01:19:19,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2020-07-29 01:19:19,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 138. [2020-07-29 01:19:19,983 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:19,983 INFO L82 GeneralOperation]: Start isEquivalent. First operand 179 states. Second operand 138 states. [2020-07-29 01:19:19,983 INFO L74 IsIncluded]: Start isIncluded. First operand 179 states. Second operand 138 states. [2020-07-29 01:19:19,983 INFO L87 Difference]: Start difference. First operand 179 states. Second operand 138 states. [2020-07-29 01:19:19,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:19,987 INFO L93 Difference]: Finished difference Result 179 states and 185 transitions. [2020-07-29 01:19:19,987 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 185 transitions. [2020-07-29 01:19:19,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:19,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:19,988 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 179 states. [2020-07-29 01:19:19,988 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 179 states. [2020-07-29 01:19:19,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:19,992 INFO L93 Difference]: Finished difference Result 179 states and 185 transitions. [2020-07-29 01:19:19,992 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 185 transitions. [2020-07-29 01:19:19,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:19,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:19,993 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:19,993 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:19,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-07-29 01:19:19,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 149 transitions. [2020-07-29 01:19:19,995 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 149 transitions. Word has length 31 [2020-07-29 01:19:19,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:19,996 INFO L479 AbstractCegarLoop]: Abstraction has 138 states and 149 transitions. [2020-07-29 01:19:19,996 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-29 01:19:19,996 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 149 transitions. [2020-07-29 01:19:19,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-29 01:19:19,997 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:19,997 INFO L422 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, 1, 1, 1, 1] [2020-07-29 01:19:19,997 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-29 01:19:19,997 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr63ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr54ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:19:19,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:19,997 INFO L82 PathProgramCache]: Analyzing trace with hash -19386318, now seen corresponding path program 1 times [2020-07-29 01:19:19,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:19,998 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770626331] [2020-07-29 01:19:19,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:20,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:20,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:19:20,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:19:20,281 INFO L280 TraceCheckUtils]: 0: Hoare triple {11172#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {11157#true} is VALID [2020-07-29 01:19:20,281 INFO L280 TraceCheckUtils]: 1: Hoare triple {11157#true} assume true; {11157#true} is VALID [2020-07-29 01:19:20,281 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {11157#true} {11157#true} #251#return; {11157#true} is VALID [2020-07-29 01:19:20,282 INFO L263 TraceCheckUtils]: 0: Hoare triple {11157#true} call ULTIMATE.init(); {11172#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:19:20,282 INFO L280 TraceCheckUtils]: 1: Hoare triple {11172#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {11157#true} is VALID [2020-07-29 01:19:20,282 INFO L280 TraceCheckUtils]: 2: Hoare triple {11157#true} assume true; {11157#true} is VALID [2020-07-29 01:19:20,283 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {11157#true} {11157#true} #251#return; {11157#true} is VALID [2020-07-29 01:19:20,283 INFO L263 TraceCheckUtils]: 4: Hoare triple {11157#true} call #t~ret18 := main(); {11157#true} is VALID [2020-07-29 01:19:20,283 INFO L280 TraceCheckUtils]: 5: Hoare triple {11157#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {11157#true} is VALID [2020-07-29 01:19:20,283 INFO L280 TraceCheckUtils]: 6: Hoare triple {11157#true} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); srcloc: L994 {11162#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-29 01:19:20,284 INFO L280 TraceCheckUtils]: 7: Hoare triple {11162#(= 1 (select |#valid| main_~head~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L994-1 {11162#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-29 01:19:20,284 INFO L280 TraceCheckUtils]: 8: Hoare triple {11162#(= 1 (select |#valid| main_~head~0.base))} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L995 {11162#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-29 01:19:20,285 INFO L280 TraceCheckUtils]: 9: Hoare triple {11162#(= 1 (select |#valid| main_~head~0.base))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {11163#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~x~0.base))} is VALID [2020-07-29 01:19:20,285 INFO L280 TraceCheckUtils]: 10: Hoare triple {11163#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~x~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {11163#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~x~0.base))} is VALID [2020-07-29 01:19:20,286 INFO L280 TraceCheckUtils]: 11: Hoare triple {11163#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~x~0.base))} assume !(0 != #t~nondet1);havoc #t~nondet1; {11163#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~x~0.base))} is VALID [2020-07-29 01:19:20,286 INFO L280 TraceCheckUtils]: 12: Hoare triple {11163#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~x~0.base))} SUMMARY for call write~int(1, ~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1001-3 {11163#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~x~0.base))} is VALID [2020-07-29 01:19:20,289 INFO L280 TraceCheckUtils]: 13: Hoare triple {11163#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~x~0.base))} call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(12); {11164#(and (= 0 |main_#t~malloc5.offset|) (= 12 (select |#length| |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (not (= |main_#t~malloc5.base| main_~head~0.base)) (= main_~head~0.base main_~x~0.base))} is VALID [2020-07-29 01:19:20,290 INFO L280 TraceCheckUtils]: 14: Hoare triple {11164#(and (= 0 |main_#t~malloc5.offset|) (= 12 (select |#length| |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (not (= |main_#t~malloc5.base| main_~head~0.base)) (= main_~head~0.base main_~x~0.base))} SUMMARY for call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L1011 {11165#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} is VALID [2020-07-29 01:19:20,292 INFO L280 TraceCheckUtils]: 15: Hoare triple {11165#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1011-1 {11166#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_#t~mem6.base|) (not (= |main_#t~mem6.base| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} is VALID [2020-07-29 01:19:20,293 INFO L280 TraceCheckUtils]: 16: Hoare triple {11166#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_#t~mem6.base|) (not (= |main_#t~mem6.base| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} SUMMARY for call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem6.base, 4 + #t~mem6.offset, 4); srcloc: L1012 {11165#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} is VALID [2020-07-29 01:19:20,297 INFO L280 TraceCheckUtils]: 17: Hoare triple {11165#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} havoc #t~mem6.base, #t~mem6.offset; {11165#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} is VALID [2020-07-29 01:19:20,298 INFO L280 TraceCheckUtils]: 18: Hoare triple {11165#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} SUMMARY for call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1013 {11167#(and (= (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 12) (not (= |main_#t~mem7.base| main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))} is VALID [2020-07-29 01:19:20,299 INFO L280 TraceCheckUtils]: 19: Hoare triple {11167#(and (= (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 12) (not (= |main_#t~mem7.base| main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))} SUMMARY for call write~int(2, #t~mem7.base, 8 + #t~mem7.offset, 4); srcloc: L1013-1 {11168#(and (= (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 12) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))} is VALID [2020-07-29 01:19:20,300 INFO L280 TraceCheckUtils]: 20: Hoare triple {11168#(and (= (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 12) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))} havoc #t~mem7.base, #t~mem7.offset;~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {11169#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} is VALID [2020-07-29 01:19:20,301 INFO L280 TraceCheckUtils]: 21: Hoare triple {11169#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} assume !!(0 != ~x~0.base || 0 != ~x~0.offset); {11169#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} is VALID [2020-07-29 01:19:20,302 INFO L280 TraceCheckUtils]: 22: Hoare triple {11169#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} goto; {11169#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} is VALID [2020-07-29 01:19:20,303 INFO L280 TraceCheckUtils]: 23: Hoare triple {11169#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} SUMMARY for call #t~mem8 := read~int(~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1019-2 {11169#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} is VALID [2020-07-29 01:19:20,303 INFO L280 TraceCheckUtils]: 24: Hoare triple {11169#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} assume !(1 != #t~mem8);havoc #t~mem8; {11169#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} is VALID [2020-07-29 01:19:20,304 INFO L280 TraceCheckUtils]: 25: Hoare triple {11169#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} SUMMARY for call #t~mem11 := read~int(~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1024-4 {11169#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} is VALID [2020-07-29 01:19:20,305 INFO L280 TraceCheckUtils]: 26: Hoare triple {11169#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} assume !!(1 == #t~mem11);havoc #t~mem11; {11169#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} is VALID [2020-07-29 01:19:20,306 INFO L280 TraceCheckUtils]: 27: Hoare triple {11169#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} goto; {11169#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} is VALID [2020-07-29 01:19:20,307 INFO L280 TraceCheckUtils]: 28: Hoare triple {11169#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))} SUMMARY for call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1024-5 {11170#(and (= |main_#t~mem12.offset| 0) (= 12 (select |#length| |main_#t~mem12.base|)))} is VALID [2020-07-29 01:19:20,308 INFO L280 TraceCheckUtils]: 29: Hoare triple {11170#(and (= |main_#t~mem12.offset| 0) (= 12 (select |#length| |main_#t~mem12.base|)))} ~x~0.base, ~x~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset; {11171#(and (= 12 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0))} is VALID [2020-07-29 01:19:20,309 INFO L280 TraceCheckUtils]: 30: Hoare triple {11171#(and (= 12 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0))} assume !(4 + (8 + ~x~0.offset) <= #length[~x~0.base] && 0 <= 8 + ~x~0.offset); {11158#false} is VALID [2020-07-29 01:19:20,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:19:20,313 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770626331] [2020-07-29 01:19:20,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:19:20,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-29 01:19:20,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358412872] [2020-07-29 01:19:20,314 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2020-07-29 01:19:20,314 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:19:20,314 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-29 01:19:20,359 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:20,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-29 01:19:20,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:19:20,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-29 01:19:20,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2020-07-29 01:19:20,361 INFO L87 Difference]: Start difference. First operand 138 states and 149 transitions. Second operand 13 states. [2020-07-29 01:19:22,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:22,597 INFO L93 Difference]: Finished difference Result 214 states and 219 transitions. [2020-07-29 01:19:22,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-29 01:19:22,598 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2020-07-29 01:19:22,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:19:22,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-29 01:19:22,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 219 transitions. [2020-07-29 01:19:22,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-29 01:19:22,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 219 transitions. [2020-07-29 01:19:22,601 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 219 transitions. [2020-07-29 01:19:22,901 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 219 edges. 219 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:19:22,906 INFO L225 Difference]: With dead ends: 214 [2020-07-29 01:19:22,906 INFO L226 Difference]: Without dead ends: 214 [2020-07-29 01:19:22,906 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2020-07-29 01:19:22,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2020-07-29 01:19:22,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 138. [2020-07-29 01:19:22,910 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:19:22,910 INFO L82 GeneralOperation]: Start isEquivalent. First operand 214 states. Second operand 138 states. [2020-07-29 01:19:22,911 INFO L74 IsIncluded]: Start isIncluded. First operand 214 states. Second operand 138 states. [2020-07-29 01:19:22,911 INFO L87 Difference]: Start difference. First operand 214 states. Second operand 138 states. [2020-07-29 01:19:22,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:22,915 INFO L93 Difference]: Finished difference Result 214 states and 219 transitions. [2020-07-29 01:19:22,915 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 219 transitions. [2020-07-29 01:19:22,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:22,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:22,916 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 214 states. [2020-07-29 01:19:22,916 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 214 states. [2020-07-29 01:19:22,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:19:22,920 INFO L93 Difference]: Finished difference Result 214 states and 219 transitions. [2020-07-29 01:19:22,921 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 219 transitions. [2020-07-29 01:19:22,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:19:22,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:19:22,922 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:19:22,922 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:19:22,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-07-29 01:19:22,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 148 transitions. [2020-07-29 01:19:22,924 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 148 transitions. Word has length 31 [2020-07-29 01:19:22,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:19:22,925 INFO L479 AbstractCegarLoop]: Abstraction has 138 states and 148 transitions. [2020-07-29 01:19:22,925 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-29 01:19:22,925 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 148 transitions. [2020-07-29 01:19:22,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-29 01:19:22,925 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:19:22,926 INFO L422 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, 1, 1, 1, 1, 1, 1] [2020-07-29 01:19:22,926 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-07-29 01:19:22,926 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr29ASSERT_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr34ASSERT_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr44ASSERT_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr63ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_LEAK, mainErr54ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2020-07-29 01:19:22,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:19:22,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1450378863, now seen corresponding path program 1 times [2020-07-29 01:19:22,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:19:22,927 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226308918] [2020-07-29 01:19:22,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:19:22,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:19:22,948 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:19:22,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:19:22,968 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:19:23,002 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:19:23,002 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-29 01:19:23,002 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-07-29 01:19:23,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.07 01:19:23 BoogieIcfgContainer [2020-07-29 01:19:23,042 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-29 01:19:23,042 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:19:23,042 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:19:23,043 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:19:23,043 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:18:50" (3/4) ... [2020-07-29 01:19:23,046 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-07-29 01:19:23,126 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-29 01:19:23,126 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:19:23,131 INFO L168 Benchmark]: Toolchain (without parser) took 34378.56 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 542.1 MB). Free memory was 961.6 MB in the beginning and 953.3 MB in the end (delta: 8.3 MB). Peak memory consumption was 550.4 MB. Max. memory is 11.5 GB. [2020-07-29 01:19:23,132 INFO L168 Benchmark]: CDTParser took 1.57 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:19:23,135 INFO L168 Benchmark]: CACSL2BoogieTranslator took 614.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -159.2 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:19:23,136 INFO L168 Benchmark]: Boogie Preprocessor took 86.16 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:19:23,137 INFO L168 Benchmark]: RCFGBuilder took 1086.45 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: 93.6 MB). Peak memory consumption was 93.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:19:23,137 INFO L168 Benchmark]: TraceAbstraction took 32498.80 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 407.4 MB). Free memory was 1.0 GB in the beginning and 967.9 MB in the end (delta: 47.2 MB). Peak memory consumption was 454.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:19:23,138 INFO L168 Benchmark]: Witness Printer took 84.15 ms. Allocated memory is still 1.6 GB. Free memory was 967.9 MB in the beginning and 953.3 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:19:23,141 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.57 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 614.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -159.2 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 86.16 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1086.45 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: 93.6 MB). Peak memory consumption was 93.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 32498.80 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 407.4 MB). Free memory was 1.0 GB in the beginning and 967.9 MB in the end (delta: 47.2 MB). Peak memory consumption was 454.6 MB. Max. memory is 11.5 GB. * Witness Printer took 84.15 ms. Allocated memory is still 1.6 GB. Free memory was 967.9 MB in the beginning and 953.3 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1026]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L993] SLL* head = malloc(sizeof(SLL)); VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}] [L994] head->next = ((void*)0) VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}] [L995] head->prev = ((void*)0) VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}] [L996] head->data = 0 VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}] [L998] SLL* x = head; VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, x={-1:0}] [L1001] COND FALSE !(__VERIFIER_nondet_int()) [L1010] x->data = 1 VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, x={-1:0}] [L1011] x->next = malloc(sizeof(SLL)) VAL [head={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, x={-1:0}] [L1012] EXPR x->next VAL [head={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, x={-1:0}, x->next={-2:0}] [L1012] x->next->prev = x VAL [head={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, x={-1:0}, x->next={-2:0}] [L1013] EXPR x->next VAL [head={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, x={-1:0}, x->next={-2:0}] [L1013] x->next->data = 2 VAL [head={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, x={-1:0}, x->next={-2:0}] [L1015] x = head VAL [head={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, x={-1:0}] [L1017] COND FALSE !(!(((void*)0) != x)) VAL [head={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, x={-1:0}] [L1019] EXPR x->data VAL [head={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, x={-1:0}, x->data=1] [L1019] COND FALSE !(1 != x->data) [L1024] EXPR x->data VAL [head={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, x={-1:0}, x->data=1] [L1024] COND FALSE !(!(1 == x->data)) [L1025] EXPR x->next VAL [head={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, x={-1:0}, x->next={-2:0}] [L1025] x = x->next [L1026] EXPR x->data VAL [head={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, x={-2:0}, x->data=2] [L1026] COND TRUE !(2 != x->data) [L1026] __VERIFIER_error() VAL [head={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, x={-2:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 139 locations, 64 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 32.3s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 27.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1303 SDtfs, 3044 SDslu, 3006 SDs, 0 SdLazy, 6756 SolverSat, 390 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 219 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 18 MinimizatonAttempts, 601 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 377 NumberOfCodeBlocks, 377 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 326 ConstructedInterpolants, 0 QuantifiedInterpolants, 49357 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...