./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/count_down-alloca-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) 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/array-memsafety/count_down-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3e28603c63113c1566dc2e06da17c63059f80486 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 00:48:00,332 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 00:48:00,335 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 00:48:00,354 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 00:48:00,354 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 00:48:00,356 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 00:48:00,358 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 00:48:00,370 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 00:48:00,374 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 00:48:00,378 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 00:48:00,380 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 00:48:00,382 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 00:48:00,382 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 00:48:00,384 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 00:48:00,386 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 00:48:00,387 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 00:48:00,388 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 00:48:00,389 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 00:48:00,394 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 00:48:00,396 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 00:48:00,398 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 00:48:00,399 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 00:48:00,400 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 00:48:00,401 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 00:48:00,404 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 00:48:00,405 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 00:48:00,405 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 00:48:00,406 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 00:48:00,407 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 00:48:00,408 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 00:48:00,408 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 00:48:00,409 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 00:48:00,410 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 00:48:00,411 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 00:48:00,412 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 00:48:00,412 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 00:48:00,413 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 00:48:00,414 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 00:48:00,414 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 00:48:00,415 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 00:48:00,416 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 00:48:00,416 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2020-07-29 00:48:00,432 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 00:48:00,432 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 00:48:00,434 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 00:48:00,434 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 00:48:00,435 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 00:48:00,435 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 00:48:00,435 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 00:48:00,436 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 00:48:00,436 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 00:48:00,436 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 00:48:00,436 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 00:48:00,437 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-07-29 00:48:00,437 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-07-29 00:48:00,437 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-07-29 00:48:00,438 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-29 00:48:00,438 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-07-29 00:48:00,438 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 00:48:00,439 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 00:48:00,439 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 00:48:00,439 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 00:48:00,440 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-29 00:48:00,440 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-29 00:48:00,440 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 00:48:00,441 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 00:48:00,441 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-29 00:48:00,441 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 00:48:00,441 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-29 00:48:00,442 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 00:48:00,442 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3e28603c63113c1566dc2e06da17c63059f80486 [2020-07-29 00:48:00,810 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 00:48:00,830 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 00:48:00,834 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 00:48:00,836 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 00:48:00,836 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 00:48:00,838 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/count_down-alloca-1.i [2020-07-29 00:48:00,911 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2f3a5a16/e4fc3a4becbe4e82809321522aa25d26/FLAG0f0b84e51 [2020-07-29 00:48:01,429 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 00:48:01,430 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/count_down-alloca-1.i [2020-07-29 00:48:01,442 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2f3a5a16/e4fc3a4becbe4e82809321522aa25d26/FLAG0f0b84e51 [2020-07-29 00:48:01,737 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2f3a5a16/e4fc3a4becbe4e82809321522aa25d26 [2020-07-29 00:48:01,740 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 00:48:01,743 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-07-29 00:48:01,746 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 00:48:01,746 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 00:48:01,751 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 00:48:01,753 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 12:48:01" (1/1) ... [2020-07-29 00:48:01,756 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@132234cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 12:48:01, skipping insertion in model container [2020-07-29 00:48:01,756 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 12:48:01" (1/1) ... [2020-07-29 00:48:01,765 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 00:48:01,812 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 00:48:02,309 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 00:48:02,323 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 00:48:02,364 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 00:48:02,427 INFO L208 MainTranslator]: Completed translation [2020-07-29 00:48:02,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 12:48:02 WrapperNode [2020-07-29 00:48:02,428 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 00:48:02,429 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 00:48:02,429 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 00:48:02,429 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 00:48:02,440 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 12:48:02" (1/1) ... [2020-07-29 00:48:02,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 12:48:02" (1/1) ... [2020-07-29 00:48:02,456 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 12:48:02" (1/1) ... [2020-07-29 00:48:02,456 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 12:48:02" (1/1) ... [2020-07-29 00:48:02,476 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 12:48:02" (1/1) ... [2020-07-29 00:48:02,482 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 12:48:02" (1/1) ... [2020-07-29 00:48:02,485 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 12:48:02" (1/1) ... [2020-07-29 00:48:02,492 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 00:48:02,493 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 00:48:02,493 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 00:48:02,494 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 00:48:02,495 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 12:48:02" (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 00:48:02,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-29 00:48:02,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 00:48:02,558 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-07-29 00:48:02,559 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-07-29 00:48:02,559 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2020-07-29 00:48:02,560 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2020-07-29 00:48:02,560 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2020-07-29 00:48:02,561 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-29 00:48:02,562 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-29 00:48:02,562 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-29 00:48:02,563 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-29 00:48:02,563 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-29 00:48:02,563 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-29 00:48:02,564 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-29 00:48:02,564 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-29 00:48:02,564 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-29 00:48:02,567 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-29 00:48:02,567 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-29 00:48:02,567 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-29 00:48:02,567 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-29 00:48:02,568 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-29 00:48:02,568 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-29 00:48:02,569 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-29 00:48:02,569 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-29 00:48:02,570 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-07-29 00:48:02,571 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-07-29 00:48:02,571 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2020-07-29 00:48:02,572 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2020-07-29 00:48:02,572 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2020-07-29 00:48:02,572 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-29 00:48:02,572 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-29 00:48:02,573 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-29 00:48:02,573 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-29 00:48:02,573 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-29 00:48:02,573 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-29 00:48:02,573 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-29 00:48:02,574 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-29 00:48:02,574 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-29 00:48:02,574 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-29 00:48:02,574 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-29 00:48:02,574 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-29 00:48:02,575 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-29 00:48:02,575 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-29 00:48:02,575 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-29 00:48:02,575 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-29 00:48:02,576 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-29 00:48:02,576 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-29 00:48:02,576 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-29 00:48:02,576 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-29 00:48:02,577 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-29 00:48:02,577 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-29 00:48:02,577 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-29 00:48:02,577 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-29 00:48:02,578 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-29 00:48:02,578 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-29 00:48:02,578 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-29 00:48:02,578 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-29 00:48:02,579 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-29 00:48:02,579 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-29 00:48:02,579 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-29 00:48:02,579 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-29 00:48:02,580 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-29 00:48:02,580 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-29 00:48:02,580 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-29 00:48:02,580 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-29 00:48:02,580 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-29 00:48:02,580 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-29 00:48:02,581 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-29 00:48:02,581 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-29 00:48:02,581 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-29 00:48:02,581 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-29 00:48:02,581 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-29 00:48:02,582 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-29 00:48:02,582 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-29 00:48:02,582 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-29 00:48:02,582 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-29 00:48:02,582 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-29 00:48:02,583 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-29 00:48:02,583 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-29 00:48:02,583 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-29 00:48:02,583 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-29 00:48:02,584 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-29 00:48:02,584 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-29 00:48:02,584 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-29 00:48:02,584 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-29 00:48:02,584 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-29 00:48:02,584 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-29 00:48:02,585 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-29 00:48:02,585 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-29 00:48:02,585 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-29 00:48:02,585 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-29 00:48:02,585 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-29 00:48:02,585 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-29 00:48:02,585 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-29 00:48:02,585 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-29 00:48:02,585 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-29 00:48:02,586 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-29 00:48:02,586 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-29 00:48:02,586 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-29 00:48:02,586 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-29 00:48:02,586 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-29 00:48:02,587 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-29 00:48:02,587 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-29 00:48:02,587 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-29 00:48:02,587 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-29 00:48:02,587 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-29 00:48:02,587 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-29 00:48:02,587 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-29 00:48:02,587 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-29 00:48:02,587 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-29 00:48:02,588 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-29 00:48:02,588 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-29 00:48:02,588 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-29 00:48:02,588 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-29 00:48:02,588 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-29 00:48:02,588 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-29 00:48:02,588 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-29 00:48:02,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 00:48:02,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 00:48:02,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 00:48:02,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 00:48:02,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-29 00:48:02,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 00:48:03,192 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 00:48:03,192 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-29 00:48:03,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 12:48:03 BoogieIcfgContainer [2020-07-29 00:48:03,197 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 00:48:03,200 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-29 00:48:03,201 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-29 00:48:03,205 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-29 00:48:03,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.07 12:48:01" (1/3) ... [2020-07-29 00:48:03,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a585df6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 12:48:03, skipping insertion in model container [2020-07-29 00:48:03,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 12:48:02" (2/3) ... [2020-07-29 00:48:03,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a585df6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 12:48:03, skipping insertion in model container [2020-07-29 00:48:03,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 12:48:03" (3/3) ... [2020-07-29 00:48:03,214 INFO L109 eAbstractionObserver]: Analyzing ICFG count_down-alloca-1.i [2020-07-29 00:48:03,226 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-29 00:48:03,237 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2020-07-29 00:48:03,253 INFO L251 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2020-07-29 00:48:03,278 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-29 00:48:03,279 INFO L376 AbstractCegarLoop]: Hoare is false [2020-07-29 00:48:03,279 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-29 00:48:03,279 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 00:48:03,281 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 00:48:03,291 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-29 00:48:03,291 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 00:48:03,291 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-29 00:48:03,311 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2020-07-29 00:48:03,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-29 00:48:03,324 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 00:48:03,325 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 00:48:03,326 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-07-29 00:48:03,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 00:48:03,333 INFO L82 PathProgramCache]: Analyzing trace with hash -587521551, now seen corresponding path program 1 times [2020-07-29 00:48:03,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 00:48:03,346 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435358614] [2020-07-29 00:48:03,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 00:48:03,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:48:03,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 00:48:03,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:48:03,671 INFO L280 TraceCheckUtils]: 0: Hoare triple {45#(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; {39#true} is VALID [2020-07-29 00:48:03,672 INFO L280 TraceCheckUtils]: 1: Hoare triple {39#true} assume true; {39#true} is VALID [2020-07-29 00:48:03,672 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {39#true} {39#true} #89#return; {39#true} is VALID [2020-07-29 00:48:03,677 INFO L263 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {45#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 00:48:03,677 INFO L280 TraceCheckUtils]: 1: Hoare triple {45#(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; {39#true} is VALID [2020-07-29 00:48:03,678 INFO L280 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2020-07-29 00:48:03,678 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #89#return; {39#true} is VALID [2020-07-29 00:48:03,679 INFO L263 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret10 := main(); {39#true} is VALID [2020-07-29 00:48:03,679 INFO L280 TraceCheckUtils]: 5: Hoare triple {39#true} havoc ~i~0;havoc ~j~0;havoc ~val~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~length~0 := #t~nondet2;havoc #t~nondet2; {39#true} is VALID [2020-07-29 00:48:03,681 INFO L280 TraceCheckUtils]: 6: Hoare triple {39#true} assume ~length~0 < 1 || ~length~0 >= 536870911;~length~0 := 1; {39#true} is VALID [2020-07-29 00:48:03,683 INFO L280 TraceCheckUtils]: 7: Hoare triple {39#true} call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnStack(4 * ~length~0);~arr~0.base, ~arr~0.offset := #t~malloc3.base, #t~malloc3.offset; {44#(not (= main_~arr~0.base 0))} is VALID [2020-07-29 00:48:03,685 INFO L280 TraceCheckUtils]: 8: Hoare triple {44#(not (= main_~arr~0.base 0))} assume ~arr~0.base == 0 && ~arr~0.offset == 0;#res := 0;call ULTIMATE.dealloc(#t~malloc3.base, #t~malloc3.offset);havoc #t~malloc3.base, #t~malloc3.offset; {40#false} is VALID [2020-07-29 00:48:03,685 INFO L280 TraceCheckUtils]: 9: Hoare triple {40#false} assume !(#valid == old(#valid)); {40#false} is VALID [2020-07-29 00:48:03,687 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 00:48:03,688 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435358614] [2020-07-29 00:48:03,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 00:48:03,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 00:48:03,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932738296] [2020-07-29 00:48:03,698 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-07-29 00:48:03,702 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 00:48:03,707 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 00:48:03,738 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:48:03,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 00:48:03,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 00:48:03,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 00:48:03,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 00:48:03,752 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 4 states. [2020-07-29 00:48:04,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:48:04,030 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2020-07-29 00:48:04,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 00:48:04,030 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-07-29 00:48:04,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 00:48:04,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 00:48:04,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2020-07-29 00:48:04,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 00:48:04,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2020-07-29 00:48:04,052 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 44 transitions. [2020-07-29 00:48:04,121 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:48:04,133 INFO L225 Difference]: With dead ends: 36 [2020-07-29 00:48:04,134 INFO L226 Difference]: Without dead ends: 33 [2020-07-29 00:48:04,136 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-29 00:48:04,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-29 00:48:04,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-29 00:48:04,173 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 00:48:04,174 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2020-07-29 00:48:04,175 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2020-07-29 00:48:04,176 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2020-07-29 00:48:04,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:48:04,182 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2020-07-29 00:48:04,182 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2020-07-29 00:48:04,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:48:04,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:48:04,184 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2020-07-29 00:48:04,184 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2020-07-29 00:48:04,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:48:04,190 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2020-07-29 00:48:04,190 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2020-07-29 00:48:04,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:48:04,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:48:04,192 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 00:48:04,192 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 00:48:04,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-29 00:48:04,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2020-07-29 00:48:04,198 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 10 [2020-07-29 00:48:04,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 00:48:04,198 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2020-07-29 00:48:04,199 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 00:48:04,199 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2020-07-29 00:48:04,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-29 00:48:04,200 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 00:48:04,200 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 00:48:04,201 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-29 00:48:04,201 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-07-29 00:48:04,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 00:48:04,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1967514850, now seen corresponding path program 1 times [2020-07-29 00:48:04,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 00:48:04,203 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043343703] [2020-07-29 00:48:04,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 00:48:04,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:48:04,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 00:48:04,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:48:04,313 INFO L280 TraceCheckUtils]: 0: Hoare triple {191#(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; {185#true} is VALID [2020-07-29 00:48:04,313 INFO L280 TraceCheckUtils]: 1: Hoare triple {185#true} assume true; {185#true} is VALID [2020-07-29 00:48:04,314 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {185#true} {185#true} #89#return; {185#true} is VALID [2020-07-29 00:48:04,316 INFO L263 TraceCheckUtils]: 0: Hoare triple {185#true} call ULTIMATE.init(); {191#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 00:48:04,316 INFO L280 TraceCheckUtils]: 1: Hoare triple {191#(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; {185#true} is VALID [2020-07-29 00:48:04,317 INFO L280 TraceCheckUtils]: 2: Hoare triple {185#true} assume true; {185#true} is VALID [2020-07-29 00:48:04,317 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {185#true} {185#true} #89#return; {185#true} is VALID [2020-07-29 00:48:04,317 INFO L263 TraceCheckUtils]: 4: Hoare triple {185#true} call #t~ret10 := main(); {185#true} is VALID [2020-07-29 00:48:04,318 INFO L280 TraceCheckUtils]: 5: Hoare triple {185#true} havoc ~i~0;havoc ~j~0;havoc ~val~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~length~0 := #t~nondet2;havoc #t~nondet2; {185#true} is VALID [2020-07-29 00:48:04,318 INFO L280 TraceCheckUtils]: 6: Hoare triple {185#true} assume ~length~0 < 1 || ~length~0 >= 536870911;~length~0 := 1; {185#true} is VALID [2020-07-29 00:48:04,320 INFO L280 TraceCheckUtils]: 7: Hoare triple {185#true} call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnStack(4 * ~length~0);~arr~0.base, ~arr~0.offset := #t~malloc3.base, #t~malloc3.offset; {190#(= (select |#valid| main_~arr~0.base) 1)} is VALID [2020-07-29 00:48:04,322 INFO L280 TraceCheckUtils]: 8: Hoare triple {190#(= (select |#valid| main_~arr~0.base) 1)} assume !(~arr~0.base == 0 && ~arr~0.offset == 0);~i~0 := 0; {190#(= (select |#valid| main_~arr~0.base) 1)} is VALID [2020-07-29 00:48:04,323 INFO L280 TraceCheckUtils]: 9: Hoare triple {190#(= (select |#valid| main_~arr~0.base) 1)} assume !!(~i~0 < ~length~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~val~0 := #t~nondet5;havoc #t~nondet5; {190#(= (select |#valid| main_~arr~0.base) 1)} is VALID [2020-07-29 00:48:04,324 INFO L280 TraceCheckUtils]: 10: Hoare triple {190#(= (select |#valid| main_~arr~0.base) 1)} assume !(~val~0 < 0); {190#(= (select |#valid| main_~arr~0.base) 1)} is VALID [2020-07-29 00:48:04,325 INFO L280 TraceCheckUtils]: 11: Hoare triple {190#(= (select |#valid| main_~arr~0.base) 1)} assume !(1 == #valid[~arr~0.base]); {186#false} is VALID [2020-07-29 00:48:04,327 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 00:48:04,328 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043343703] [2020-07-29 00:48:04,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 00:48:04,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 00:48:04,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918195855] [2020-07-29 00:48:04,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-07-29 00:48:04,331 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 00:48:04,331 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 00:48:04,352 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:48:04,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 00:48:04,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 00:48:04,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 00:48:04,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 00:48:04,353 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 4 states. [2020-07-29 00:48:04,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:48:04,514 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2020-07-29 00:48:04,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 00:48:04,514 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-07-29 00:48:04,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 00:48:04,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 00:48:04,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2020-07-29 00:48:04,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 00:48:04,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2020-07-29 00:48:04,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 37 transitions. [2020-07-29 00:48:04,581 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:48:04,583 INFO L225 Difference]: With dead ends: 29 [2020-07-29 00:48:04,583 INFO L226 Difference]: Without dead ends: 29 [2020-07-29 00:48:04,585 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 00:48:04,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-29 00:48:04,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-29 00:48:04,589 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 00:48:04,590 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2020-07-29 00:48:04,590 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-29 00:48:04,590 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-29 00:48:04,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:48:04,594 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2020-07-29 00:48:04,594 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2020-07-29 00:48:04,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:48:04,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:48:04,595 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-29 00:48:04,596 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-29 00:48:04,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:48:04,599 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2020-07-29 00:48:04,599 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2020-07-29 00:48:04,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:48:04,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:48:04,601 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 00:48:04,601 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 00:48:04,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-29 00:48:04,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2020-07-29 00:48:04,613 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 12 [2020-07-29 00:48:04,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 00:48:04,614 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2020-07-29 00:48:04,614 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 00:48:04,614 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2020-07-29 00:48:04,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-29 00:48:04,615 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 00:48:04,616 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 00:48:04,616 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-29 00:48:04,616 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-07-29 00:48:04,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 00:48:04,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1967514849, now seen corresponding path program 1 times [2020-07-29 00:48:04,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 00:48:04,618 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068783815] [2020-07-29 00:48:04,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 00:48:04,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:48:04,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 00:48:04,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:48:04,803 INFO L280 TraceCheckUtils]: 0: Hoare triple {318#(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; {310#true} is VALID [2020-07-29 00:48:04,804 INFO L280 TraceCheckUtils]: 1: Hoare triple {310#true} assume true; {310#true} is VALID [2020-07-29 00:48:04,804 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {310#true} {310#true} #89#return; {310#true} is VALID [2020-07-29 00:48:04,805 INFO L263 TraceCheckUtils]: 0: Hoare triple {310#true} call ULTIMATE.init(); {318#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 00:48:04,806 INFO L280 TraceCheckUtils]: 1: Hoare triple {318#(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; {310#true} is VALID [2020-07-29 00:48:04,806 INFO L280 TraceCheckUtils]: 2: Hoare triple {310#true} assume true; {310#true} is VALID [2020-07-29 00:48:04,807 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {310#true} {310#true} #89#return; {310#true} is VALID [2020-07-29 00:48:04,807 INFO L263 TraceCheckUtils]: 4: Hoare triple {310#true} call #t~ret10 := main(); {310#true} is VALID [2020-07-29 00:48:04,807 INFO L280 TraceCheckUtils]: 5: Hoare triple {310#true} havoc ~i~0;havoc ~j~0;havoc ~val~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~length~0 := #t~nondet2;havoc #t~nondet2; {310#true} is VALID [2020-07-29 00:48:04,810 INFO L280 TraceCheckUtils]: 6: Hoare triple {310#true} assume ~length~0 < 1 || ~length~0 >= 536870911;~length~0 := 1; {315#(<= 1 main_~length~0)} is VALID [2020-07-29 00:48:04,812 INFO L280 TraceCheckUtils]: 7: Hoare triple {315#(<= 1 main_~length~0)} call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnStack(4 * ~length~0);~arr~0.base, ~arr~0.offset := #t~malloc3.base, #t~malloc3.offset; {316#(and (= 0 main_~arr~0.offset) (<= 4 (select |#length| main_~arr~0.base)))} is VALID [2020-07-29 00:48:04,813 INFO L280 TraceCheckUtils]: 8: Hoare triple {316#(and (= 0 main_~arr~0.offset) (<= 4 (select |#length| main_~arr~0.base)))} assume !(~arr~0.base == 0 && ~arr~0.offset == 0);~i~0 := 0; {317#(and (= 0 main_~arr~0.offset) (= 0 main_~i~0) (<= 4 (select |#length| main_~arr~0.base)))} is VALID [2020-07-29 00:48:04,814 INFO L280 TraceCheckUtils]: 9: Hoare triple {317#(and (= 0 main_~arr~0.offset) (= 0 main_~i~0) (<= 4 (select |#length| main_~arr~0.base)))} assume !!(~i~0 < ~length~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~val~0 := #t~nondet5;havoc #t~nondet5; {317#(and (= 0 main_~arr~0.offset) (= 0 main_~i~0) (<= 4 (select |#length| main_~arr~0.base)))} is VALID [2020-07-29 00:48:04,816 INFO L280 TraceCheckUtils]: 10: Hoare triple {317#(and (= 0 main_~arr~0.offset) (= 0 main_~i~0) (<= 4 (select |#length| main_~arr~0.base)))} assume !(~val~0 < 0); {317#(and (= 0 main_~arr~0.offset) (= 0 main_~i~0) (<= 4 (select |#length| main_~arr~0.base)))} is VALID [2020-07-29 00:48:04,817 INFO L280 TraceCheckUtils]: 11: Hoare triple {317#(and (= 0 main_~arr~0.offset) (= 0 main_~i~0) (<= 4 (select |#length| main_~arr~0.base)))} assume !(4 + (~arr~0.offset + 4 * ~i~0) <= #length[~arr~0.base] && 0 <= ~arr~0.offset + 4 * ~i~0); {311#false} is VALID [2020-07-29 00:48:04,819 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 00:48:04,819 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068783815] [2020-07-29 00:48:04,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 00:48:04,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 00:48:04,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296229503] [2020-07-29 00:48:04,820 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-07-29 00:48:04,821 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 00:48:04,821 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 00:48:04,839 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:48:04,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-29 00:48:04,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 00:48:04,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 00:48:04,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-29 00:48:04,840 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 6 states. [2020-07-29 00:48:05,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:48:05,184 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2020-07-29 00:48:05,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 00:48:05,184 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-07-29 00:48:05,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 00:48:05,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 00:48:05,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2020-07-29 00:48:05,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 00:48:05,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2020-07-29 00:48:05,189 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2020-07-29 00:48:05,252 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:48:05,254 INFO L225 Difference]: With dead ends: 33 [2020-07-29 00:48:05,254 INFO L226 Difference]: Without dead ends: 33 [2020-07-29 00:48:05,255 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-29 00:48:05,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-29 00:48:05,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2020-07-29 00:48:05,259 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 00:48:05,259 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 32 states. [2020-07-29 00:48:05,259 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 32 states. [2020-07-29 00:48:05,259 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 32 states. [2020-07-29 00:48:05,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:48:05,262 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2020-07-29 00:48:05,262 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2020-07-29 00:48:05,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:48:05,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:48:05,263 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 33 states. [2020-07-29 00:48:05,263 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 33 states. [2020-07-29 00:48:05,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:48:05,265 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2020-07-29 00:48:05,266 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2020-07-29 00:48:05,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:48:05,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:48:05,267 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 00:48:05,267 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 00:48:05,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-29 00:48:05,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2020-07-29 00:48:05,269 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 12 [2020-07-29 00:48:05,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 00:48:05,270 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2020-07-29 00:48:05,270 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-29 00:48:05,270 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2020-07-29 00:48:05,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-29 00:48:05,271 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 00:48:05,271 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 00:48:05,271 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-29 00:48:05,272 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-07-29 00:48:05,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 00:48:05,272 INFO L82 PathProgramCache]: Analyzing trace with hash 467596310, now seen corresponding path program 1 times [2020-07-29 00:48:05,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 00:48:05,273 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200866490] [2020-07-29 00:48:05,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 00:48:05,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:48:05,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 00:48:05,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:48:05,395 INFO L280 TraceCheckUtils]: 0: Hoare triple {466#(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; {458#true} is VALID [2020-07-29 00:48:05,395 INFO L280 TraceCheckUtils]: 1: Hoare triple {458#true} assume true; {458#true} is VALID [2020-07-29 00:48:05,396 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {458#true} {458#true} #89#return; {458#true} is VALID [2020-07-29 00:48:05,397 INFO L263 TraceCheckUtils]: 0: Hoare triple {458#true} call ULTIMATE.init(); {466#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 00:48:05,398 INFO L280 TraceCheckUtils]: 1: Hoare triple {466#(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; {458#true} is VALID [2020-07-29 00:48:05,398 INFO L280 TraceCheckUtils]: 2: Hoare triple {458#true} assume true; {458#true} is VALID [2020-07-29 00:48:05,398 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {458#true} {458#true} #89#return; {458#true} is VALID [2020-07-29 00:48:05,399 INFO L263 TraceCheckUtils]: 4: Hoare triple {458#true} call #t~ret10 := main(); {458#true} is VALID [2020-07-29 00:48:05,399 INFO L280 TraceCheckUtils]: 5: Hoare triple {458#true} havoc ~i~0;havoc ~j~0;havoc ~val~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~length~0 := #t~nondet2;havoc #t~nondet2; {458#true} is VALID [2020-07-29 00:48:05,409 INFO L280 TraceCheckUtils]: 6: Hoare triple {458#true} assume ~length~0 < 1 || ~length~0 >= 536870911;~length~0 := 1; {463#(<= main_~length~0 1)} is VALID [2020-07-29 00:48:05,416 INFO L280 TraceCheckUtils]: 7: Hoare triple {463#(<= main_~length~0 1)} call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnStack(4 * ~length~0);~arr~0.base, ~arr~0.offset := #t~malloc3.base, #t~malloc3.offset; {463#(<= main_~length~0 1)} is VALID [2020-07-29 00:48:05,417 INFO L280 TraceCheckUtils]: 8: Hoare triple {463#(<= main_~length~0 1)} assume !(~arr~0.base == 0 && ~arr~0.offset == 0);~i~0 := 0; {464#(and (= 0 main_~i~0) (<= main_~length~0 1))} is VALID [2020-07-29 00:48:05,419 INFO L280 TraceCheckUtils]: 9: Hoare triple {464#(and (= 0 main_~i~0) (<= main_~length~0 1))} assume !!(~i~0 < ~length~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~val~0 := #t~nondet5;havoc #t~nondet5; {464#(and (= 0 main_~i~0) (<= main_~length~0 1))} is VALID [2020-07-29 00:48:05,420 INFO L280 TraceCheckUtils]: 10: Hoare triple {464#(and (= 0 main_~i~0) (<= main_~length~0 1))} assume !(~val~0 < 0); {464#(and (= 0 main_~i~0) (<= main_~length~0 1))} is VALID [2020-07-29 00:48:05,422 INFO L280 TraceCheckUtils]: 11: Hoare triple {464#(and (= 0 main_~i~0) (<= main_~length~0 1))} SUMMARY for call write~int(~val~0, ~arr~0.base, ~arr~0.offset + 4 * ~i~0, 4); srcloc: L521-2 {464#(and (= 0 main_~i~0) (<= main_~length~0 1))} is VALID [2020-07-29 00:48:05,423 INFO L280 TraceCheckUtils]: 12: Hoare triple {464#(and (= 0 main_~i~0) (<= main_~length~0 1))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {465#(<= main_~length~0 main_~i~0)} is VALID [2020-07-29 00:48:05,424 INFO L280 TraceCheckUtils]: 13: Hoare triple {465#(<= main_~length~0 main_~i~0)} assume !!(~i~0 < ~length~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~val~0 := #t~nondet5;havoc #t~nondet5; {459#false} is VALID [2020-07-29 00:48:05,424 INFO L280 TraceCheckUtils]: 14: Hoare triple {459#false} assume !(~val~0 < 0); {459#false} is VALID [2020-07-29 00:48:05,425 INFO L280 TraceCheckUtils]: 15: Hoare triple {459#false} assume !(4 + (~arr~0.offset + 4 * ~i~0) <= #length[~arr~0.base] && 0 <= ~arr~0.offset + 4 * ~i~0); {459#false} is VALID [2020-07-29 00:48:05,429 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 00:48:05,429 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200866490] [2020-07-29 00:48:05,429 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607817658] [2020-07-29 00:48:05,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 00:48:05,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:48:05,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 00:48:05,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:48:05,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 00:48:05,755 INFO L263 TraceCheckUtils]: 0: Hoare triple {458#true} call ULTIMATE.init(); {458#true} is VALID [2020-07-29 00:48:05,756 INFO L280 TraceCheckUtils]: 1: Hoare triple {458#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {458#true} is VALID [2020-07-29 00:48:05,756 INFO L280 TraceCheckUtils]: 2: Hoare triple {458#true} assume true; {458#true} is VALID [2020-07-29 00:48:05,757 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {458#true} {458#true} #89#return; {458#true} is VALID [2020-07-29 00:48:05,757 INFO L263 TraceCheckUtils]: 4: Hoare triple {458#true} call #t~ret10 := main(); {458#true} is VALID [2020-07-29 00:48:05,758 INFO L280 TraceCheckUtils]: 5: Hoare triple {458#true} havoc ~i~0;havoc ~j~0;havoc ~val~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~length~0 := #t~nondet2;havoc #t~nondet2; {458#true} is VALID [2020-07-29 00:48:05,759 INFO L280 TraceCheckUtils]: 6: Hoare triple {458#true} assume ~length~0 < 1 || ~length~0 >= 536870911;~length~0 := 1; {463#(<= main_~length~0 1)} is VALID [2020-07-29 00:48:05,760 INFO L280 TraceCheckUtils]: 7: Hoare triple {463#(<= main_~length~0 1)} call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnStack(4 * ~length~0);~arr~0.base, ~arr~0.offset := #t~malloc3.base, #t~malloc3.offset; {463#(<= main_~length~0 1)} is VALID [2020-07-29 00:48:05,761 INFO L280 TraceCheckUtils]: 8: Hoare triple {463#(<= main_~length~0 1)} assume !(~arr~0.base == 0 && ~arr~0.offset == 0);~i~0 := 0; {494#(and (<= 0 main_~i~0) (<= main_~length~0 1))} is VALID [2020-07-29 00:48:05,762 INFO L280 TraceCheckUtils]: 9: Hoare triple {494#(and (<= 0 main_~i~0) (<= main_~length~0 1))} assume !!(~i~0 < ~length~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~val~0 := #t~nondet5;havoc #t~nondet5; {494#(and (<= 0 main_~i~0) (<= main_~length~0 1))} is VALID [2020-07-29 00:48:05,764 INFO L280 TraceCheckUtils]: 10: Hoare triple {494#(and (<= 0 main_~i~0) (<= main_~length~0 1))} assume !(~val~0 < 0); {494#(and (<= 0 main_~i~0) (<= main_~length~0 1))} is VALID [2020-07-29 00:48:05,766 INFO L280 TraceCheckUtils]: 11: Hoare triple {494#(and (<= 0 main_~i~0) (<= main_~length~0 1))} SUMMARY for call write~int(~val~0, ~arr~0.base, ~arr~0.offset + 4 * ~i~0, 4); srcloc: L521-2 {494#(and (<= 0 main_~i~0) (<= main_~length~0 1))} is VALID [2020-07-29 00:48:05,768 INFO L280 TraceCheckUtils]: 12: Hoare triple {494#(and (<= 0 main_~i~0) (<= main_~length~0 1))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {507#(and (<= main_~length~0 1) (<= 1 main_~i~0))} is VALID [2020-07-29 00:48:05,770 INFO L280 TraceCheckUtils]: 13: Hoare triple {507#(and (<= main_~length~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~length~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~val~0 := #t~nondet5;havoc #t~nondet5; {459#false} is VALID [2020-07-29 00:48:05,771 INFO L280 TraceCheckUtils]: 14: Hoare triple {459#false} assume !(~val~0 < 0); {459#false} is VALID [2020-07-29 00:48:05,771 INFO L280 TraceCheckUtils]: 15: Hoare triple {459#false} assume !(4 + (~arr~0.offset + 4 * ~i~0) <= #length[~arr~0.base] && 0 <= ~arr~0.offset + 4 * ~i~0); {459#false} is VALID [2020-07-29 00:48:05,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 00:48:05,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-29 00:48:05,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2020-07-29 00:48:05,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201470748] [2020-07-29 00:48:05,774 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-29 00:48:05,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 00:48:05,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 00:48:05,798 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:48:05,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 00:48:05,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 00:48:05,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 00:48:05,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-29 00:48:05,799 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 5 states. [2020-07-29 00:48:05,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:48:05,996 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2020-07-29 00:48:05,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 00:48:05,996 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-29 00:48:05,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 00:48:05,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 00:48:06,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2020-07-29 00:48:06,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 00:48:06,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2020-07-29 00:48:06,003 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 58 transitions. [2020-07-29 00:48:06,076 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:48:06,078 INFO L225 Difference]: With dead ends: 54 [2020-07-29 00:48:06,079 INFO L226 Difference]: Without dead ends: 54 [2020-07-29 00:48:06,079 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-29 00:48:06,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-07-29 00:48:06,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2020-07-29 00:48:06,084 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 00:48:06,084 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 39 states. [2020-07-29 00:48:06,084 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 39 states. [2020-07-29 00:48:06,084 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 39 states. [2020-07-29 00:48:06,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:48:06,088 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2020-07-29 00:48:06,088 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2020-07-29 00:48:06,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:48:06,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:48:06,090 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 54 states. [2020-07-29 00:48:06,090 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 54 states. [2020-07-29 00:48:06,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:48:06,093 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2020-07-29 00:48:06,094 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2020-07-29 00:48:06,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:48:06,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:48:06,095 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 00:48:06,095 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 00:48:06,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-29 00:48:06,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2020-07-29 00:48:06,097 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 16 [2020-07-29 00:48:06,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 00:48:06,098 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2020-07-29 00:48:06,098 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 00:48:06,098 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2020-07-29 00:48:06,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-29 00:48:06,099 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 00:48:06,099 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 00:48:06,312 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 00:48:06,313 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-07-29 00:48:06,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 00:48:06,313 INFO L82 PathProgramCache]: Analyzing trace with hash 74569300, now seen corresponding path program 1 times [2020-07-29 00:48:06,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 00:48:06,314 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706763482] [2020-07-29 00:48:06,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 00:48:06,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:48:06,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 00:48:06,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:48:06,511 INFO L280 TraceCheckUtils]: 0: Hoare triple {726#(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; {717#true} is VALID [2020-07-29 00:48:06,511 INFO L280 TraceCheckUtils]: 1: Hoare triple {717#true} assume true; {717#true} is VALID [2020-07-29 00:48:06,511 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {717#true} {717#true} #89#return; {717#true} is VALID [2020-07-29 00:48:06,513 INFO L263 TraceCheckUtils]: 0: Hoare triple {717#true} call ULTIMATE.init(); {726#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 00:48:06,513 INFO L280 TraceCheckUtils]: 1: Hoare triple {726#(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; {717#true} is VALID [2020-07-29 00:48:06,513 INFO L280 TraceCheckUtils]: 2: Hoare triple {717#true} assume true; {717#true} is VALID [2020-07-29 00:48:06,514 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {717#true} {717#true} #89#return; {717#true} is VALID [2020-07-29 00:48:06,514 INFO L263 TraceCheckUtils]: 4: Hoare triple {717#true} call #t~ret10 := main(); {717#true} is VALID [2020-07-29 00:48:06,514 INFO L280 TraceCheckUtils]: 5: Hoare triple {717#true} havoc ~i~0;havoc ~j~0;havoc ~val~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~length~0 := #t~nondet2;havoc #t~nondet2; {717#true} is VALID [2020-07-29 00:48:06,514 INFO L280 TraceCheckUtils]: 6: Hoare triple {717#true} assume !(~length~0 < 1 || ~length~0 >= 536870911); {717#true} is VALID [2020-07-29 00:48:06,516 INFO L280 TraceCheckUtils]: 7: Hoare triple {717#true} call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnStack(4 * ~length~0);~arr~0.base, ~arr~0.offset := #t~malloc3.base, #t~malloc3.offset; {722#(and (= 0 main_~arr~0.offset) (= (select |#length| main_~arr~0.base) (* 4 main_~length~0)))} is VALID [2020-07-29 00:48:06,518 INFO L280 TraceCheckUtils]: 8: Hoare triple {722#(and (= 0 main_~arr~0.offset) (= (select |#length| main_~arr~0.base) (* 4 main_~length~0)))} assume !(~arr~0.base == 0 && ~arr~0.offset == 0);~i~0 := 0; {723#(and (= 0 main_~arr~0.offset) (= 0 main_~i~0) (= (select |#length| main_~arr~0.base) (* 4 main_~length~0)))} is VALID [2020-07-29 00:48:06,519 INFO L280 TraceCheckUtils]: 9: Hoare triple {723#(and (= 0 main_~arr~0.offset) (= 0 main_~i~0) (= (select |#length| main_~arr~0.base) (* 4 main_~length~0)))} assume !!(~i~0 < ~length~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~val~0 := #t~nondet5;havoc #t~nondet5; {723#(and (= 0 main_~arr~0.offset) (= 0 main_~i~0) (= (select |#length| main_~arr~0.base) (* 4 main_~length~0)))} is VALID [2020-07-29 00:48:06,520 INFO L280 TraceCheckUtils]: 10: Hoare triple {723#(and (= 0 main_~arr~0.offset) (= 0 main_~i~0) (= (select |#length| main_~arr~0.base) (* 4 main_~length~0)))} assume !(~val~0 < 0); {723#(and (= 0 main_~arr~0.offset) (= 0 main_~i~0) (= (select |#length| main_~arr~0.base) (* 4 main_~length~0)))} is VALID [2020-07-29 00:48:06,521 INFO L280 TraceCheckUtils]: 11: Hoare triple {723#(and (= 0 main_~arr~0.offset) (= 0 main_~i~0) (= (select |#length| main_~arr~0.base) (* 4 main_~length~0)))} SUMMARY for call write~int(~val~0, ~arr~0.base, ~arr~0.offset + 4 * ~i~0, 4); srcloc: L521-2 {723#(and (= 0 main_~arr~0.offset) (= 0 main_~i~0) (= (select |#length| main_~arr~0.base) (* 4 main_~length~0)))} is VALID [2020-07-29 00:48:06,523 INFO L280 TraceCheckUtils]: 12: Hoare triple {723#(and (= 0 main_~arr~0.offset) (= 0 main_~i~0) (= (select |#length| main_~arr~0.base) (* 4 main_~length~0)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {724#(and (= 0 main_~arr~0.offset) (= (select |#length| main_~arr~0.base) (* 4 main_~length~0)) (<= 1 main_~i~0))} is VALID [2020-07-29 00:48:06,524 INFO L280 TraceCheckUtils]: 13: Hoare triple {724#(and (= 0 main_~arr~0.offset) (= (select |#length| main_~arr~0.base) (* 4 main_~length~0)) (<= 1 main_~i~0))} assume !!(~i~0 < ~length~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~val~0 := #t~nondet5;havoc #t~nondet5; {725#(and (<= (+ (* 4 main_~i~0) 4) (select |#length| main_~arr~0.base)) (= 0 main_~arr~0.offset) (<= 1 main_~i~0))} is VALID [2020-07-29 00:48:06,525 INFO L280 TraceCheckUtils]: 14: Hoare triple {725#(and (<= (+ (* 4 main_~i~0) 4) (select |#length| main_~arr~0.base)) (= 0 main_~arr~0.offset) (<= 1 main_~i~0))} assume !(~val~0 < 0); {725#(and (<= (+ (* 4 main_~i~0) 4) (select |#length| main_~arr~0.base)) (= 0 main_~arr~0.offset) (<= 1 main_~i~0))} is VALID [2020-07-29 00:48:06,527 INFO L280 TraceCheckUtils]: 15: Hoare triple {725#(and (<= (+ (* 4 main_~i~0) 4) (select |#length| main_~arr~0.base)) (= 0 main_~arr~0.offset) (<= 1 main_~i~0))} assume !(4 + (~arr~0.offset + 4 * ~i~0) <= #length[~arr~0.base] && 0 <= ~arr~0.offset + 4 * ~i~0); {718#false} is VALID [2020-07-29 00:48:06,528 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 00:48:06,529 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706763482] [2020-07-29 00:48:06,529 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120662484] [2020-07-29 00:48:06,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 00:48:06,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:48:06,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-29 00:48:06,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:48:06,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 00:48:06,677 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2020-07-29 00:48:06,678 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 00:48:06,689 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 00:48:06,689 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 00:48:06,690 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2020-07-29 00:48:06,693 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 00:48:06,694 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_13|]. (and (= |#length| (store |v_#length_13| main_~arr~0.base (* main_~length~0 4))) (= 0 main_~arr~0.offset)) [2020-07-29 00:48:06,694 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 main_~arr~0.offset) (= (select |#length| main_~arr~0.base) (* main_~length~0 4))) [2020-07-29 00:48:06,808 INFO L263 TraceCheckUtils]: 0: Hoare triple {717#true} call ULTIMATE.init(); {717#true} is VALID [2020-07-29 00:48:06,809 INFO L280 TraceCheckUtils]: 1: Hoare triple {717#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {717#true} is VALID [2020-07-29 00:48:06,809 INFO L280 TraceCheckUtils]: 2: Hoare triple {717#true} assume true; {717#true} is VALID [2020-07-29 00:48:06,809 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {717#true} {717#true} #89#return; {717#true} is VALID [2020-07-29 00:48:06,810 INFO L263 TraceCheckUtils]: 4: Hoare triple {717#true} call #t~ret10 := main(); {717#true} is VALID [2020-07-29 00:48:06,810 INFO L280 TraceCheckUtils]: 5: Hoare triple {717#true} havoc ~i~0;havoc ~j~0;havoc ~val~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~length~0 := #t~nondet2;havoc #t~nondet2; {717#true} is VALID [2020-07-29 00:48:06,810 INFO L280 TraceCheckUtils]: 6: Hoare triple {717#true} assume !(~length~0 < 1 || ~length~0 >= 536870911); {717#true} is VALID [2020-07-29 00:48:06,812 INFO L280 TraceCheckUtils]: 7: Hoare triple {717#true} call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnStack(4 * ~length~0);~arr~0.base, ~arr~0.offset := #t~malloc3.base, #t~malloc3.offset; {722#(and (= 0 main_~arr~0.offset) (= (select |#length| main_~arr~0.base) (* 4 main_~length~0)))} is VALID [2020-07-29 00:48:06,813 INFO L280 TraceCheckUtils]: 8: Hoare triple {722#(and (= 0 main_~arr~0.offset) (= (select |#length| main_~arr~0.base) (* 4 main_~length~0)))} assume !(~arr~0.base == 0 && ~arr~0.offset == 0);~i~0 := 0; {754#(and (<= 0 main_~i~0) (= 0 main_~arr~0.offset) (= (select |#length| main_~arr~0.base) (* 4 main_~length~0)))} is VALID [2020-07-29 00:48:06,814 INFO L280 TraceCheckUtils]: 9: Hoare triple {754#(and (<= 0 main_~i~0) (= 0 main_~arr~0.offset) (= (select |#length| main_~arr~0.base) (* 4 main_~length~0)))} assume !!(~i~0 < ~length~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~val~0 := #t~nondet5;havoc #t~nondet5; {754#(and (<= 0 main_~i~0) (= 0 main_~arr~0.offset) (= (select |#length| main_~arr~0.base) (* 4 main_~length~0)))} is VALID [2020-07-29 00:48:06,815 INFO L280 TraceCheckUtils]: 10: Hoare triple {754#(and (<= 0 main_~i~0) (= 0 main_~arr~0.offset) (= (select |#length| main_~arr~0.base) (* 4 main_~length~0)))} assume !(~val~0 < 0); {754#(and (<= 0 main_~i~0) (= 0 main_~arr~0.offset) (= (select |#length| main_~arr~0.base) (* 4 main_~length~0)))} is VALID [2020-07-29 00:48:06,816 INFO L280 TraceCheckUtils]: 11: Hoare triple {754#(and (<= 0 main_~i~0) (= 0 main_~arr~0.offset) (= (select |#length| main_~arr~0.base) (* 4 main_~length~0)))} SUMMARY for call write~int(~val~0, ~arr~0.base, ~arr~0.offset + 4 * ~i~0, 4); srcloc: L521-2 {754#(and (<= 0 main_~i~0) (= 0 main_~arr~0.offset) (= (select |#length| main_~arr~0.base) (* 4 main_~length~0)))} is VALID [2020-07-29 00:48:06,817 INFO L280 TraceCheckUtils]: 12: Hoare triple {754#(and (<= 0 main_~i~0) (= 0 main_~arr~0.offset) (= (select |#length| main_~arr~0.base) (* 4 main_~length~0)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {724#(and (= 0 main_~arr~0.offset) (= (select |#length| main_~arr~0.base) (* 4 main_~length~0)) (<= 1 main_~i~0))} is VALID [2020-07-29 00:48:06,819 INFO L280 TraceCheckUtils]: 13: Hoare triple {724#(and (= 0 main_~arr~0.offset) (= (select |#length| main_~arr~0.base) (* 4 main_~length~0)) (<= 1 main_~i~0))} assume !!(~i~0 < ~length~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~val~0 := #t~nondet5;havoc #t~nondet5; {770#(and (= (mod (* (select |#length| main_~arr~0.base) 3) (- 4)) 0) (< main_~i~0 (div (* (select |#length| main_~arr~0.base) (- 1)) (- 4))) (= 0 main_~arr~0.offset) (<= 1 main_~i~0))} is VALID [2020-07-29 00:48:06,820 INFO L280 TraceCheckUtils]: 14: Hoare triple {770#(and (= (mod (* (select |#length| main_~arr~0.base) 3) (- 4)) 0) (< main_~i~0 (div (* (select |#length| main_~arr~0.base) (- 1)) (- 4))) (= 0 main_~arr~0.offset) (<= 1 main_~i~0))} assume !(~val~0 < 0); {770#(and (= (mod (* (select |#length| main_~arr~0.base) 3) (- 4)) 0) (< main_~i~0 (div (* (select |#length| main_~arr~0.base) (- 1)) (- 4))) (= 0 main_~arr~0.offset) (<= 1 main_~i~0))} is VALID [2020-07-29 00:48:06,822 INFO L280 TraceCheckUtils]: 15: Hoare triple {770#(and (= (mod (* (select |#length| main_~arr~0.base) 3) (- 4)) 0) (< main_~i~0 (div (* (select |#length| main_~arr~0.base) (- 1)) (- 4))) (= 0 main_~arr~0.offset) (<= 1 main_~i~0))} assume !(4 + (~arr~0.offset + 4 * ~i~0) <= #length[~arr~0.base] && 0 <= ~arr~0.offset + 4 * ~i~0); {718#false} is VALID [2020-07-29 00:48:06,824 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 00:48:06,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 00:48:06,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2020-07-29 00:48:06,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185300314] [2020-07-29 00:48:06,825 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2020-07-29 00:48:06,825 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 00:48:06,826 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 00:48:06,858 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:48:06,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-29 00:48:06,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 00:48:06,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-29 00:48:06,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-29 00:48:06,859 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 9 states. [2020-07-29 00:48:07,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:48:07,331 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2020-07-29 00:48:07,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 00:48:07,331 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2020-07-29 00:48:07,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 00:48:07,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 00:48:07,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2020-07-29 00:48:07,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 00:48:07,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2020-07-29 00:48:07,336 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 38 transitions. [2020-07-29 00:48:07,384 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:48:07,385 INFO L225 Difference]: With dead ends: 39 [2020-07-29 00:48:07,386 INFO L226 Difference]: Without dead ends: 39 [2020-07-29 00:48:07,386 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-07-29 00:48:07,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-29 00:48:07,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2020-07-29 00:48:07,390 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 00:48:07,390 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 36 states. [2020-07-29 00:48:07,390 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 36 states. [2020-07-29 00:48:07,391 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 36 states. [2020-07-29 00:48:07,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:48:07,393 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2020-07-29 00:48:07,394 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2020-07-29 00:48:07,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:48:07,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:48:07,394 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 39 states. [2020-07-29 00:48:07,395 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 39 states. [2020-07-29 00:48:07,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:48:07,397 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2020-07-29 00:48:07,397 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2020-07-29 00:48:07,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:48:07,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:48:07,398 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 00:48:07,399 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 00:48:07,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-29 00:48:07,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2020-07-29 00:48:07,401 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 16 [2020-07-29 00:48:07,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 00:48:07,401 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2020-07-29 00:48:07,401 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-29 00:48:07,402 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2020-07-29 00:48:07,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-29 00:48:07,402 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 00:48:07,402 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 00:48:07,615 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 00:48:07,616 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-07-29 00:48:07,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 00:48:07,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1610534241, now seen corresponding path program 1 times [2020-07-29 00:48:07,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 00:48:07,618 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815232408] [2020-07-29 00:48:07,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 00:48:07,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:48:07,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 00:48:07,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:48:07,759 INFO L280 TraceCheckUtils]: 0: Hoare triple {940#(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; {931#true} is VALID [2020-07-29 00:48:07,760 INFO L280 TraceCheckUtils]: 1: Hoare triple {931#true} assume true; {931#true} is VALID [2020-07-29 00:48:07,760 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {931#true} {931#true} #89#return; {931#true} is VALID [2020-07-29 00:48:07,761 INFO L263 TraceCheckUtils]: 0: Hoare triple {931#true} call ULTIMATE.init(); {940#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 00:48:07,761 INFO L280 TraceCheckUtils]: 1: Hoare triple {940#(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; {931#true} is VALID [2020-07-29 00:48:07,762 INFO L280 TraceCheckUtils]: 2: Hoare triple {931#true} assume true; {931#true} is VALID [2020-07-29 00:48:07,762 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {931#true} {931#true} #89#return; {931#true} is VALID [2020-07-29 00:48:07,762 INFO L263 TraceCheckUtils]: 4: Hoare triple {931#true} call #t~ret10 := main(); {931#true} is VALID [2020-07-29 00:48:07,762 INFO L280 TraceCheckUtils]: 5: Hoare triple {931#true} havoc ~i~0;havoc ~j~0;havoc ~val~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~length~0 := #t~nondet2;havoc #t~nondet2; {931#true} is VALID [2020-07-29 00:48:07,763 INFO L280 TraceCheckUtils]: 6: Hoare triple {931#true} assume ~length~0 < 1 || ~length~0 >= 536870911;~length~0 := 1; {931#true} is VALID [2020-07-29 00:48:07,778 INFO L280 TraceCheckUtils]: 7: Hoare triple {931#true} call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnStack(4 * ~length~0);~arr~0.base, ~arr~0.offset := #t~malloc3.base, #t~malloc3.offset; {936#(= 0 main_~arr~0.offset)} is VALID [2020-07-29 00:48:07,780 INFO L280 TraceCheckUtils]: 8: Hoare triple {936#(= 0 main_~arr~0.offset)} assume !(~arr~0.base == 0 && ~arr~0.offset == 0);~i~0 := 0; {937#(and (= 0 main_~arr~0.offset) (= 0 main_~i~0))} is VALID [2020-07-29 00:48:07,781 INFO L280 TraceCheckUtils]: 9: Hoare triple {937#(and (= 0 main_~arr~0.offset) (= 0 main_~i~0))} assume !!(~i~0 < ~length~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~val~0 := #t~nondet5;havoc #t~nondet5; {937#(and (= 0 main_~arr~0.offset) (= 0 main_~i~0))} is VALID [2020-07-29 00:48:07,781 INFO L280 TraceCheckUtils]: 10: Hoare triple {937#(and (= 0 main_~arr~0.offset) (= 0 main_~i~0))} assume !(~val~0 < 0); {937#(and (= 0 main_~arr~0.offset) (= 0 main_~i~0))} is VALID [2020-07-29 00:48:07,782 INFO L280 TraceCheckUtils]: 11: Hoare triple {937#(and (= 0 main_~arr~0.offset) (= 0 main_~i~0))} SUMMARY for call write~int(~val~0, ~arr~0.base, ~arr~0.offset + 4 * ~i~0, 4); srcloc: L521-2 {938#(and (= 0 main_~arr~0.offset) (<= (+ main_~arr~0.offset 4) (select |#length| main_~arr~0.base)))} is VALID [2020-07-29 00:48:07,785 INFO L280 TraceCheckUtils]: 12: Hoare triple {938#(and (= 0 main_~arr~0.offset) (<= (+ main_~arr~0.offset 4) (select |#length| main_~arr~0.base)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {938#(and (= 0 main_~arr~0.offset) (<= (+ main_~arr~0.offset 4) (select |#length| main_~arr~0.base)))} is VALID [2020-07-29 00:48:07,791 INFO L280 TraceCheckUtils]: 13: Hoare triple {938#(and (= 0 main_~arr~0.offset) (<= (+ main_~arr~0.offset 4) (select |#length| main_~arr~0.base)))} assume !(~i~0 < ~length~0); {938#(and (= 0 main_~arr~0.offset) (<= (+ main_~arr~0.offset 4) (select |#length| main_~arr~0.base)))} is VALID [2020-07-29 00:48:07,792 INFO L280 TraceCheckUtils]: 14: Hoare triple {938#(and (= 0 main_~arr~0.offset) (<= (+ main_~arr~0.offset 4) (select |#length| main_~arr~0.base)))} ~j~0 := 0; {939#(and (= 0 main_~arr~0.offset) (= 0 main_~j~0) (<= (+ main_~arr~0.offset 4) (select |#length| main_~arr~0.base)))} is VALID [2020-07-29 00:48:07,793 INFO L280 TraceCheckUtils]: 15: Hoare triple {939#(and (= 0 main_~arr~0.offset) (= 0 main_~j~0) (<= (+ main_~arr~0.offset 4) (select |#length| main_~arr~0.base)))} assume !!(~j~0 < ~length~0); {939#(and (= 0 main_~arr~0.offset) (= 0 main_~j~0) (<= (+ main_~arr~0.offset 4) (select |#length| main_~arr~0.base)))} is VALID [2020-07-29 00:48:07,793 INFO L280 TraceCheckUtils]: 16: Hoare triple {939#(and (= 0 main_~arr~0.offset) (= 0 main_~j~0) (<= (+ main_~arr~0.offset 4) (select |#length| main_~arr~0.base)))} assume !(4 + (~arr~0.offset + 4 * ~j~0) <= #length[~arr~0.base] && 0 <= ~arr~0.offset + 4 * ~j~0); {932#false} is VALID [2020-07-29 00:48:07,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 00:48:07,795 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815232408] [2020-07-29 00:48:07,795 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132747603] [2020-07-29 00:48:07,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 00:48:07,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:48:07,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 00:48:07,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:48:07,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 00:48:08,048 INFO L263 TraceCheckUtils]: 0: Hoare triple {931#true} call ULTIMATE.init(); {931#true} is VALID [2020-07-29 00:48:08,048 INFO L280 TraceCheckUtils]: 1: Hoare triple {931#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {931#true} is VALID [2020-07-29 00:48:08,049 INFO L280 TraceCheckUtils]: 2: Hoare triple {931#true} assume true; {931#true} is VALID [2020-07-29 00:48:08,049 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {931#true} {931#true} #89#return; {931#true} is VALID [2020-07-29 00:48:08,049 INFO L263 TraceCheckUtils]: 4: Hoare triple {931#true} call #t~ret10 := main(); {931#true} is VALID [2020-07-29 00:48:08,049 INFO L280 TraceCheckUtils]: 5: Hoare triple {931#true} havoc ~i~0;havoc ~j~0;havoc ~val~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~length~0 := #t~nondet2;havoc #t~nondet2; {931#true} is VALID [2020-07-29 00:48:08,049 INFO L280 TraceCheckUtils]: 6: Hoare triple {931#true} assume ~length~0 < 1 || ~length~0 >= 536870911;~length~0 := 1; {931#true} is VALID [2020-07-29 00:48:08,051 INFO L280 TraceCheckUtils]: 7: Hoare triple {931#true} call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnStack(4 * ~length~0);~arr~0.base, ~arr~0.offset := #t~malloc3.base, #t~malloc3.offset; {965#(<= 0 main_~arr~0.offset)} is VALID [2020-07-29 00:48:08,051 INFO L280 TraceCheckUtils]: 8: Hoare triple {965#(<= 0 main_~arr~0.offset)} assume !(~arr~0.base == 0 && ~arr~0.offset == 0);~i~0 := 0; {969#(and (<= 0 main_~i~0) (<= 0 main_~arr~0.offset))} is VALID [2020-07-29 00:48:08,052 INFO L280 TraceCheckUtils]: 9: Hoare triple {969#(and (<= 0 main_~i~0) (<= 0 main_~arr~0.offset))} assume !!(~i~0 < ~length~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~val~0 := #t~nondet5;havoc #t~nondet5; {969#(and (<= 0 main_~i~0) (<= 0 main_~arr~0.offset))} is VALID [2020-07-29 00:48:08,053 INFO L280 TraceCheckUtils]: 10: Hoare triple {969#(and (<= 0 main_~i~0) (<= 0 main_~arr~0.offset))} assume !(~val~0 < 0); {969#(and (<= 0 main_~i~0) (<= 0 main_~arr~0.offset))} is VALID [2020-07-29 00:48:08,055 INFO L280 TraceCheckUtils]: 11: Hoare triple {969#(and (<= 0 main_~i~0) (<= 0 main_~arr~0.offset))} SUMMARY for call write~int(~val~0, ~arr~0.base, ~arr~0.offset + 4 * ~i~0, 4); srcloc: L521-2 {979#(and (<= 0 main_~arr~0.offset) (<= 0 (div (+ (* main_~arr~0.offset (- 1)) (select |#length| main_~arr~0.base) (- 4)) 4)))} is VALID [2020-07-29 00:48:08,056 INFO L280 TraceCheckUtils]: 12: Hoare triple {979#(and (<= 0 main_~arr~0.offset) (<= 0 (div (+ (* main_~arr~0.offset (- 1)) (select |#length| main_~arr~0.base) (- 4)) 4)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {979#(and (<= 0 main_~arr~0.offset) (<= 0 (div (+ (* main_~arr~0.offset (- 1)) (select |#length| main_~arr~0.base) (- 4)) 4)))} is VALID [2020-07-29 00:48:08,056 INFO L280 TraceCheckUtils]: 13: Hoare triple {979#(and (<= 0 main_~arr~0.offset) (<= 0 (div (+ (* main_~arr~0.offset (- 1)) (select |#length| main_~arr~0.base) (- 4)) 4)))} assume !(~i~0 < ~length~0); {979#(and (<= 0 main_~arr~0.offset) (<= 0 (div (+ (* main_~arr~0.offset (- 1)) (select |#length| main_~arr~0.base) (- 4)) 4)))} is VALID [2020-07-29 00:48:08,057 INFO L280 TraceCheckUtils]: 14: Hoare triple {979#(and (<= 0 main_~arr~0.offset) (<= 0 (div (+ (* main_~arr~0.offset (- 1)) (select |#length| main_~arr~0.base) (- 4)) 4)))} ~j~0 := 0; {989#(and (<= 0 main_~arr~0.offset) (= 0 main_~j~0) (<= 0 (div (+ (* main_~arr~0.offset (- 1)) (select |#length| main_~arr~0.base) (- 4)) 4)))} is VALID [2020-07-29 00:48:08,058 INFO L280 TraceCheckUtils]: 15: Hoare triple {989#(and (<= 0 main_~arr~0.offset) (= 0 main_~j~0) (<= 0 (div (+ (* main_~arr~0.offset (- 1)) (select |#length| main_~arr~0.base) (- 4)) 4)))} assume !!(~j~0 < ~length~0); {989#(and (<= 0 main_~arr~0.offset) (= 0 main_~j~0) (<= 0 (div (+ (* main_~arr~0.offset (- 1)) (select |#length| main_~arr~0.base) (- 4)) 4)))} is VALID [2020-07-29 00:48:08,059 INFO L280 TraceCheckUtils]: 16: Hoare triple {989#(and (<= 0 main_~arr~0.offset) (= 0 main_~j~0) (<= 0 (div (+ (* main_~arr~0.offset (- 1)) (select |#length| main_~arr~0.base) (- 4)) 4)))} assume !(4 + (~arr~0.offset + 4 * ~j~0) <= #length[~arr~0.base] && 0 <= ~arr~0.offset + 4 * ~j~0); {932#false} is VALID [2020-07-29 00:48:08,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 00:48:08,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 00:48:08,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2020-07-29 00:48:08,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667852404] [2020-07-29 00:48:08,062 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2020-07-29 00:48:08,063 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 00:48:08,063 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-29 00:48:08,098 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:48:08,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-29 00:48:08,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 00:48:08,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-29 00:48:08,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-07-29 00:48:08,100 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 11 states. [2020-07-29 00:48:08,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:48:08,651 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2020-07-29 00:48:08,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 00:48:08,651 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2020-07-29 00:48:08,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 00:48:08,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-29 00:48:08,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2020-07-29 00:48:08,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-29 00:48:08,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2020-07-29 00:48:08,656 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 52 transitions. [2020-07-29 00:48:08,764 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:48:08,766 INFO L225 Difference]: With dead ends: 50 [2020-07-29 00:48:08,767 INFO L226 Difference]: Without dead ends: 50 [2020-07-29 00:48:08,768 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-07-29 00:48:08,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-29 00:48:08,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2020-07-29 00:48:08,773 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 00:48:08,773 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 43 states. [2020-07-29 00:48:08,773 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 43 states. [2020-07-29 00:48:08,775 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 43 states. [2020-07-29 00:48:08,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:48:08,779 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2020-07-29 00:48:08,779 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2020-07-29 00:48:08,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:48:08,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:48:08,780 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 50 states. [2020-07-29 00:48:08,780 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 50 states. [2020-07-29 00:48:08,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:48:08,783 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2020-07-29 00:48:08,784 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2020-07-29 00:48:08,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:48:08,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:48:08,785 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 00:48:08,785 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 00:48:08,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-29 00:48:08,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2020-07-29 00:48:08,788 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 17 [2020-07-29 00:48:08,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 00:48:08,788 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2020-07-29 00:48:08,788 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-29 00:48:08,788 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2020-07-29 00:48:08,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-29 00:48:08,789 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 00:48:08,789 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 00:48:08,997 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 00:48:08,998 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-07-29 00:48:08,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 00:48:08,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1613047272, now seen corresponding path program 1 times [2020-07-29 00:48:08,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 00:48:09,000 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488507217] [2020-07-29 00:48:09,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 00:48:09,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:48:09,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 00:48:09,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:48:09,076 INFO L280 TraceCheckUtils]: 0: Hoare triple {1201#(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; {1194#true} is VALID [2020-07-29 00:48:09,076 INFO L280 TraceCheckUtils]: 1: Hoare triple {1194#true} assume true; {1194#true} is VALID [2020-07-29 00:48:09,077 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1194#true} {1194#true} #89#return; {1194#true} is VALID [2020-07-29 00:48:09,078 INFO L263 TraceCheckUtils]: 0: Hoare triple {1194#true} call ULTIMATE.init(); {1201#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 00:48:09,079 INFO L280 TraceCheckUtils]: 1: Hoare triple {1201#(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; {1194#true} is VALID [2020-07-29 00:48:09,079 INFO L280 TraceCheckUtils]: 2: Hoare triple {1194#true} assume true; {1194#true} is VALID [2020-07-29 00:48:09,079 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1194#true} {1194#true} #89#return; {1194#true} is VALID [2020-07-29 00:48:09,080 INFO L263 TraceCheckUtils]: 4: Hoare triple {1194#true} call #t~ret10 := main(); {1194#true} is VALID [2020-07-29 00:48:09,080 INFO L280 TraceCheckUtils]: 5: Hoare triple {1194#true} havoc ~i~0;havoc ~j~0;havoc ~val~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~length~0 := #t~nondet2;havoc #t~nondet2; {1194#true} is VALID [2020-07-29 00:48:09,081 INFO L280 TraceCheckUtils]: 6: Hoare triple {1194#true} assume ~length~0 < 1 || ~length~0 >= 536870911;~length~0 := 1; {1199#(<= 1 main_~length~0)} is VALID [2020-07-29 00:48:09,082 INFO L280 TraceCheckUtils]: 7: Hoare triple {1199#(<= 1 main_~length~0)} call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnStack(4 * ~length~0);~arr~0.base, ~arr~0.offset := #t~malloc3.base, #t~malloc3.offset; {1199#(<= 1 main_~length~0)} is VALID [2020-07-29 00:48:09,083 INFO L280 TraceCheckUtils]: 8: Hoare triple {1199#(<= 1 main_~length~0)} assume !(~arr~0.base == 0 && ~arr~0.offset == 0);~i~0 := 0; {1199#(<= 1 main_~length~0)} is VALID [2020-07-29 00:48:09,083 INFO L280 TraceCheckUtils]: 9: Hoare triple {1199#(<= 1 main_~length~0)} assume !!(~i~0 < ~length~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~val~0 := #t~nondet5;havoc #t~nondet5; {1199#(<= 1 main_~length~0)} is VALID [2020-07-29 00:48:09,084 INFO L280 TraceCheckUtils]: 10: Hoare triple {1199#(<= 1 main_~length~0)} assume !(~val~0 < 0); {1199#(<= 1 main_~length~0)} is VALID [2020-07-29 00:48:09,085 INFO L280 TraceCheckUtils]: 11: Hoare triple {1199#(<= 1 main_~length~0)} SUMMARY for call write~int(~val~0, ~arr~0.base, ~arr~0.offset + 4 * ~i~0, 4); srcloc: L521-2 {1199#(<= 1 main_~length~0)} is VALID [2020-07-29 00:48:09,086 INFO L280 TraceCheckUtils]: 12: Hoare triple {1199#(<= 1 main_~length~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1199#(<= 1 main_~length~0)} is VALID [2020-07-29 00:48:09,086 INFO L280 TraceCheckUtils]: 13: Hoare triple {1199#(<= 1 main_~length~0)} assume !(~i~0 < ~length~0); {1199#(<= 1 main_~length~0)} is VALID [2020-07-29 00:48:09,087 INFO L280 TraceCheckUtils]: 14: Hoare triple {1199#(<= 1 main_~length~0)} ~j~0 := 0; {1200#(and (= 0 main_~j~0) (<= 1 main_~length~0))} is VALID [2020-07-29 00:48:09,088 INFO L280 TraceCheckUtils]: 15: Hoare triple {1200#(and (= 0 main_~j~0) (<= 1 main_~length~0))} assume !(~j~0 < ~length~0); {1195#false} is VALID [2020-07-29 00:48:09,089 INFO L280 TraceCheckUtils]: 16: Hoare triple {1195#false} #res := 0;call ULTIMATE.dealloc(#t~malloc3.base, #t~malloc3.offset);havoc #t~malloc3.base, #t~malloc3.offset; {1195#false} is VALID [2020-07-29 00:48:09,089 INFO L280 TraceCheckUtils]: 17: Hoare triple {1195#false} assume !(#valid == old(#valid)); {1195#false} is VALID [2020-07-29 00:48:09,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 00:48:09,091 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488507217] [2020-07-29 00:48:09,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 00:48:09,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 00:48:09,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368681857] [2020-07-29 00:48:09,092 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-29 00:48:09,092 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 00:48:09,092 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 00:48:09,115 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:48:09,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 00:48:09,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 00:48:09,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 00:48:09,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-29 00:48:09,117 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand 5 states. [2020-07-29 00:48:09,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:48:09,330 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2020-07-29 00:48:09,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 00:48:09,330 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-29 00:48:09,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 00:48:09,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 00:48:09,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2020-07-29 00:48:09,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 00:48:09,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2020-07-29 00:48:09,334 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2020-07-29 00:48:09,377 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:48:09,378 INFO L225 Difference]: With dead ends: 44 [2020-07-29 00:48:09,378 INFO L226 Difference]: Without dead ends: 44 [2020-07-29 00:48:09,378 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-29 00:48:09,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-29 00:48:09,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2020-07-29 00:48:09,387 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 00:48:09,387 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 43 states. [2020-07-29 00:48:09,388 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 43 states. [2020-07-29 00:48:09,388 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 43 states. [2020-07-29 00:48:09,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:48:09,392 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2020-07-29 00:48:09,392 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2020-07-29 00:48:09,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:48:09,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:48:09,392 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 44 states. [2020-07-29 00:48:09,392 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 44 states. [2020-07-29 00:48:09,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:48:09,395 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2020-07-29 00:48:09,395 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2020-07-29 00:48:09,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:48:09,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:48:09,396 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 00:48:09,396 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 00:48:09,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-29 00:48:09,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2020-07-29 00:48:09,399 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 18 [2020-07-29 00:48:09,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 00:48:09,399 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2020-07-29 00:48:09,399 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 00:48:09,400 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2020-07-29 00:48:09,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-29 00:48:09,400 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 00:48:09,401 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 00:48:09,401 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-29 00:48:09,401 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-07-29 00:48:09,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 00:48:09,401 INFO L82 PathProgramCache]: Analyzing trace with hash 2133289012, now seen corresponding path program 1 times [2020-07-29 00:48:09,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 00:48:09,405 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353916876] [2020-07-29 00:48:09,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 00:48:09,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:48:09,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 00:48:09,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:48:09,482 INFO L280 TraceCheckUtils]: 0: Hoare triple {1389#(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; {1381#true} is VALID [2020-07-29 00:48:09,482 INFO L280 TraceCheckUtils]: 1: Hoare triple {1381#true} assume true; {1381#true} is VALID [2020-07-29 00:48:09,482 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1381#true} {1381#true} #89#return; {1381#true} is VALID [2020-07-29 00:48:09,483 INFO L263 TraceCheckUtils]: 0: Hoare triple {1381#true} call ULTIMATE.init(); {1389#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 00:48:09,483 INFO L280 TraceCheckUtils]: 1: Hoare triple {1389#(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; {1381#true} is VALID [2020-07-29 00:48:09,484 INFO L280 TraceCheckUtils]: 2: Hoare triple {1381#true} assume true; {1381#true} is VALID [2020-07-29 00:48:09,484 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1381#true} {1381#true} #89#return; {1381#true} is VALID [2020-07-29 00:48:09,484 INFO L263 TraceCheckUtils]: 4: Hoare triple {1381#true} call #t~ret10 := main(); {1381#true} is VALID [2020-07-29 00:48:09,484 INFO L280 TraceCheckUtils]: 5: Hoare triple {1381#true} havoc ~i~0;havoc ~j~0;havoc ~val~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~length~0 := #t~nondet2;havoc #t~nondet2; {1381#true} is VALID [2020-07-29 00:48:09,485 INFO L280 TraceCheckUtils]: 6: Hoare triple {1381#true} assume ~length~0 < 1 || ~length~0 >= 536870911;~length~0 := 1; {1386#(<= main_~length~0 1)} is VALID [2020-07-29 00:48:09,485 INFO L280 TraceCheckUtils]: 7: Hoare triple {1386#(<= main_~length~0 1)} call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnStack(4 * ~length~0);~arr~0.base, ~arr~0.offset := #t~malloc3.base, #t~malloc3.offset; {1386#(<= main_~length~0 1)} is VALID [2020-07-29 00:48:09,486 INFO L280 TraceCheckUtils]: 8: Hoare triple {1386#(<= main_~length~0 1)} assume !(~arr~0.base == 0 && ~arr~0.offset == 0);~i~0 := 0; {1386#(<= main_~length~0 1)} is VALID [2020-07-29 00:48:09,486 INFO L280 TraceCheckUtils]: 9: Hoare triple {1386#(<= main_~length~0 1)} assume !!(~i~0 < ~length~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~val~0 := #t~nondet5;havoc #t~nondet5; {1386#(<= main_~length~0 1)} is VALID [2020-07-29 00:48:09,487 INFO L280 TraceCheckUtils]: 10: Hoare triple {1386#(<= main_~length~0 1)} assume !(~val~0 < 0); {1386#(<= main_~length~0 1)} is VALID [2020-07-29 00:48:09,488 INFO L280 TraceCheckUtils]: 11: Hoare triple {1386#(<= main_~length~0 1)} SUMMARY for call write~int(~val~0, ~arr~0.base, ~arr~0.offset + 4 * ~i~0, 4); srcloc: L521-2 {1386#(<= main_~length~0 1)} is VALID [2020-07-29 00:48:09,488 INFO L280 TraceCheckUtils]: 12: Hoare triple {1386#(<= main_~length~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1386#(<= main_~length~0 1)} is VALID [2020-07-29 00:48:09,488 INFO L280 TraceCheckUtils]: 13: Hoare triple {1386#(<= main_~length~0 1)} assume !(~i~0 < ~length~0); {1386#(<= main_~length~0 1)} is VALID [2020-07-29 00:48:09,489 INFO L280 TraceCheckUtils]: 14: Hoare triple {1386#(<= main_~length~0 1)} ~j~0 := 0; {1387#(and (= 0 main_~j~0) (<= main_~length~0 1))} is VALID [2020-07-29 00:48:09,490 INFO L280 TraceCheckUtils]: 15: Hoare triple {1387#(and (= 0 main_~j~0) (<= main_~length~0 1))} assume !!(~j~0 < ~length~0); {1387#(and (= 0 main_~j~0) (<= main_~length~0 1))} is VALID [2020-07-29 00:48:09,490 INFO L280 TraceCheckUtils]: 16: Hoare triple {1387#(and (= 0 main_~j~0) (<= main_~length~0 1))} SUMMARY for call #t~mem7 := read~int(~arr~0.base, ~arr~0.offset + 4 * ~j~0, 4); srcloc: L527-3 {1387#(and (= 0 main_~j~0) (<= main_~length~0 1))} is VALID [2020-07-29 00:48:09,491 INFO L280 TraceCheckUtils]: 17: Hoare triple {1387#(and (= 0 main_~j~0) (<= main_~length~0 1))} assume !(#t~mem7 > 0);havoc #t~mem7; {1387#(and (= 0 main_~j~0) (<= main_~length~0 1))} is VALID [2020-07-29 00:48:09,494 INFO L280 TraceCheckUtils]: 18: Hoare triple {1387#(and (= 0 main_~j~0) (<= main_~length~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {1388#(<= main_~length~0 main_~j~0)} is VALID [2020-07-29 00:48:09,495 INFO L280 TraceCheckUtils]: 19: Hoare triple {1388#(<= main_~length~0 main_~j~0)} assume !!(~j~0 < ~length~0); {1382#false} is VALID [2020-07-29 00:48:09,495 INFO L280 TraceCheckUtils]: 20: Hoare triple {1382#false} assume !(4 + (~arr~0.offset + 4 * ~j~0) <= #length[~arr~0.base] && 0 <= ~arr~0.offset + 4 * ~j~0); {1382#false} is VALID [2020-07-29 00:48:09,496 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 00:48:09,496 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353916876] [2020-07-29 00:48:09,496 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411869775] [2020-07-29 00:48:09,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 00:48:09,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:48:09,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 00:48:09,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:48:09,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 00:48:09,725 INFO L263 TraceCheckUtils]: 0: Hoare triple {1381#true} call ULTIMATE.init(); {1381#true} is VALID [2020-07-29 00:48:09,725 INFO L280 TraceCheckUtils]: 1: Hoare triple {1381#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1381#true} is VALID [2020-07-29 00:48:09,725 INFO L280 TraceCheckUtils]: 2: Hoare triple {1381#true} assume true; {1381#true} is VALID [2020-07-29 00:48:09,726 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1381#true} {1381#true} #89#return; {1381#true} is VALID [2020-07-29 00:48:09,726 INFO L263 TraceCheckUtils]: 4: Hoare triple {1381#true} call #t~ret10 := main(); {1381#true} is VALID [2020-07-29 00:48:09,726 INFO L280 TraceCheckUtils]: 5: Hoare triple {1381#true} havoc ~i~0;havoc ~j~0;havoc ~val~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~length~0 := #t~nondet2;havoc #t~nondet2; {1381#true} is VALID [2020-07-29 00:48:09,728 INFO L280 TraceCheckUtils]: 6: Hoare triple {1381#true} assume ~length~0 < 1 || ~length~0 >= 536870911;~length~0 := 1; {1386#(<= main_~length~0 1)} is VALID [2020-07-29 00:48:09,731 INFO L280 TraceCheckUtils]: 7: Hoare triple {1386#(<= main_~length~0 1)} call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnStack(4 * ~length~0);~arr~0.base, ~arr~0.offset := #t~malloc3.base, #t~malloc3.offset; {1386#(<= main_~length~0 1)} is VALID [2020-07-29 00:48:09,732 INFO L280 TraceCheckUtils]: 8: Hoare triple {1386#(<= main_~length~0 1)} assume !(~arr~0.base == 0 && ~arr~0.offset == 0);~i~0 := 0; {1386#(<= main_~length~0 1)} is VALID [2020-07-29 00:48:09,732 INFO L280 TraceCheckUtils]: 9: Hoare triple {1386#(<= main_~length~0 1)} assume !!(~i~0 < ~length~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~val~0 := #t~nondet5;havoc #t~nondet5; {1386#(<= main_~length~0 1)} is VALID [2020-07-29 00:48:09,733 INFO L280 TraceCheckUtils]: 10: Hoare triple {1386#(<= main_~length~0 1)} assume !(~val~0 < 0); {1386#(<= main_~length~0 1)} is VALID [2020-07-29 00:48:09,733 INFO L280 TraceCheckUtils]: 11: Hoare triple {1386#(<= main_~length~0 1)} SUMMARY for call write~int(~val~0, ~arr~0.base, ~arr~0.offset + 4 * ~i~0, 4); srcloc: L521-2 {1386#(<= main_~length~0 1)} is VALID [2020-07-29 00:48:09,734 INFO L280 TraceCheckUtils]: 12: Hoare triple {1386#(<= main_~length~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1386#(<= main_~length~0 1)} is VALID [2020-07-29 00:48:09,734 INFO L280 TraceCheckUtils]: 13: Hoare triple {1386#(<= main_~length~0 1)} assume !(~i~0 < ~length~0); {1386#(<= main_~length~0 1)} is VALID [2020-07-29 00:48:09,735 INFO L280 TraceCheckUtils]: 14: Hoare triple {1386#(<= main_~length~0 1)} ~j~0 := 0; {1435#(and (<= 0 main_~j~0) (<= main_~length~0 1))} is VALID [2020-07-29 00:48:09,735 INFO L280 TraceCheckUtils]: 15: Hoare triple {1435#(and (<= 0 main_~j~0) (<= main_~length~0 1))} assume !!(~j~0 < ~length~0); {1435#(and (<= 0 main_~j~0) (<= main_~length~0 1))} is VALID [2020-07-29 00:48:09,736 INFO L280 TraceCheckUtils]: 16: Hoare triple {1435#(and (<= 0 main_~j~0) (<= main_~length~0 1))} SUMMARY for call #t~mem7 := read~int(~arr~0.base, ~arr~0.offset + 4 * ~j~0, 4); srcloc: L527-3 {1435#(and (<= 0 main_~j~0) (<= main_~length~0 1))} is VALID [2020-07-29 00:48:09,736 INFO L280 TraceCheckUtils]: 17: Hoare triple {1435#(and (<= 0 main_~j~0) (<= main_~length~0 1))} assume !(#t~mem7 > 0);havoc #t~mem7; {1435#(and (<= 0 main_~j~0) (<= main_~length~0 1))} is VALID [2020-07-29 00:48:09,741 INFO L280 TraceCheckUtils]: 18: Hoare triple {1435#(and (<= 0 main_~j~0) (<= main_~length~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {1448#(and (<= 1 main_~j~0) (<= main_~length~0 1))} is VALID [2020-07-29 00:48:09,742 INFO L280 TraceCheckUtils]: 19: Hoare triple {1448#(and (<= 1 main_~j~0) (<= main_~length~0 1))} assume !!(~j~0 < ~length~0); {1382#false} is VALID [2020-07-29 00:48:09,743 INFO L280 TraceCheckUtils]: 20: Hoare triple {1382#false} assume !(4 + (~arr~0.offset + 4 * ~j~0) <= #length[~arr~0.base] && 0 <= ~arr~0.offset + 4 * ~j~0); {1382#false} is VALID [2020-07-29 00:48:09,743 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 00:48:09,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-29 00:48:09,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2020-07-29 00:48:09,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557259090] [2020-07-29 00:48:09,744 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-07-29 00:48:09,745 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 00:48:09,745 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 00:48:09,773 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 00:48:09,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 00:48:09,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 00:48:09,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 00:48:09,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-29 00:48:09,774 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 5 states. [2020-07-29 00:48:09,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:48:09,909 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2020-07-29 00:48:09,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 00:48:09,909 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-07-29 00:48:09,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 00:48:09,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 00:48:09,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2020-07-29 00:48:09,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 00:48:09,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2020-07-29 00:48:09,912 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 54 transitions. [2020-07-29 00:48:09,971 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:48:09,974 INFO L225 Difference]: With dead ends: 56 [2020-07-29 00:48:09,974 INFO L226 Difference]: Without dead ends: 56 [2020-07-29 00:48:09,974 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-29 00:48:09,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-07-29 00:48:09,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2020-07-29 00:48:09,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 00:48:09,978 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 53 states. [2020-07-29 00:48:09,978 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 53 states. [2020-07-29 00:48:09,978 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 53 states. [2020-07-29 00:48:09,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:48:09,981 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2020-07-29 00:48:09,981 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2020-07-29 00:48:09,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:48:09,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:48:09,981 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 56 states. [2020-07-29 00:48:09,982 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 56 states. [2020-07-29 00:48:09,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:48:09,984 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2020-07-29 00:48:09,984 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2020-07-29 00:48:09,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:48:09,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:48:09,984 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 00:48:09,985 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 00:48:09,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-07-29 00:48:09,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2020-07-29 00:48:09,987 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 21 [2020-07-29 00:48:09,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 00:48:09,987 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2020-07-29 00:48:09,987 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 00:48:09,987 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2020-07-29 00:48:09,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-29 00:48:09,988 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 00:48:09,988 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 00:48:10,201 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 00:48:10,202 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-07-29 00:48:10,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 00:48:10,203 INFO L82 PathProgramCache]: Analyzing trace with hash 853425334, now seen corresponding path program 1 times [2020-07-29 00:48:10,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 00:48:10,204 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530105300] [2020-07-29 00:48:10,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 00:48:10,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:48:10,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 00:48:10,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:48:10,322 INFO L280 TraceCheckUtils]: 0: Hoare triple {1685#(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; {1675#true} is VALID [2020-07-29 00:48:10,322 INFO L280 TraceCheckUtils]: 1: Hoare triple {1675#true} assume true; {1675#true} is VALID [2020-07-29 00:48:10,322 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1675#true} {1675#true} #89#return; {1675#true} is VALID [2020-07-29 00:48:10,323 INFO L263 TraceCheckUtils]: 0: Hoare triple {1675#true} call ULTIMATE.init(); {1685#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 00:48:10,323 INFO L280 TraceCheckUtils]: 1: Hoare triple {1685#(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; {1675#true} is VALID [2020-07-29 00:48:10,324 INFO L280 TraceCheckUtils]: 2: Hoare triple {1675#true} assume true; {1675#true} is VALID [2020-07-29 00:48:10,324 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1675#true} {1675#true} #89#return; {1675#true} is VALID [2020-07-29 00:48:10,324 INFO L263 TraceCheckUtils]: 4: Hoare triple {1675#true} call #t~ret10 := main(); {1675#true} is VALID [2020-07-29 00:48:10,324 INFO L280 TraceCheckUtils]: 5: Hoare triple {1675#true} havoc ~i~0;havoc ~j~0;havoc ~val~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~length~0 := #t~nondet2;havoc #t~nondet2; {1675#true} is VALID [2020-07-29 00:48:10,324 INFO L280 TraceCheckUtils]: 6: Hoare triple {1675#true} assume !(~length~0 < 1 || ~length~0 >= 536870911); {1675#true} is VALID [2020-07-29 00:48:10,324 INFO L280 TraceCheckUtils]: 7: Hoare triple {1675#true} call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnStack(4 * ~length~0);~arr~0.base, ~arr~0.offset := #t~malloc3.base, #t~malloc3.offset; {1675#true} is VALID [2020-07-29 00:48:10,325 INFO L280 TraceCheckUtils]: 8: Hoare triple {1675#true} assume !(~arr~0.base == 0 && ~arr~0.offset == 0);~i~0 := 0; {1680#(= 0 main_~i~0)} is VALID [2020-07-29 00:48:10,325 INFO L280 TraceCheckUtils]: 9: Hoare triple {1680#(= 0 main_~i~0)} assume !!(~i~0 < ~length~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~val~0 := #t~nondet5;havoc #t~nondet5; {1680#(= 0 main_~i~0)} is VALID [2020-07-29 00:48:10,326 INFO L280 TraceCheckUtils]: 10: Hoare triple {1680#(= 0 main_~i~0)} assume !(~val~0 < 0); {1680#(= 0 main_~i~0)} is VALID [2020-07-29 00:48:10,326 INFO L280 TraceCheckUtils]: 11: Hoare triple {1680#(= 0 main_~i~0)} SUMMARY for call write~int(~val~0, ~arr~0.base, ~arr~0.offset + 4 * ~i~0, 4); srcloc: L521-2 {1680#(= 0 main_~i~0)} is VALID [2020-07-29 00:48:10,331 INFO L280 TraceCheckUtils]: 12: Hoare triple {1680#(= 0 main_~i~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1681#(<= main_~i~0 1)} is VALID [2020-07-29 00:48:10,332 INFO L280 TraceCheckUtils]: 13: Hoare triple {1681#(<= main_~i~0 1)} assume !(~i~0 < ~length~0); {1682#(<= main_~length~0 1)} is VALID [2020-07-29 00:48:10,333 INFO L280 TraceCheckUtils]: 14: Hoare triple {1682#(<= main_~length~0 1)} ~j~0 := 0; {1683#(and (= 0 main_~j~0) (<= main_~length~0 1))} is VALID [2020-07-29 00:48:10,334 INFO L280 TraceCheckUtils]: 15: Hoare triple {1683#(and (= 0 main_~j~0) (<= main_~length~0 1))} assume !!(~j~0 < ~length~0); {1683#(and (= 0 main_~j~0) (<= main_~length~0 1))} is VALID [2020-07-29 00:48:10,335 INFO L280 TraceCheckUtils]: 16: Hoare triple {1683#(and (= 0 main_~j~0) (<= main_~length~0 1))} SUMMARY for call #t~mem7 := read~int(~arr~0.base, ~arr~0.offset + 4 * ~j~0, 4); srcloc: L527-3 {1683#(and (= 0 main_~j~0) (<= main_~length~0 1))} is VALID [2020-07-29 00:48:10,335 INFO L280 TraceCheckUtils]: 17: Hoare triple {1683#(and (= 0 main_~j~0) (<= main_~length~0 1))} assume !(#t~mem7 > 0);havoc #t~mem7; {1683#(and (= 0 main_~j~0) (<= main_~length~0 1))} is VALID [2020-07-29 00:48:10,336 INFO L280 TraceCheckUtils]: 18: Hoare triple {1683#(and (= 0 main_~j~0) (<= main_~length~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {1684#(<= main_~length~0 main_~j~0)} is VALID [2020-07-29 00:48:10,337 INFO L280 TraceCheckUtils]: 19: Hoare triple {1684#(<= main_~length~0 main_~j~0)} assume !!(~j~0 < ~length~0); {1676#false} is VALID [2020-07-29 00:48:10,337 INFO L280 TraceCheckUtils]: 20: Hoare triple {1676#false} assume !(4 + (~arr~0.offset + 4 * ~j~0) <= #length[~arr~0.base] && 0 <= ~arr~0.offset + 4 * ~j~0); {1676#false} is VALID [2020-07-29 00:48:10,338 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 00:48:10,338 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530105300] [2020-07-29 00:48:10,339 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60741721] [2020-07-29 00:48:10,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 00:48:10,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:48:10,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 00:48:10,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:48:10,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 00:48:10,591 INFO L263 TraceCheckUtils]: 0: Hoare triple {1675#true} call ULTIMATE.init(); {1675#true} is VALID [2020-07-29 00:48:10,591 INFO L280 TraceCheckUtils]: 1: Hoare triple {1675#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1675#true} is VALID [2020-07-29 00:48:10,591 INFO L280 TraceCheckUtils]: 2: Hoare triple {1675#true} assume true; {1675#true} is VALID [2020-07-29 00:48:10,592 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1675#true} {1675#true} #89#return; {1675#true} is VALID [2020-07-29 00:48:10,592 INFO L263 TraceCheckUtils]: 4: Hoare triple {1675#true} call #t~ret10 := main(); {1675#true} is VALID [2020-07-29 00:48:10,592 INFO L280 TraceCheckUtils]: 5: Hoare triple {1675#true} havoc ~i~0;havoc ~j~0;havoc ~val~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~length~0 := #t~nondet2;havoc #t~nondet2; {1675#true} is VALID [2020-07-29 00:48:10,592 INFO L280 TraceCheckUtils]: 6: Hoare triple {1675#true} assume !(~length~0 < 1 || ~length~0 >= 536870911); {1675#true} is VALID [2020-07-29 00:48:10,592 INFO L280 TraceCheckUtils]: 7: Hoare triple {1675#true} call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnStack(4 * ~length~0);~arr~0.base, ~arr~0.offset := #t~malloc3.base, #t~malloc3.offset; {1675#true} is VALID [2020-07-29 00:48:10,593 INFO L280 TraceCheckUtils]: 8: Hoare triple {1675#true} assume !(~arr~0.base == 0 && ~arr~0.offset == 0);~i~0 := 0; {1713#(<= main_~i~0 0)} is VALID [2020-07-29 00:48:10,593 INFO L280 TraceCheckUtils]: 9: Hoare triple {1713#(<= main_~i~0 0)} assume !!(~i~0 < ~length~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~val~0 := #t~nondet5;havoc #t~nondet5; {1713#(<= main_~i~0 0)} is VALID [2020-07-29 00:48:10,594 INFO L280 TraceCheckUtils]: 10: Hoare triple {1713#(<= main_~i~0 0)} assume !(~val~0 < 0); {1713#(<= main_~i~0 0)} is VALID [2020-07-29 00:48:10,595 INFO L280 TraceCheckUtils]: 11: Hoare triple {1713#(<= main_~i~0 0)} SUMMARY for call write~int(~val~0, ~arr~0.base, ~arr~0.offset + 4 * ~i~0, 4); srcloc: L521-2 {1713#(<= main_~i~0 0)} is VALID [2020-07-29 00:48:10,596 INFO L280 TraceCheckUtils]: 12: Hoare triple {1713#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1681#(<= main_~i~0 1)} is VALID [2020-07-29 00:48:10,599 INFO L280 TraceCheckUtils]: 13: Hoare triple {1681#(<= main_~i~0 1)} assume !(~i~0 < ~length~0); {1682#(<= main_~length~0 1)} is VALID [2020-07-29 00:48:10,600 INFO L280 TraceCheckUtils]: 14: Hoare triple {1682#(<= main_~length~0 1)} ~j~0 := 0; {1732#(and (<= 0 main_~j~0) (<= main_~length~0 1))} is VALID [2020-07-29 00:48:10,601 INFO L280 TraceCheckUtils]: 15: Hoare triple {1732#(and (<= 0 main_~j~0) (<= main_~length~0 1))} assume !!(~j~0 < ~length~0); {1732#(and (<= 0 main_~j~0) (<= main_~length~0 1))} is VALID [2020-07-29 00:48:10,603 INFO L280 TraceCheckUtils]: 16: Hoare triple {1732#(and (<= 0 main_~j~0) (<= main_~length~0 1))} SUMMARY for call #t~mem7 := read~int(~arr~0.base, ~arr~0.offset + 4 * ~j~0, 4); srcloc: L527-3 {1732#(and (<= 0 main_~j~0) (<= main_~length~0 1))} is VALID [2020-07-29 00:48:10,608 INFO L280 TraceCheckUtils]: 17: Hoare triple {1732#(and (<= 0 main_~j~0) (<= main_~length~0 1))} assume !(#t~mem7 > 0);havoc #t~mem7; {1732#(and (<= 0 main_~j~0) (<= main_~length~0 1))} is VALID [2020-07-29 00:48:10,609 INFO L280 TraceCheckUtils]: 18: Hoare triple {1732#(and (<= 0 main_~j~0) (<= main_~length~0 1))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {1745#(and (<= 1 main_~j~0) (<= main_~length~0 1))} is VALID [2020-07-29 00:48:10,609 INFO L280 TraceCheckUtils]: 19: Hoare triple {1745#(and (<= 1 main_~j~0) (<= main_~length~0 1))} assume !!(~j~0 < ~length~0); {1676#false} is VALID [2020-07-29 00:48:10,610 INFO L280 TraceCheckUtils]: 20: Hoare triple {1676#false} assume !(4 + (~arr~0.offset + 4 * ~j~0) <= #length[~arr~0.base] && 0 <= ~arr~0.offset + 4 * ~j~0); {1676#false} is VALID [2020-07-29 00:48:10,610 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 00:48:10,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 00:48:10,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2020-07-29 00:48:10,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500126110] [2020-07-29 00:48:10,611 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-07-29 00:48:10,612 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 00:48:10,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-29 00:48:10,652 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:48:10,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-29 00:48:10,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 00:48:10,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-29 00:48:10,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-07-29 00:48:10,653 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 11 states. [2020-07-29 00:48:11,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:48:11,145 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2020-07-29 00:48:11,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-29 00:48:11,145 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-07-29 00:48:11,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 00:48:11,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-29 00:48:11,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 65 transitions. [2020-07-29 00:48:11,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-29 00:48:11,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 65 transitions. [2020-07-29 00:48:11,151 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 65 transitions. [2020-07-29 00:48:11,237 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:48:11,239 INFO L225 Difference]: With dead ends: 73 [2020-07-29 00:48:11,239 INFO L226 Difference]: Without dead ends: 73 [2020-07-29 00:48:11,240 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2020-07-29 00:48:11,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-07-29 00:48:11,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 57. [2020-07-29 00:48:11,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 00:48:11,247 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 57 states. [2020-07-29 00:48:11,248 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 57 states. [2020-07-29 00:48:11,248 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 57 states. [2020-07-29 00:48:11,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:48:11,251 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2020-07-29 00:48:11,251 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2020-07-29 00:48:11,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:48:11,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:48:11,251 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 73 states. [2020-07-29 00:48:11,251 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 73 states. [2020-07-29 00:48:11,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:48:11,254 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2020-07-29 00:48:11,254 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2020-07-29 00:48:11,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:48:11,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:48:11,255 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 00:48:11,255 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 00:48:11,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-07-29 00:48:11,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2020-07-29 00:48:11,257 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 21 [2020-07-29 00:48:11,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 00:48:11,257 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2020-07-29 00:48:11,257 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-29 00:48:11,257 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2020-07-29 00:48:11,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-29 00:48:11,258 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 00:48:11,258 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] [2020-07-29 00:48:11,471 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 00:48:11,472 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-07-29 00:48:11,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 00:48:11,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1707448741, now seen corresponding path program 1 times [2020-07-29 00:48:11,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 00:48:11,473 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92273699] [2020-07-29 00:48:11,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 00:48:11,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:48:11,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 00:48:11,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:48:11,561 INFO L280 TraceCheckUtils]: 0: Hoare triple {2044#(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; {2037#true} is VALID [2020-07-29 00:48:11,561 INFO L280 TraceCheckUtils]: 1: Hoare triple {2037#true} assume true; {2037#true} is VALID [2020-07-29 00:48:11,561 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2037#true} {2037#true} #89#return; {2037#true} is VALID [2020-07-29 00:48:11,562 INFO L263 TraceCheckUtils]: 0: Hoare triple {2037#true} call ULTIMATE.init(); {2044#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 00:48:11,563 INFO L280 TraceCheckUtils]: 1: Hoare triple {2044#(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; {2037#true} is VALID [2020-07-29 00:48:11,563 INFO L280 TraceCheckUtils]: 2: Hoare triple {2037#true} assume true; {2037#true} is VALID [2020-07-29 00:48:11,563 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2037#true} {2037#true} #89#return; {2037#true} is VALID [2020-07-29 00:48:11,564 INFO L263 TraceCheckUtils]: 4: Hoare triple {2037#true} call #t~ret10 := main(); {2042#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 00:48:11,565 INFO L280 TraceCheckUtils]: 5: Hoare triple {2042#(= |#valid| |old(#valid)|)} havoc ~i~0;havoc ~j~0;havoc ~val~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~length~0 := #t~nondet2;havoc #t~nondet2; {2042#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 00:48:11,565 INFO L280 TraceCheckUtils]: 6: Hoare triple {2042#(= |#valid| |old(#valid)|)} assume ~length~0 < 1 || ~length~0 >= 536870911;~length~0 := 1; {2042#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 00:48:11,567 INFO L280 TraceCheckUtils]: 7: Hoare triple {2042#(= |#valid| |old(#valid)|)} call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnStack(4 * ~length~0);~arr~0.base, ~arr~0.offset := #t~malloc3.base, #t~malloc3.offset; {2043#(= |old(#valid)| (store |#valid| |main_#t~malloc3.base| 0))} is VALID [2020-07-29 00:48:11,567 INFO L280 TraceCheckUtils]: 8: Hoare triple {2043#(= |old(#valid)| (store |#valid| |main_#t~malloc3.base| 0))} assume !(~arr~0.base == 0 && ~arr~0.offset == 0);~i~0 := 0; {2043#(= |old(#valid)| (store |#valid| |main_#t~malloc3.base| 0))} is VALID [2020-07-29 00:48:11,568 INFO L280 TraceCheckUtils]: 9: Hoare triple {2043#(= |old(#valid)| (store |#valid| |main_#t~malloc3.base| 0))} assume !!(~i~0 < ~length~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~val~0 := #t~nondet5;havoc #t~nondet5; {2043#(= |old(#valid)| (store |#valid| |main_#t~malloc3.base| 0))} is VALID [2020-07-29 00:48:11,569 INFO L280 TraceCheckUtils]: 10: Hoare triple {2043#(= |old(#valid)| (store |#valid| |main_#t~malloc3.base| 0))} assume !(~val~0 < 0); {2043#(= |old(#valid)| (store |#valid| |main_#t~malloc3.base| 0))} is VALID [2020-07-29 00:48:11,569 INFO L280 TraceCheckUtils]: 11: Hoare triple {2043#(= |old(#valid)| (store |#valid| |main_#t~malloc3.base| 0))} SUMMARY for call write~int(~val~0, ~arr~0.base, ~arr~0.offset + 4 * ~i~0, 4); srcloc: L521-2 {2043#(= |old(#valid)| (store |#valid| |main_#t~malloc3.base| 0))} is VALID [2020-07-29 00:48:11,570 INFO L280 TraceCheckUtils]: 12: Hoare triple {2043#(= |old(#valid)| (store |#valid| |main_#t~malloc3.base| 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2043#(= |old(#valid)| (store |#valid| |main_#t~malloc3.base| 0))} is VALID [2020-07-29 00:48:11,570 INFO L280 TraceCheckUtils]: 13: Hoare triple {2043#(= |old(#valid)| (store |#valid| |main_#t~malloc3.base| 0))} assume !(~i~0 < ~length~0); {2043#(= |old(#valid)| (store |#valid| |main_#t~malloc3.base| 0))} is VALID [2020-07-29 00:48:11,571 INFO L280 TraceCheckUtils]: 14: Hoare triple {2043#(= |old(#valid)| (store |#valid| |main_#t~malloc3.base| 0))} ~j~0 := 0; {2043#(= |old(#valid)| (store |#valid| |main_#t~malloc3.base| 0))} is VALID [2020-07-29 00:48:11,572 INFO L280 TraceCheckUtils]: 15: Hoare triple {2043#(= |old(#valid)| (store |#valid| |main_#t~malloc3.base| 0))} assume !!(~j~0 < ~length~0); {2043#(= |old(#valid)| (store |#valid| |main_#t~malloc3.base| 0))} is VALID [2020-07-29 00:48:11,574 INFO L280 TraceCheckUtils]: 16: Hoare triple {2043#(= |old(#valid)| (store |#valid| |main_#t~malloc3.base| 0))} SUMMARY for call #t~mem7 := read~int(~arr~0.base, ~arr~0.offset + 4 * ~j~0, 4); srcloc: L527-3 {2043#(= |old(#valid)| (store |#valid| |main_#t~malloc3.base| 0))} is VALID [2020-07-29 00:48:11,582 INFO L280 TraceCheckUtils]: 17: Hoare triple {2043#(= |old(#valid)| (store |#valid| |main_#t~malloc3.base| 0))} assume !(#t~mem7 > 0);havoc #t~mem7; {2043#(= |old(#valid)| (store |#valid| |main_#t~malloc3.base| 0))} is VALID [2020-07-29 00:48:11,583 INFO L280 TraceCheckUtils]: 18: Hoare triple {2043#(= |old(#valid)| (store |#valid| |main_#t~malloc3.base| 0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {2043#(= |old(#valid)| (store |#valid| |main_#t~malloc3.base| 0))} is VALID [2020-07-29 00:48:11,583 INFO L280 TraceCheckUtils]: 19: Hoare triple {2043#(= |old(#valid)| (store |#valid| |main_#t~malloc3.base| 0))} assume !(~j~0 < ~length~0); {2043#(= |old(#valid)| (store |#valid| |main_#t~malloc3.base| 0))} is VALID [2020-07-29 00:48:11,585 INFO L280 TraceCheckUtils]: 20: Hoare triple {2043#(= |old(#valid)| (store |#valid| |main_#t~malloc3.base| 0))} #res := 0;call ULTIMATE.dealloc(#t~malloc3.base, #t~malloc3.offset);havoc #t~malloc3.base, #t~malloc3.offset; {2042#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 00:48:11,586 INFO L280 TraceCheckUtils]: 21: Hoare triple {2042#(= |#valid| |old(#valid)|)} assume !(#valid == old(#valid)); {2038#false} is VALID [2020-07-29 00:48:11,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-29 00:48:11,587 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92273699] [2020-07-29 00:48:11,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 00:48:11,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 00:48:11,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913760259] [2020-07-29 00:48:11,588 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2020-07-29 00:48:11,588 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 00:48:11,588 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 00:48:11,613 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:48:11,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 00:48:11,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 00:48:11,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 00:48:11,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-29 00:48:11,615 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand 5 states. [2020-07-29 00:48:11,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:48:11,693 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2020-07-29 00:48:11,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 00:48:11,693 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2020-07-29 00:48:11,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 00:48:11,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 00:48:11,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2020-07-29 00:48:11,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 00:48:11,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2020-07-29 00:48:11,695 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 32 transitions. [2020-07-29 00:48:11,736 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:48:11,737 INFO L225 Difference]: With dead ends: 56 [2020-07-29 00:48:11,737 INFO L226 Difference]: Without dead ends: 37 [2020-07-29 00:48:11,738 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-29 00:48:11,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-29 00:48:11,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-07-29 00:48:11,740 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 00:48:11,740 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2020-07-29 00:48:11,741 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2020-07-29 00:48:11,741 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2020-07-29 00:48:11,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:48:11,742 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2020-07-29 00:48:11,742 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2020-07-29 00:48:11,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:48:11,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:48:11,743 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2020-07-29 00:48:11,743 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2020-07-29 00:48:11,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:48:11,744 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2020-07-29 00:48:11,744 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2020-07-29 00:48:11,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:48:11,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:48:11,745 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 00:48:11,745 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 00:48:11,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-29 00:48:11,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2020-07-29 00:48:11,746 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 22 [2020-07-29 00:48:11,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 00:48:11,746 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2020-07-29 00:48:11,747 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 00:48:11,747 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2020-07-29 00:48:11,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-29 00:48:11,747 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 00:48:11,747 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 00:48:11,748 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-29 00:48:11,748 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-07-29 00:48:11,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 00:48:11,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1009154207, now seen corresponding path program 2 times [2020-07-29 00:48:11,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 00:48:11,748 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836707086] [2020-07-29 00:48:11,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 00:48:11,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:48:11,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 00:48:11,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:48:11,904 INFO L280 TraceCheckUtils]: 0: Hoare triple {2225#(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; {2214#true} is VALID [2020-07-29 00:48:11,904 INFO L280 TraceCheckUtils]: 1: Hoare triple {2214#true} assume true; {2214#true} is VALID [2020-07-29 00:48:11,904 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2214#true} {2214#true} #89#return; {2214#true} is VALID [2020-07-29 00:48:11,905 INFO L263 TraceCheckUtils]: 0: Hoare triple {2214#true} call ULTIMATE.init(); {2225#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 00:48:11,906 INFO L280 TraceCheckUtils]: 1: Hoare triple {2225#(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; {2214#true} is VALID [2020-07-29 00:48:11,906 INFO L280 TraceCheckUtils]: 2: Hoare triple {2214#true} assume true; {2214#true} is VALID [2020-07-29 00:48:11,906 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2214#true} {2214#true} #89#return; {2214#true} is VALID [2020-07-29 00:48:11,906 INFO L263 TraceCheckUtils]: 4: Hoare triple {2214#true} call #t~ret10 := main(); {2214#true} is VALID [2020-07-29 00:48:11,907 INFO L280 TraceCheckUtils]: 5: Hoare triple {2214#true} havoc ~i~0;havoc ~j~0;havoc ~val~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~length~0 := #t~nondet2;havoc #t~nondet2; {2214#true} is VALID [2020-07-29 00:48:11,907 INFO L280 TraceCheckUtils]: 6: Hoare triple {2214#true} assume !(~length~0 < 1 || ~length~0 >= 536870911); {2214#true} is VALID [2020-07-29 00:48:11,908 INFO L280 TraceCheckUtils]: 7: Hoare triple {2214#true} call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnStack(4 * ~length~0);~arr~0.base, ~arr~0.offset := #t~malloc3.base, #t~malloc3.offset; {2219#(= 0 main_~arr~0.offset)} is VALID [2020-07-29 00:48:11,909 INFO L280 TraceCheckUtils]: 8: Hoare triple {2219#(= 0 main_~arr~0.offset)} assume !(~arr~0.base == 0 && ~arr~0.offset == 0);~i~0 := 0; {2220#(and (= 0 main_~arr~0.offset) (= 0 main_~i~0))} is VALID [2020-07-29 00:48:11,910 INFO L280 TraceCheckUtils]: 9: Hoare triple {2220#(and (= 0 main_~arr~0.offset) (= 0 main_~i~0))} assume !!(~i~0 < ~length~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~val~0 := #t~nondet5;havoc #t~nondet5; {2220#(and (= 0 main_~arr~0.offset) (= 0 main_~i~0))} is VALID [2020-07-29 00:48:11,911 INFO L280 TraceCheckUtils]: 10: Hoare triple {2220#(and (= 0 main_~arr~0.offset) (= 0 main_~i~0))} assume !(~val~0 < 0); {2220#(and (= 0 main_~arr~0.offset) (= 0 main_~i~0))} is VALID [2020-07-29 00:48:11,912 INFO L280 TraceCheckUtils]: 11: Hoare triple {2220#(and (= 0 main_~arr~0.offset) (= 0 main_~i~0))} SUMMARY for call write~int(~val~0, ~arr~0.base, ~arr~0.offset + 4 * ~i~0, 4); srcloc: L521-2 {2220#(and (= 0 main_~arr~0.offset) (= 0 main_~i~0))} is VALID [2020-07-29 00:48:11,913 INFO L280 TraceCheckUtils]: 12: Hoare triple {2220#(and (= 0 main_~arr~0.offset) (= 0 main_~i~0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2221#(and (= 0 main_~arr~0.offset) (<= 1 main_~i~0))} is VALID [2020-07-29 00:48:11,914 INFO L280 TraceCheckUtils]: 13: Hoare triple {2221#(and (= 0 main_~arr~0.offset) (<= 1 main_~i~0))} assume !!(~i~0 < ~length~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~val~0 := #t~nondet5;havoc #t~nondet5; {2221#(and (= 0 main_~arr~0.offset) (<= 1 main_~i~0))} is VALID [2020-07-29 00:48:11,915 INFO L280 TraceCheckUtils]: 14: Hoare triple {2221#(and (= 0 main_~arr~0.offset) (<= 1 main_~i~0))} assume !(~val~0 < 0); {2221#(and (= 0 main_~arr~0.offset) (<= 1 main_~i~0))} is VALID [2020-07-29 00:48:11,917 INFO L280 TraceCheckUtils]: 15: Hoare triple {2221#(and (= 0 main_~arr~0.offset) (<= 1 main_~i~0))} SUMMARY for call write~int(~val~0, ~arr~0.base, ~arr~0.offset + 4 * ~i~0, 4); srcloc: L521-2 {2222#(and (<= (+ main_~arr~0.offset 8) (select |#length| main_~arr~0.base)) (= 0 main_~arr~0.offset))} is VALID [2020-07-29 00:48:11,918 INFO L280 TraceCheckUtils]: 16: Hoare triple {2222#(and (<= (+ main_~arr~0.offset 8) (select |#length| main_~arr~0.base)) (= 0 main_~arr~0.offset))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2222#(and (<= (+ main_~arr~0.offset 8) (select |#length| main_~arr~0.base)) (= 0 main_~arr~0.offset))} is VALID [2020-07-29 00:48:11,919 INFO L280 TraceCheckUtils]: 17: Hoare triple {2222#(and (<= (+ main_~arr~0.offset 8) (select |#length| main_~arr~0.base)) (= 0 main_~arr~0.offset))} assume !(~i~0 < ~length~0); {2222#(and (<= (+ main_~arr~0.offset 8) (select |#length| main_~arr~0.base)) (= 0 main_~arr~0.offset))} is VALID [2020-07-29 00:48:11,920 INFO L280 TraceCheckUtils]: 18: Hoare triple {2222#(and (<= (+ main_~arr~0.offset 8) (select |#length| main_~arr~0.base)) (= 0 main_~arr~0.offset))} ~j~0 := 0; {2223#(and (<= (+ main_~arr~0.offset 8) (select |#length| main_~arr~0.base)) (= 0 main_~arr~0.offset) (= 0 main_~j~0))} is VALID [2020-07-29 00:48:11,921 INFO L280 TraceCheckUtils]: 19: Hoare triple {2223#(and (<= (+ main_~arr~0.offset 8) (select |#length| main_~arr~0.base)) (= 0 main_~arr~0.offset) (= 0 main_~j~0))} assume !!(~j~0 < ~length~0); {2223#(and (<= (+ main_~arr~0.offset 8) (select |#length| main_~arr~0.base)) (= 0 main_~arr~0.offset) (= 0 main_~j~0))} is VALID [2020-07-29 00:48:11,922 INFO L280 TraceCheckUtils]: 20: Hoare triple {2223#(and (<= (+ main_~arr~0.offset 8) (select |#length| main_~arr~0.base)) (= 0 main_~arr~0.offset) (= 0 main_~j~0))} SUMMARY for call #t~mem7 := read~int(~arr~0.base, ~arr~0.offset + 4 * ~j~0, 4); srcloc: L527-3 {2223#(and (<= (+ main_~arr~0.offset 8) (select |#length| main_~arr~0.base)) (= 0 main_~arr~0.offset) (= 0 main_~j~0))} is VALID [2020-07-29 00:48:11,923 INFO L280 TraceCheckUtils]: 21: Hoare triple {2223#(and (<= (+ main_~arr~0.offset 8) (select |#length| main_~arr~0.base)) (= 0 main_~arr~0.offset) (= 0 main_~j~0))} assume !(#t~mem7 > 0);havoc #t~mem7; {2223#(and (<= (+ main_~arr~0.offset 8) (select |#length| main_~arr~0.base)) (= 0 main_~arr~0.offset) (= 0 main_~j~0))} is VALID [2020-07-29 00:48:11,924 INFO L280 TraceCheckUtils]: 22: Hoare triple {2223#(and (<= (+ main_~arr~0.offset 8) (select |#length| main_~arr~0.base)) (= 0 main_~arr~0.offset) (= 0 main_~j~0))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {2224#(and (<= (+ main_~arr~0.offset (* 4 main_~j~0) 4) (select |#length| main_~arr~0.base)) (<= 1 main_~j~0) (= 0 main_~arr~0.offset))} is VALID [2020-07-29 00:48:11,925 INFO L280 TraceCheckUtils]: 23: Hoare triple {2224#(and (<= (+ main_~arr~0.offset (* 4 main_~j~0) 4) (select |#length| main_~arr~0.base)) (<= 1 main_~j~0) (= 0 main_~arr~0.offset))} assume !!(~j~0 < ~length~0); {2224#(and (<= (+ main_~arr~0.offset (* 4 main_~j~0) 4) (select |#length| main_~arr~0.base)) (<= 1 main_~j~0) (= 0 main_~arr~0.offset))} is VALID [2020-07-29 00:48:11,927 INFO L280 TraceCheckUtils]: 24: Hoare triple {2224#(and (<= (+ main_~arr~0.offset (* 4 main_~j~0) 4) (select |#length| main_~arr~0.base)) (<= 1 main_~j~0) (= 0 main_~arr~0.offset))} assume !(4 + (~arr~0.offset + 4 * ~j~0) <= #length[~arr~0.base] && 0 <= ~arr~0.offset + 4 * ~j~0); {2215#false} is VALID [2020-07-29 00:48:11,928 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 00:48:11,929 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836707086] [2020-07-29 00:48:11,929 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260430700] [2020-07-29 00:48:11,929 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 00:48:12,040 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 00:48:12,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 00:48:12,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-29 00:48:12,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:48:12,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 00:48:12,069 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2020-07-29 00:48:12,070 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 00:48:12,078 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 00:48:12,078 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 00:48:12,079 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2020-07-29 00:48:12,085 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 00:48:12,085 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_14|]. (and (= 0 main_~arr~0.offset) (= |#length| (store |v_#length_14| main_~arr~0.base (* main_~length~0 4)))) [2020-07-29 00:48:12,085 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 main_~arr~0.offset) (= (select |#length| main_~arr~0.base) (* main_~length~0 4))) [2020-07-29 00:48:12,289 INFO L263 TraceCheckUtils]: 0: Hoare triple {2214#true} call ULTIMATE.init(); {2214#true} is VALID [2020-07-29 00:48:12,290 INFO L280 TraceCheckUtils]: 1: Hoare triple {2214#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2214#true} is VALID [2020-07-29 00:48:12,290 INFO L280 TraceCheckUtils]: 2: Hoare triple {2214#true} assume true; {2214#true} is VALID [2020-07-29 00:48:12,290 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2214#true} {2214#true} #89#return; {2214#true} is VALID [2020-07-29 00:48:12,291 INFO L263 TraceCheckUtils]: 4: Hoare triple {2214#true} call #t~ret10 := main(); {2214#true} is VALID [2020-07-29 00:48:12,291 INFO L280 TraceCheckUtils]: 5: Hoare triple {2214#true} havoc ~i~0;havoc ~j~0;havoc ~val~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~length~0 := #t~nondet2;havoc #t~nondet2; {2214#true} is VALID [2020-07-29 00:48:12,291 INFO L280 TraceCheckUtils]: 6: Hoare triple {2214#true} assume !(~length~0 < 1 || ~length~0 >= 536870911); {2214#true} is VALID [2020-07-29 00:48:12,293 INFO L280 TraceCheckUtils]: 7: Hoare triple {2214#true} call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnStack(4 * ~length~0);~arr~0.base, ~arr~0.offset := #t~malloc3.base, #t~malloc3.offset; {2250#(and (= 0 main_~arr~0.offset) (= (select |#length| main_~arr~0.base) (* 4 main_~length~0)))} is VALID [2020-07-29 00:48:12,293 INFO L280 TraceCheckUtils]: 8: Hoare triple {2250#(and (= 0 main_~arr~0.offset) (= (select |#length| main_~arr~0.base) (* 4 main_~length~0)))} assume !(~arr~0.base == 0 && ~arr~0.offset == 0);~i~0 := 0; {2250#(and (= 0 main_~arr~0.offset) (= (select |#length| main_~arr~0.base) (* 4 main_~length~0)))} is VALID [2020-07-29 00:48:12,294 INFO L280 TraceCheckUtils]: 9: Hoare triple {2250#(and (= 0 main_~arr~0.offset) (= (select |#length| main_~arr~0.base) (* 4 main_~length~0)))} assume !!(~i~0 < ~length~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~val~0 := #t~nondet5;havoc #t~nondet5; {2250#(and (= 0 main_~arr~0.offset) (= (select |#length| main_~arr~0.base) (* 4 main_~length~0)))} is VALID [2020-07-29 00:48:12,295 INFO L280 TraceCheckUtils]: 10: Hoare triple {2250#(and (= 0 main_~arr~0.offset) (= (select |#length| main_~arr~0.base) (* 4 main_~length~0)))} assume !(~val~0 < 0); {2250#(and (= 0 main_~arr~0.offset) (= (select |#length| main_~arr~0.base) (* 4 main_~length~0)))} is VALID [2020-07-29 00:48:12,295 INFO L280 TraceCheckUtils]: 11: Hoare triple {2250#(and (= 0 main_~arr~0.offset) (= (select |#length| main_~arr~0.base) (* 4 main_~length~0)))} SUMMARY for call write~int(~val~0, ~arr~0.base, ~arr~0.offset + 4 * ~i~0, 4); srcloc: L521-2 {2250#(and (= 0 main_~arr~0.offset) (= (select |#length| main_~arr~0.base) (* 4 main_~length~0)))} is VALID [2020-07-29 00:48:12,296 INFO L280 TraceCheckUtils]: 12: Hoare triple {2250#(and (= 0 main_~arr~0.offset) (= (select |#length| main_~arr~0.base) (* 4 main_~length~0)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2250#(and (= 0 main_~arr~0.offset) (= (select |#length| main_~arr~0.base) (* 4 main_~length~0)))} is VALID [2020-07-29 00:48:12,297 INFO L280 TraceCheckUtils]: 13: Hoare triple {2250#(and (= 0 main_~arr~0.offset) (= (select |#length| main_~arr~0.base) (* 4 main_~length~0)))} assume !!(~i~0 < ~length~0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~val~0 := #t~nondet5;havoc #t~nondet5; {2250#(and (= 0 main_~arr~0.offset) (= (select |#length| main_~arr~0.base) (* 4 main_~length~0)))} is VALID [2020-07-29 00:48:12,297 INFO L280 TraceCheckUtils]: 14: Hoare triple {2250#(and (= 0 main_~arr~0.offset) (= (select |#length| main_~arr~0.base) (* 4 main_~length~0)))} assume !(~val~0 < 0); {2250#(and (= 0 main_~arr~0.offset) (= (select |#length| main_~arr~0.base) (* 4 main_~length~0)))} is VALID [2020-07-29 00:48:12,298 INFO L280 TraceCheckUtils]: 15: Hoare triple {2250#(and (= 0 main_~arr~0.offset) (= (select |#length| main_~arr~0.base) (* 4 main_~length~0)))} SUMMARY for call write~int(~val~0, ~arr~0.base, ~arr~0.offset + 4 * ~i~0, 4); srcloc: L521-2 {2250#(and (= 0 main_~arr~0.offset) (= (select |#length| main_~arr~0.base) (* 4 main_~length~0)))} is VALID [2020-07-29 00:48:12,299 INFO L280 TraceCheckUtils]: 16: Hoare triple {2250#(and (= 0 main_~arr~0.offset) (= (select |#length| main_~arr~0.base) (* 4 main_~length~0)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2250#(and (= 0 main_~arr~0.offset) (= (select |#length| main_~arr~0.base) (* 4 main_~length~0)))} is VALID [2020-07-29 00:48:12,299 INFO L280 TraceCheckUtils]: 17: Hoare triple {2250#(and (= 0 main_~arr~0.offset) (= (select |#length| main_~arr~0.base) (* 4 main_~length~0)))} assume !(~i~0 < ~length~0); {2250#(and (= 0 main_~arr~0.offset) (= (select |#length| main_~arr~0.base) (* 4 main_~length~0)))} is VALID [2020-07-29 00:48:12,300 INFO L280 TraceCheckUtils]: 18: Hoare triple {2250#(and (= 0 main_~arr~0.offset) (= (select |#length| main_~arr~0.base) (* 4 main_~length~0)))} ~j~0 := 0; {2284#(and (= 0 main_~arr~0.offset) (<= 0 main_~j~0) (= (select |#length| main_~arr~0.base) (* 4 main_~length~0)))} is VALID [2020-07-29 00:48:12,301 INFO L280 TraceCheckUtils]: 19: Hoare triple {2284#(and (= 0 main_~arr~0.offset) (<= 0 main_~j~0) (= (select |#length| main_~arr~0.base) (* 4 main_~length~0)))} assume !!(~j~0 < ~length~0); {2284#(and (= 0 main_~arr~0.offset) (<= 0 main_~j~0) (= (select |#length| main_~arr~0.base) (* 4 main_~length~0)))} is VALID [2020-07-29 00:48:12,302 INFO L280 TraceCheckUtils]: 20: Hoare triple {2284#(and (= 0 main_~arr~0.offset) (<= 0 main_~j~0) (= (select |#length| main_~arr~0.base) (* 4 main_~length~0)))} SUMMARY for call #t~mem7 := read~int(~arr~0.base, ~arr~0.offset + 4 * ~j~0, 4); srcloc: L527-3 {2284#(and (= 0 main_~arr~0.offset) (<= 0 main_~j~0) (= (select |#length| main_~arr~0.base) (* 4 main_~length~0)))} is VALID [2020-07-29 00:48:12,304 INFO L280 TraceCheckUtils]: 21: Hoare triple {2284#(and (= 0 main_~arr~0.offset) (<= 0 main_~j~0) (= (select |#length| main_~arr~0.base) (* 4 main_~length~0)))} assume !(#t~mem7 > 0);havoc #t~mem7; {2284#(and (= 0 main_~arr~0.offset) (<= 0 main_~j~0) (= (select |#length| main_~arr~0.base) (* 4 main_~length~0)))} is VALID [2020-07-29 00:48:12,305 INFO L280 TraceCheckUtils]: 22: Hoare triple {2284#(and (= 0 main_~arr~0.offset) (<= 0 main_~j~0) (= (select |#length| main_~arr~0.base) (* 4 main_~length~0)))} #t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {2297#(and (<= 1 main_~j~0) (= 0 main_~arr~0.offset) (= (select |#length| main_~arr~0.base) (* 4 main_~length~0)))} is VALID [2020-07-29 00:48:12,306 INFO L280 TraceCheckUtils]: 23: Hoare triple {2297#(and (<= 1 main_~j~0) (= 0 main_~arr~0.offset) (= (select |#length| main_~arr~0.base) (* 4 main_~length~0)))} assume !!(~j~0 < ~length~0); {2301#(and (= (mod (* (select |#length| main_~arr~0.base) 3) (- 4)) 0) (<= 1 main_~j~0) (= 0 main_~arr~0.offset) (< main_~j~0 (div (* (select |#length| main_~arr~0.base) (- 1)) (- 4))))} is VALID [2020-07-29 00:48:12,308 INFO L280 TraceCheckUtils]: 24: Hoare triple {2301#(and (= (mod (* (select |#length| main_~arr~0.base) 3) (- 4)) 0) (<= 1 main_~j~0) (= 0 main_~arr~0.offset) (< main_~j~0 (div (* (select |#length| main_~arr~0.base) (- 1)) (- 4))))} assume !(4 + (~arr~0.offset + 4 * ~j~0) <= #length[~arr~0.base] && 0 <= ~arr~0.offset + 4 * ~j~0); {2215#false} is VALID [2020-07-29 00:48:12,310 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-29 00:48:12,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 00:48:12,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 12 [2020-07-29 00:48:12,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792929981] [2020-07-29 00:48:12,311 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2020-07-29 00:48:12,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 00:48:12,311 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-29 00:48:12,375 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:48:12,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-29 00:48:12,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 00:48:12,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-29 00:48:12,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-07-29 00:48:12,376 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 13 states. [2020-07-29 00:48:13,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:48:13,088 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2020-07-29 00:48:13,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-29 00:48:13,088 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2020-07-29 00:48:13,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 00:48:13,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-29 00:48:13,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 44 transitions. [2020-07-29 00:48:13,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-29 00:48:13,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 44 transitions. [2020-07-29 00:48:13,093 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 44 transitions. [2020-07-29 00:48:13,159 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:48:13,160 INFO L225 Difference]: With dead ends: 36 [2020-07-29 00:48:13,160 INFO L226 Difference]: Without dead ends: 0 [2020-07-29 00:48:13,161 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2020-07-29 00:48:13,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-29 00:48:13,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-29 00:48:13,161 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 00:48:13,162 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-29 00:48:13,162 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-29 00:48:13,162 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-29 00:48:13,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:48:13,162 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 00:48:13,162 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-29 00:48:13,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:48:13,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:48:13,163 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-29 00:48:13,163 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-29 00:48:13,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:48:13,163 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 00:48:13,163 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-29 00:48:13,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:48:13,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:48:13,164 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 00:48:13,164 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 00:48:13,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-29 00:48:13,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-29 00:48:13,164 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2020-07-29 00:48:13,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 00:48:13,164 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 00:48:13,164 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-29 00:48:13,164 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-29 00:48:13,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:48:13,367 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 00:48:13,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.07 12:48:13 BoogieIcfgContainer [2020-07-29 00:48:13,373 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-29 00:48:13,373 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 00:48:13,373 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 00:48:13,373 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 00:48:13,374 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 12:48:03" (3/4) ... [2020-07-29 00:48:13,378 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-29 00:48:13,386 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2020-07-29 00:48:13,386 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2020-07-29 00:48:13,386 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2020-07-29 00:48:13,386 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2020-07-29 00:48:13,387 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2020-07-29 00:48:13,387 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2020-07-29 00:48:13,387 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2020-07-29 00:48:13,392 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2020-07-29 00:48:13,392 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2020-07-29 00:48:13,392 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-07-29 00:48:13,393 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-07-29 00:48:13,435 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-29 00:48:13,436 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 00:48:13,438 INFO L168 Benchmark]: Toolchain (without parser) took 11696.69 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 311.4 MB). Free memory was 957.5 MB in the beginning and 1.2 GB in the end (delta: -241.9 MB). Peak memory consumption was 69.5 MB. Max. memory is 11.5 GB. [2020-07-29 00:48:13,438 INFO L168 Benchmark]: CDTParser took 0.37 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 00:48:13,439 INFO L168 Benchmark]: CACSL2BoogieTranslator took 682.76 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 957.5 MB in the beginning and 1.1 GB in the end (delta: -138.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2020-07-29 00:48:13,439 INFO L168 Benchmark]: Boogie Preprocessor took 64.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2020-07-29 00:48:13,440 INFO L168 Benchmark]: RCFGBuilder took 704.52 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.2 MB). Peak memory consumption was 58.2 MB. Max. memory is 11.5 GB. [2020-07-29 00:48:13,440 INFO L168 Benchmark]: TraceAbstraction took 10172.24 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 191.4 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -168.6 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. [2020-07-29 00:48:13,441 INFO L168 Benchmark]: Witness Printer took 62.70 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 00:48:13,443 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 0.37 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 682.76 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 957.5 MB in the beginning and 1.1 GB in the end (delta: -138.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 64.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 704.52 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.2 MB). Peak memory consumption was 58.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10172.24 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 191.4 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -168.6 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. * Witness Printer took 62.70 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 527]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 527]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 528]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 528]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 524]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 524]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 528]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 528]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 512]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 51 locations, 9 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 10.0s, OverallIterations: 11, TraceHistogramMax: 2, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 234 SDtfs, 559 SDslu, 433 SDs, 0 SdLazy, 788 SolverSat, 65 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 203 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 46 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 306 NumberOfCodeBlocks, 306 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 289 ConstructedInterpolants, 0 QuantifiedInterpolants, 28551 SizeOfPredicates, 15 NumberOfNonLiveVariables, 452 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 17 InterpolantComputations, 7 PerfectInterpolantSequences, 24/45 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 correct! Received shutdown request...