./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0158-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/memsafety/test-0158-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 a1ce2798c44b98d34c3d71501d399b3f4d974768 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:54:34,551 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 00:54:34,553 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 00:54:34,566 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 00:54:34,566 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 00:54:34,568 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 00:54:34,569 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 00:54:34,571 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 00:54:34,573 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 00:54:34,574 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 00:54:34,575 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 00:54:34,576 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 00:54:34,577 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 00:54:34,578 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 00:54:34,579 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 00:54:34,580 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 00:54:34,581 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 00:54:34,582 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 00:54:34,584 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 00:54:34,587 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 00:54:34,588 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 00:54:34,590 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 00:54:34,591 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 00:54:34,592 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 00:54:34,595 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 00:54:34,596 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 00:54:34,596 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 00:54:34,597 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 00:54:34,597 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 00:54:34,598 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 00:54:34,599 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 00:54:34,600 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 00:54:34,601 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 00:54:34,601 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 00:54:34,603 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 00:54:34,603 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 00:54:34,604 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 00:54:34,604 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 00:54:34,604 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 00:54:34,605 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 00:54:34,606 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 00:54:34,607 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:54:34,623 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 00:54:34,623 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 00:54:34,625 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 00:54:34,625 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 00:54:34,625 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 00:54:34,626 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 00:54:34,626 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 00:54:34,626 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 00:54:34,627 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 00:54:34,627 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 00:54:34,627 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 00:54:34,627 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-07-29 00:54:34,628 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-07-29 00:54:34,628 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-07-29 00:54:34,628 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-29 00:54:34,629 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-07-29 00:54:34,629 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 00:54:34,629 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 00:54:34,629 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 00:54:34,630 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 00:54:34,630 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-29 00:54:34,630 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-29 00:54:34,631 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 00:54:34,631 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 00:54:34,631 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-29 00:54:34,632 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 00:54:34,632 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-29 00:54:34,632 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 00:54:34,632 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 -> a1ce2798c44b98d34c3d71501d399b3f4d974768 [2020-07-29 00:54:34,932 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 00:54:34,952 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 00:54:34,955 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 00:54:34,957 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 00:54:34,961 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 00:54:34,962 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0158-1.i [2020-07-29 00:54:35,033 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1bcf6895/691f2a9d02744c849081f884a1a13295/FLAG3b3e920ea [2020-07-29 00:54:35,493 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 00:54:35,494 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0158-1.i [2020-07-29 00:54:35,507 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1bcf6895/691f2a9d02744c849081f884a1a13295/FLAG3b3e920ea [2020-07-29 00:54:35,793 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1bcf6895/691f2a9d02744c849081f884a1a13295 [2020-07-29 00:54:35,796 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 00:54:35,800 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-07-29 00:54:35,801 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 00:54:35,801 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 00:54:35,805 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 00:54:35,806 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 12:54:35" (1/1) ... [2020-07-29 00:54:35,809 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5571a702 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 12:54:35, skipping insertion in model container [2020-07-29 00:54:35,809 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 12:54:35" (1/1) ... [2020-07-29 00:54:35,816 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 00:54:35,875 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 00:54:36,281 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 00:54:36,293 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 00:54:36,348 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 00:54:36,406 INFO L208 MainTranslator]: Completed translation [2020-07-29 00:54:36,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 12:54:36 WrapperNode [2020-07-29 00:54:36,407 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 00:54:36,408 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 00:54:36,408 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 00:54:36,409 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 00:54:36,422 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 12:54:36" (1/1) ... [2020-07-29 00:54:36,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 12:54:36" (1/1) ... [2020-07-29 00:54:36,437 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 12:54:36" (1/1) ... [2020-07-29 00:54:36,438 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 12:54:36" (1/1) ... [2020-07-29 00:54:36,456 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 12:54:36" (1/1) ... [2020-07-29 00:54:36,457 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 12:54:36" (1/1) ... [2020-07-29 00:54:36,460 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 12:54:36" (1/1) ... [2020-07-29 00:54:36,466 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 00:54:36,467 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 00:54:36,467 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 00:54:36,467 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 00:54:36,468 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 12:54:36" (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:54:36,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-29 00:54:36,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 00:54:36,523 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-07-29 00:54:36,523 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-07-29 00:54:36,523 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2020-07-29 00:54:36,524 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2020-07-29 00:54:36,524 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2020-07-29 00:54:36,524 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-29 00:54:36,524 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-29 00:54:36,525 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-29 00:54:36,525 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-29 00:54:36,525 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-29 00:54:36,525 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-29 00:54:36,526 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-29 00:54:36,526 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-29 00:54:36,526 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-29 00:54:36,528 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-29 00:54:36,528 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-29 00:54:36,529 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-29 00:54:36,529 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-29 00:54:36,530 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-29 00:54:36,530 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-29 00:54:36,531 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-29 00:54:36,531 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-29 00:54:36,532 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-29 00:54:36,532 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-07-29 00:54:36,532 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-07-29 00:54:36,532 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2020-07-29 00:54:36,533 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2020-07-29 00:54:36,533 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2020-07-29 00:54:36,533 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-29 00:54:36,533 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-29 00:54:36,534 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-29 00:54:36,534 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-29 00:54:36,534 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-29 00:54:36,534 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-29 00:54:36,534 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-29 00:54:36,535 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-29 00:54:36,535 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-29 00:54:36,535 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-29 00:54:36,535 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-29 00:54:36,535 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-29 00:54:36,536 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-29 00:54:36,536 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-29 00:54:36,536 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-29 00:54:36,536 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-29 00:54:36,537 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-29 00:54:36,537 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-29 00:54:36,538 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-29 00:54:36,538 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-29 00:54:36,538 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-29 00:54:36,538 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-29 00:54:36,539 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-29 00:54:36,539 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-29 00:54:36,539 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-29 00:54:36,539 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-29 00:54:36,540 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-29 00:54:36,540 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-29 00:54:36,540 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-29 00:54:36,540 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-29 00:54:36,541 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-29 00:54:36,541 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-29 00:54:36,541 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-29 00:54:36,541 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-29 00:54:36,541 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-29 00:54:36,542 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-29 00:54:36,542 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-29 00:54:36,542 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-29 00:54:36,543 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-29 00:54:36,543 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-29 00:54:36,544 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-29 00:54:36,544 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-29 00:54:36,545 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-29 00:54:36,545 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-29 00:54:36,546 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-29 00:54:36,546 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-29 00:54:36,547 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-29 00:54:36,547 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-29 00:54:36,548 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-29 00:54:36,548 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-29 00:54:36,548 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-29 00:54:36,549 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-29 00:54:36,549 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-29 00:54:36,549 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-29 00:54:36,549 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-29 00:54:36,549 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-29 00:54:36,550 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-29 00:54:36,551 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-29 00:54:36,551 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-29 00:54:36,551 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-29 00:54:36,551 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-29 00:54:36,551 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-29 00:54:36,552 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-29 00:54:36,552 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-29 00:54:36,552 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-29 00:54:36,552 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-29 00:54:36,552 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-29 00:54:36,553 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-29 00:54:36,553 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-29 00:54:36,553 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-29 00:54:36,553 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-29 00:54:36,553 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-29 00:54:36,554 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-29 00:54:36,554 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-29 00:54:36,554 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-29 00:54:36,554 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-29 00:54:36,554 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-29 00:54:36,555 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-29 00:54:36,555 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-29 00:54:36,555 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-29 00:54:36,555 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-29 00:54:36,555 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-29 00:54:36,556 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-29 00:54:36,556 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-29 00:54:36,556 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-29 00:54:36,556 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-29 00:54:36,557 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-29 00:54:36,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 00:54:36,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-29 00:54:36,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-29 00:54:36,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-29 00:54:36,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 00:54:36,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-29 00:54:36,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 00:54:37,035 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 00:54:37,035 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-29 00:54:37,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 12:54:37 BoogieIcfgContainer [2020-07-29 00:54:37,039 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 00:54:37,041 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-29 00:54:37,041 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-29 00:54:37,044 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-29 00:54:37,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.07 12:54:35" (1/3) ... [2020-07-29 00:54:37,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dc98825 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 12:54:37, skipping insertion in model container [2020-07-29 00:54:37,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 12:54:36" (2/3) ... [2020-07-29 00:54:37,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dc98825 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 12:54:37, skipping insertion in model container [2020-07-29 00:54:37,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 12:54:37" (3/3) ... [2020-07-29 00:54:37,048 INFO L109 eAbstractionObserver]: Analyzing ICFG test-0158-1.i [2020-07-29 00:54:37,058 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-29 00:54:37,065 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2020-07-29 00:54:37,079 INFO L251 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2020-07-29 00:54:37,099 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-29 00:54:37,099 INFO L376 AbstractCegarLoop]: Hoare is false [2020-07-29 00:54:37,100 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-29 00:54:37,100 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 00:54:37,101 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 00:54:37,101 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-29 00:54:37,101 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 00:54:37,102 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-29 00:54:37,117 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2020-07-29 00:54:37,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-29 00:54:37,126 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 00:54:37,127 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 00:54:37,128 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr9ENSURES_VIOLATIONMEMORY_LEAK, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE]=== [2020-07-29 00:54:37,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 00:54:37,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1144947076, now seen corresponding path program 1 times [2020-07-29 00:54:37,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 00:54:37,145 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373248160] [2020-07-29 00:54:37,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 00:54:37,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:54:37,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 00:54:37,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:54:37,382 INFO L280 TraceCheckUtils]: 0: Hoare triple {35#(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; {29#true} is VALID [2020-07-29 00:54:37,383 INFO L280 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2020-07-29 00:54:37,384 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #34#return; {29#true} is VALID [2020-07-29 00:54:37,390 INFO L263 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {35#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 00:54:37,390 INFO L280 TraceCheckUtils]: 1: Hoare triple {35#(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; {29#true} is VALID [2020-07-29 00:54:37,390 INFO L280 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2020-07-29 00:54:37,391 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #34#return; {29#true} is VALID [2020-07-29 00:54:37,391 INFO L263 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret4 := main(); {29#true} is VALID [2020-07-29 00:54:37,394 INFO L280 TraceCheckUtils]: 5: Hoare triple {29#true} call ~#data~0.base, ~#data~0.offset := #Ultimate.allocOnStack(10);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(37); {34#(= 1 (select |#valid| |main_~#data~0.base|))} is VALID [2020-07-29 00:54:37,395 INFO L280 TraceCheckUtils]: 6: Hoare triple {34#(= 1 (select |#valid| |main_~#data~0.base|))} assume !(1 == #valid[~#data~0.base]); {30#false} is VALID [2020-07-29 00:54:37,396 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:54:37,397 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373248160] [2020-07-29 00:54:37,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 00:54:37,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 00:54:37,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783251885] [2020-07-29 00:54:37,406 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-29 00:54:37,409 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 00:54:37,415 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 00:54:37,433 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:54:37,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 00:54:37,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 00:54:37,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 00:54:37,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 00:54:37,448 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 4 states. [2020-07-29 00:54:37,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:54:37,609 INFO L93 Difference]: Finished difference Result 23 states and 22 transitions. [2020-07-29 00:54:37,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 00:54:37,609 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-29 00:54:37,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 00:54:37,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 00:54:37,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2020-07-29 00:54:37,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 00:54:37,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2020-07-29 00:54:37,627 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 25 transitions. [2020-07-29 00:54:37,671 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:54:37,682 INFO L225 Difference]: With dead ends: 23 [2020-07-29 00:54:37,682 INFO L226 Difference]: Without dead ends: 20 [2020-07-29 00:54:37,684 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:54:37,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-29 00:54:37,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-07-29 00:54:37,715 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 00:54:37,716 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2020-07-29 00:54:37,717 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2020-07-29 00:54:37,717 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2020-07-29 00:54:37,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:54:37,721 INFO L93 Difference]: Finished difference Result 20 states and 19 transitions. [2020-07-29 00:54:37,721 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 19 transitions. [2020-07-29 00:54:37,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:54:37,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:54:37,722 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2020-07-29 00:54:37,723 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2020-07-29 00:54:37,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:54:37,726 INFO L93 Difference]: Finished difference Result 20 states and 19 transitions. [2020-07-29 00:54:37,727 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 19 transitions. [2020-07-29 00:54:37,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:54:37,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:54:37,728 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 00:54:37,728 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 00:54:37,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-29 00:54:37,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 19 transitions. [2020-07-29 00:54:37,732 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 19 transitions. Word has length 7 [2020-07-29 00:54:37,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 00:54:37,733 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 19 transitions. [2020-07-29 00:54:37,733 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 00:54:37,733 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 19 transitions. [2020-07-29 00:54:37,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-29 00:54:37,734 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 00:54:37,734 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 00:54:37,735 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-29 00:54:37,735 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr9ENSURES_VIOLATIONMEMORY_LEAK, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE]=== [2020-07-29 00:54:37,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 00:54:37,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1144947077, now seen corresponding path program 1 times [2020-07-29 00:54:37,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 00:54:37,736 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581312641] [2020-07-29 00:54:37,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 00:54:37,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:54:37,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 00:54:37,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:54:37,860 INFO L280 TraceCheckUtils]: 0: Hoare triple {127#(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; {121#true} is VALID [2020-07-29 00:54:37,860 INFO L280 TraceCheckUtils]: 1: Hoare triple {121#true} assume true; {121#true} is VALID [2020-07-29 00:54:37,861 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {121#true} {121#true} #34#return; {121#true} is VALID [2020-07-29 00:54:37,862 INFO L263 TraceCheckUtils]: 0: Hoare triple {121#true} call ULTIMATE.init(); {127#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 00:54:37,863 INFO L280 TraceCheckUtils]: 1: Hoare triple {127#(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; {121#true} is VALID [2020-07-29 00:54:37,863 INFO L280 TraceCheckUtils]: 2: Hoare triple {121#true} assume true; {121#true} is VALID [2020-07-29 00:54:37,863 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {121#true} {121#true} #34#return; {121#true} is VALID [2020-07-29 00:54:37,864 INFO L263 TraceCheckUtils]: 4: Hoare triple {121#true} call #t~ret4 := main(); {121#true} is VALID [2020-07-29 00:54:37,866 INFO L280 TraceCheckUtils]: 5: Hoare triple {121#true} call ~#data~0.base, ~#data~0.offset := #Ultimate.allocOnStack(10);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(37); {126#(and (= 10 (select |#length| |main_~#data~0.base|)) (= 0 |main_~#data~0.offset|))} is VALID [2020-07-29 00:54:37,867 INFO L280 TraceCheckUtils]: 6: Hoare triple {126#(and (= 10 (select |#length| |main_~#data~0.base|)) (= 0 |main_~#data~0.offset|))} assume !(4 + ~#data~0.offset <= #length[~#data~0.base] && 0 <= ~#data~0.offset); {122#false} is VALID [2020-07-29 00:54:37,868 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:54:37,868 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581312641] [2020-07-29 00:54:37,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 00:54:37,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 00:54:37,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768441879] [2020-07-29 00:54:37,871 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-29 00:54:37,871 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 00:54:37,872 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 00:54:37,887 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:54:37,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 00:54:37,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 00:54:37,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 00:54:37,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 00:54:37,889 INFO L87 Difference]: Start difference. First operand 20 states and 19 transitions. Second operand 4 states. [2020-07-29 00:54:37,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:54:37,978 INFO L93 Difference]: Finished difference Result 17 states and 16 transitions. [2020-07-29 00:54:37,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 00:54:37,979 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-29 00:54:37,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 00:54:37,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 00:54:37,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2020-07-29 00:54:37,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 00:54:37,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2020-07-29 00:54:37,984 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 19 transitions. [2020-07-29 00:54:38,017 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:54:38,019 INFO L225 Difference]: With dead ends: 17 [2020-07-29 00:54:38,019 INFO L226 Difference]: Without dead ends: 17 [2020-07-29 00:54:38,020 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:54:38,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-07-29 00:54:38,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-07-29 00:54:38,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 00:54:38,023 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2020-07-29 00:54:38,023 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2020-07-29 00:54:38,023 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2020-07-29 00:54:38,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:54:38,025 INFO L93 Difference]: Finished difference Result 17 states and 16 transitions. [2020-07-29 00:54:38,026 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 16 transitions. [2020-07-29 00:54:38,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:54:38,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:54:38,027 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2020-07-29 00:54:38,027 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2020-07-29 00:54:38,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:54:38,029 INFO L93 Difference]: Finished difference Result 17 states and 16 transitions. [2020-07-29 00:54:38,029 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 16 transitions. [2020-07-29 00:54:38,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:54:38,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:54:38,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 00:54:38,031 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 00:54:38,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-29 00:54:38,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 16 transitions. [2020-07-29 00:54:38,033 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 16 transitions. Word has length 7 [2020-07-29 00:54:38,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 00:54:38,033 INFO L479 AbstractCegarLoop]: Abstraction has 17 states and 16 transitions. [2020-07-29 00:54:38,033 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 00:54:38,034 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 16 transitions. [2020-07-29 00:54:38,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-29 00:54:38,034 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 00:54:38,035 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 00:54:38,035 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-29 00:54:38,035 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr9ENSURES_VIOLATIONMEMORY_LEAK, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE]=== [2020-07-29 00:54:38,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 00:54:38,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1511941492, now seen corresponding path program 1 times [2020-07-29 00:54:38,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 00:54:38,037 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982292100] [2020-07-29 00:54:38,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 00:54:38,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:54:38,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 00:54:38,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:54:38,173 INFO L280 TraceCheckUtils]: 0: Hoare triple {206#(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; {198#true} is VALID [2020-07-29 00:54:38,173 INFO L280 TraceCheckUtils]: 1: Hoare triple {198#true} assume true; {198#true} is VALID [2020-07-29 00:54:38,174 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {198#true} {198#true} #34#return; {198#true} is VALID [2020-07-29 00:54:38,175 INFO L263 TraceCheckUtils]: 0: Hoare triple {198#true} call ULTIMATE.init(); {206#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 00:54:38,176 INFO L280 TraceCheckUtils]: 1: Hoare triple {206#(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; {198#true} is VALID [2020-07-29 00:54:38,176 INFO L280 TraceCheckUtils]: 2: Hoare triple {198#true} assume true; {198#true} is VALID [2020-07-29 00:54:38,176 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {198#true} {198#true} #34#return; {198#true} is VALID [2020-07-29 00:54:38,177 INFO L263 TraceCheckUtils]: 4: Hoare triple {198#true} call #t~ret4 := main(); {198#true} is VALID [2020-07-29 00:54:38,178 INFO L280 TraceCheckUtils]: 5: Hoare triple {198#true} call ~#data~0.base, ~#data~0.offset := #Ultimate.allocOnStack(10);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(37); {203#(= 0 |main_#t~malloc2.offset|)} is VALID [2020-07-29 00:54:38,179 INFO L280 TraceCheckUtils]: 6: Hoare triple {203#(= 0 |main_#t~malloc2.offset|)} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#data~0.base, ~#data~0.offset, 4); srcloc: L522 {204#(= 0 (select (store (select |#memory_$Pointer$.offset| |main_~#data~0.base|) (+ |main_~#data~0.offset| 6) |main_~#data~0.offset|) |main_~#data~0.offset|))} is VALID [2020-07-29 00:54:38,181 INFO L280 TraceCheckUtils]: 7: Hoare triple {204#(= 0 (select (store (select |#memory_$Pointer$.offset| |main_~#data~0.base|) (+ |main_~#data~0.offset| 6) |main_~#data~0.offset|) |main_~#data~0.offset|))} SUMMARY for call write~$Pointer$(~#data~0.base, ~#data~0.offset, ~#data~0.base, 6 + ~#data~0.offset, 4); srcloc: L522-1 {204#(= 0 (select (store (select |#memory_$Pointer$.offset| |main_~#data~0.base|) (+ |main_~#data~0.offset| 6) |main_~#data~0.offset|) |main_~#data~0.offset|))} is VALID [2020-07-29 00:54:38,182 INFO L280 TraceCheckUtils]: 8: Hoare triple {204#(= 0 (select (store (select |#memory_$Pointer$.offset| |main_~#data~0.base|) (+ |main_~#data~0.offset| 6) |main_~#data~0.offset|) |main_~#data~0.offset|))} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#data~0.base, ~#data~0.offset, 4); srcloc: L523 {205#(= 0 |main_#t~mem3.offset|)} is VALID [2020-07-29 00:54:38,183 INFO L280 TraceCheckUtils]: 9: Hoare triple {205#(= 0 |main_#t~mem3.offset|)} assume !(0 == #t~mem3.offset); {199#false} is VALID [2020-07-29 00:54:38,185 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:54:38,185 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982292100] [2020-07-29 00:54:38,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 00:54:38,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 00:54:38,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472062554] [2020-07-29 00:54:38,186 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-07-29 00:54:38,187 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 00:54:38,187 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 00:54:38,203 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:54:38,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-29 00:54:38,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 00:54:38,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 00:54:38,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-29 00:54:38,204 INFO L87 Difference]: Start difference. First operand 17 states and 16 transitions. Second operand 6 states. [2020-07-29 00:54:38,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:54:38,344 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2020-07-29 00:54:38,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 00:54:38,344 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-07-29 00:54:38,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 00:54:38,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 00:54:38,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 16 transitions. [2020-07-29 00:54:38,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 00:54:38,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 16 transitions. [2020-07-29 00:54:38,348 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 16 transitions. [2020-07-29 00:54:38,371 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:54:38,372 INFO L225 Difference]: With dead ends: 16 [2020-07-29 00:54:38,372 INFO L226 Difference]: Without dead ends: 16 [2020-07-29 00:54:38,373 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-29 00:54:38,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-29 00:54:38,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-29 00:54:38,376 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 00:54:38,376 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2020-07-29 00:54:38,376 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-29 00:54:38,376 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-29 00:54:38,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:54:38,378 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2020-07-29 00:54:38,378 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2020-07-29 00:54:38,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:54:38,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:54:38,379 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-29 00:54:38,379 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-29 00:54:38,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:54:38,381 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2020-07-29 00:54:38,381 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2020-07-29 00:54:38,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:54:38,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:54:38,382 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 00:54:38,383 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 00:54:38,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-29 00:54:38,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 15 transitions. [2020-07-29 00:54:38,384 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 15 transitions. Word has length 10 [2020-07-29 00:54:38,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 00:54:38,385 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 15 transitions. [2020-07-29 00:54:38,385 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-29 00:54:38,385 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2020-07-29 00:54:38,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-29 00:54:38,386 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 00:54:38,386 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 00:54:38,387 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-29 00:54:38,387 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr9ENSURES_VIOLATIONMEMORY_LEAK, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE]=== [2020-07-29 00:54:38,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 00:54:38,388 INFO L82 PathProgramCache]: Analyzing trace with hash 374454055, now seen corresponding path program 1 times [2020-07-29 00:54:38,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 00:54:38,389 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061845615] [2020-07-29 00:54:38,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 00:54:38,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:54:38,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 00:54:38,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:54:38,525 INFO L280 TraceCheckUtils]: 0: Hoare triple {285#(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; {277#true} is VALID [2020-07-29 00:54:38,526 INFO L280 TraceCheckUtils]: 1: Hoare triple {277#true} assume true; {277#true} is VALID [2020-07-29 00:54:38,527 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {277#true} {277#true} #34#return; {277#true} is VALID [2020-07-29 00:54:38,536 INFO L263 TraceCheckUtils]: 0: Hoare triple {277#true} call ULTIMATE.init(); {285#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 00:54:38,537 INFO L280 TraceCheckUtils]: 1: Hoare triple {285#(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; {277#true} is VALID [2020-07-29 00:54:38,537 INFO L280 TraceCheckUtils]: 2: Hoare triple {277#true} assume true; {277#true} is VALID [2020-07-29 00:54:38,537 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {277#true} {277#true} #34#return; {277#true} is VALID [2020-07-29 00:54:38,538 INFO L263 TraceCheckUtils]: 4: Hoare triple {277#true} call #t~ret4 := main(); {277#true} is VALID [2020-07-29 00:54:38,539 INFO L280 TraceCheckUtils]: 5: Hoare triple {277#true} call ~#data~0.base, ~#data~0.offset := #Ultimate.allocOnStack(10);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(37); {282#(<= (+ |main_#t~malloc2.base| 1) |#StackHeapBarrier|)} is VALID [2020-07-29 00:54:38,541 INFO L280 TraceCheckUtils]: 6: Hoare triple {282#(<= (+ |main_#t~malloc2.base| 1) |#StackHeapBarrier|)} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#data~0.base, ~#data~0.offset, 4); srcloc: L522 {283#(<= (+ (select (store (select |#memory_$Pointer$.base| |main_~#data~0.base|) (+ |main_~#data~0.offset| 6) |main_~#data~0.base|) |main_~#data~0.offset|) 1) |#StackHeapBarrier|)} is VALID [2020-07-29 00:54:38,542 INFO L280 TraceCheckUtils]: 7: Hoare triple {283#(<= (+ (select (store (select |#memory_$Pointer$.base| |main_~#data~0.base|) (+ |main_~#data~0.offset| 6) |main_~#data~0.base|) |main_~#data~0.offset|) 1) |#StackHeapBarrier|)} SUMMARY for call write~$Pointer$(~#data~0.base, ~#data~0.offset, ~#data~0.base, 6 + ~#data~0.offset, 4); srcloc: L522-1 {283#(<= (+ (select (store (select |#memory_$Pointer$.base| |main_~#data~0.base|) (+ |main_~#data~0.offset| 6) |main_~#data~0.base|) |main_~#data~0.offset|) 1) |#StackHeapBarrier|)} is VALID [2020-07-29 00:54:38,543 INFO L280 TraceCheckUtils]: 8: Hoare triple {283#(<= (+ (select (store (select |#memory_$Pointer$.base| |main_~#data~0.base|) (+ |main_~#data~0.offset| 6) |main_~#data~0.base|) |main_~#data~0.offset|) 1) |#StackHeapBarrier|)} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#data~0.base, ~#data~0.offset, 4); srcloc: L523 {284#(<= (+ |main_#t~mem3.base| 1) |#StackHeapBarrier|)} is VALID [2020-07-29 00:54:38,544 INFO L280 TraceCheckUtils]: 9: Hoare triple {284#(<= (+ |main_#t~mem3.base| 1) |#StackHeapBarrier|)} assume 0 == #t~mem3.offset; {284#(<= (+ |main_#t~mem3.base| 1) |#StackHeapBarrier|)} is VALID [2020-07-29 00:54:38,545 INFO L280 TraceCheckUtils]: 10: Hoare triple {284#(<= (+ |main_#t~mem3.base| 1) |#StackHeapBarrier|)} assume !(#t~mem3.base < #StackHeapBarrier); {278#false} is VALID [2020-07-29 00:54:38,546 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:54:38,546 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061845615] [2020-07-29 00:54:38,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 00:54:38,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 00:54:38,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461310888] [2020-07-29 00:54:38,549 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-07-29 00:54:38,549 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 00:54:38,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 00:54:38,573 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:54:38,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-29 00:54:38,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 00:54:38,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 00:54:38,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-29 00:54:38,574 INFO L87 Difference]: Start difference. First operand 16 states and 15 transitions. Second operand 6 states. [2020-07-29 00:54:38,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:54:38,728 INFO L93 Difference]: Finished difference Result 15 states and 14 transitions. [2020-07-29 00:54:38,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 00:54:38,729 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-07-29 00:54:38,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 00:54:38,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 00:54:38,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2020-07-29 00:54:38,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 00:54:38,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2020-07-29 00:54:38,737 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 15 transitions. [2020-07-29 00:54:38,760 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:54:38,760 INFO L225 Difference]: With dead ends: 15 [2020-07-29 00:54:38,761 INFO L226 Difference]: Without dead ends: 15 [2020-07-29 00:54:38,762 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-29 00:54:38,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2020-07-29 00:54:38,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-07-29 00:54:38,764 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 00:54:38,764 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2020-07-29 00:54:38,765 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2020-07-29 00:54:38,765 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2020-07-29 00:54:38,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:54:38,768 INFO L93 Difference]: Finished difference Result 15 states and 14 transitions. [2020-07-29 00:54:38,768 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 14 transitions. [2020-07-29 00:54:38,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:54:38,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:54:38,769 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2020-07-29 00:54:38,769 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2020-07-29 00:54:38,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:54:38,774 INFO L93 Difference]: Finished difference Result 15 states and 14 transitions. [2020-07-29 00:54:38,774 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 14 transitions. [2020-07-29 00:54:38,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:54:38,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:54:38,775 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 00:54:38,775 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 00:54:38,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-29 00:54:38,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 14 transitions. [2020-07-29 00:54:38,777 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 14 transitions. Word has length 11 [2020-07-29 00:54:38,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 00:54:38,777 INFO L479 AbstractCegarLoop]: Abstraction has 15 states and 14 transitions. [2020-07-29 00:54:38,777 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-29 00:54:38,778 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 14 transitions. [2020-07-29 00:54:38,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-29 00:54:38,778 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 00:54:38,778 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 00:54:38,779 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-29 00:54:38,780 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr9ENSURES_VIOLATIONMEMORY_LEAK, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE]=== [2020-07-29 00:54:38,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 00:54:38,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1276826130, now seen corresponding path program 1 times [2020-07-29 00:54:38,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 00:54:38,782 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285685546] [2020-07-29 00:54:38,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 00:54:38,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:54:38,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 00:54:38,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:54:38,928 INFO L280 TraceCheckUtils]: 0: Hoare triple {360#(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; {352#true} is VALID [2020-07-29 00:54:38,928 INFO L280 TraceCheckUtils]: 1: Hoare triple {352#true} assume true; {352#true} is VALID [2020-07-29 00:54:38,928 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {352#true} {352#true} #34#return; {352#true} is VALID [2020-07-29 00:54:38,933 INFO L263 TraceCheckUtils]: 0: Hoare triple {352#true} call ULTIMATE.init(); {360#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 00:54:38,933 INFO L280 TraceCheckUtils]: 1: Hoare triple {360#(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; {352#true} is VALID [2020-07-29 00:54:38,933 INFO L280 TraceCheckUtils]: 2: Hoare triple {352#true} assume true; {352#true} is VALID [2020-07-29 00:54:38,933 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {352#true} {352#true} #34#return; {352#true} is VALID [2020-07-29 00:54:38,934 INFO L263 TraceCheckUtils]: 4: Hoare triple {352#true} call #t~ret4 := main(); {352#true} is VALID [2020-07-29 00:54:38,935 INFO L280 TraceCheckUtils]: 5: Hoare triple {352#true} call ~#data~0.base, ~#data~0.offset := #Ultimate.allocOnStack(10);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(37); {357#(= (select |#valid| |main_#t~malloc2.base|) 1)} is VALID [2020-07-29 00:54:38,937 INFO L280 TraceCheckUtils]: 6: Hoare triple {357#(= (select |#valid| |main_#t~malloc2.base|) 1)} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#data~0.base, ~#data~0.offset, 4); srcloc: L522 {358#(= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| |main_~#data~0.base|) (+ |main_~#data~0.offset| 6) |main_~#data~0.base|) |main_~#data~0.offset|)))} is VALID [2020-07-29 00:54:38,938 INFO L280 TraceCheckUtils]: 7: Hoare triple {358#(= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| |main_~#data~0.base|) (+ |main_~#data~0.offset| 6) |main_~#data~0.base|) |main_~#data~0.offset|)))} SUMMARY for call write~$Pointer$(~#data~0.base, ~#data~0.offset, ~#data~0.base, 6 + ~#data~0.offset, 4); srcloc: L522-1 {358#(= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| |main_~#data~0.base|) (+ |main_~#data~0.offset| 6) |main_~#data~0.base|) |main_~#data~0.offset|)))} is VALID [2020-07-29 00:54:38,941 INFO L280 TraceCheckUtils]: 8: Hoare triple {358#(= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| |main_~#data~0.base|) (+ |main_~#data~0.offset| 6) |main_~#data~0.base|) |main_~#data~0.offset|)))} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#data~0.base, ~#data~0.offset, 4); srcloc: L523 {359#(= 1 (select |#valid| |main_#t~mem3.base|))} is VALID [2020-07-29 00:54:38,942 INFO L280 TraceCheckUtils]: 9: Hoare triple {359#(= 1 (select |#valid| |main_#t~mem3.base|))} assume 0 == #t~mem3.offset; {359#(= 1 (select |#valid| |main_#t~mem3.base|))} is VALID [2020-07-29 00:54:38,942 INFO L280 TraceCheckUtils]: 10: Hoare triple {359#(= 1 (select |#valid| |main_#t~mem3.base|))} assume #t~mem3.base < #StackHeapBarrier; {359#(= 1 (select |#valid| |main_#t~mem3.base|))} is VALID [2020-07-29 00:54:38,945 INFO L280 TraceCheckUtils]: 11: Hoare triple {359#(= 1 (select |#valid| |main_#t~mem3.base|))} assume !(0 == #t~mem3.base || 1 == #valid[#t~mem3.base]); {353#false} is VALID [2020-07-29 00:54:38,946 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:54:38,946 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285685546] [2020-07-29 00:54:38,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 00:54:38,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 00:54:38,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889819167] [2020-07-29 00:54:38,949 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-07-29 00:54:38,949 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 00:54:38,949 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 00:54:38,967 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:54:38,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-29 00:54:38,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 00:54:38,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 00:54:38,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-29 00:54:38,969 INFO L87 Difference]: Start difference. First operand 15 states and 14 transitions. Second operand 6 states. [2020-07-29 00:54:39,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:54:39,132 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2020-07-29 00:54:39,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 00:54:39,133 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-07-29 00:54:39,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 00:54:39,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 00:54:39,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2020-07-29 00:54:39,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 00:54:39,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2020-07-29 00:54:39,136 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 14 transitions. [2020-07-29 00:54:39,162 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:54:39,164 INFO L225 Difference]: With dead ends: 14 [2020-07-29 00:54:39,164 INFO L226 Difference]: Without dead ends: 14 [2020-07-29 00:54:39,164 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-29 00:54:39,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-07-29 00:54:39,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-07-29 00:54:39,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 00:54:39,166 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2020-07-29 00:54:39,166 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-29 00:54:39,167 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-29 00:54:39,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:54:39,168 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2020-07-29 00:54:39,168 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2020-07-29 00:54:39,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:54:39,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:54:39,169 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-29 00:54:39,169 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-29 00:54:39,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:54:39,171 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2020-07-29 00:54:39,171 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2020-07-29 00:54:39,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:54:39,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:54:39,171 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 00:54:39,172 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 00:54:39,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-29 00:54:39,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 13 transitions. [2020-07-29 00:54:39,173 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 13 transitions. Word has length 12 [2020-07-29 00:54:39,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 00:54:39,173 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 13 transitions. [2020-07-29 00:54:39,173 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-29 00:54:39,173 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2020-07-29 00:54:39,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-29 00:54:39,174 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 00:54:39,174 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 00:54:39,174 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-29 00:54:39,175 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr9ENSURES_VIOLATIONMEMORY_LEAK, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE]=== [2020-07-29 00:54:39,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 00:54:39,175 INFO L82 PathProgramCache]: Analyzing trace with hash -926904310, now seen corresponding path program 1 times [2020-07-29 00:54:39,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 00:54:39,176 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097294046] [2020-07-29 00:54:39,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 00:54:39,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:54:39,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 00:54:39,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 00:54:39,377 INFO L280 TraceCheckUtils]: 0: Hoare triple {432#(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; {423#true} is VALID [2020-07-29 00:54:39,377 INFO L280 TraceCheckUtils]: 1: Hoare triple {423#true} assume true; {423#true} is VALID [2020-07-29 00:54:39,378 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {423#true} {423#true} #34#return; {423#true} is VALID [2020-07-29 00:54:39,379 INFO L263 TraceCheckUtils]: 0: Hoare triple {423#true} call ULTIMATE.init(); {432#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 00:54:39,379 INFO L280 TraceCheckUtils]: 1: Hoare triple {432#(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; {423#true} is VALID [2020-07-29 00:54:39,380 INFO L280 TraceCheckUtils]: 2: Hoare triple {423#true} assume true; {423#true} is VALID [2020-07-29 00:54:39,380 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {423#true} {423#true} #34#return; {423#true} is VALID [2020-07-29 00:54:39,381 INFO L263 TraceCheckUtils]: 4: Hoare triple {423#true} call #t~ret4 := main(); {428#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 00:54:39,382 INFO L280 TraceCheckUtils]: 5: Hoare triple {428#(= |#valid| |old(#valid)|)} call ~#data~0.base, ~#data~0.offset := #Ultimate.allocOnStack(10);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(37); {429#(and (= |old(#valid)| (store (store |#valid| |main_#t~malloc2.base| 0) |main_~#data~0.base| 0)) (not (= |main_#t~malloc2.base| |main_~#data~0.base|)))} is VALID [2020-07-29 00:54:39,383 INFO L280 TraceCheckUtils]: 6: Hoare triple {429#(and (= |old(#valid)| (store (store |#valid| |main_#t~malloc2.base| 0) |main_~#data~0.base| 0)) (not (= |main_#t~malloc2.base| |main_~#data~0.base|)))} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#data~0.base, ~#data~0.offset, 4); srcloc: L522 {430#(and (not (= (select (store (select |#memory_$Pointer$.base| |main_~#data~0.base|) (+ |main_~#data~0.offset| 6) |main_~#data~0.base|) |main_~#data~0.offset|) |main_~#data~0.base|)) (= (store (store |#valid| (select (store (select |#memory_$Pointer$.base| |main_~#data~0.base|) (+ |main_~#data~0.offset| 6) |main_~#data~0.base|) |main_~#data~0.offset|) 0) |main_~#data~0.base| 0) |old(#valid)|))} is VALID [2020-07-29 00:54:39,385 INFO L280 TraceCheckUtils]: 7: Hoare triple {430#(and (not (= (select (store (select |#memory_$Pointer$.base| |main_~#data~0.base|) (+ |main_~#data~0.offset| 6) |main_~#data~0.base|) |main_~#data~0.offset|) |main_~#data~0.base|)) (= (store (store |#valid| (select (store (select |#memory_$Pointer$.base| |main_~#data~0.base|) (+ |main_~#data~0.offset| 6) |main_~#data~0.base|) |main_~#data~0.offset|) 0) |main_~#data~0.base| 0) |old(#valid)|))} SUMMARY for call write~$Pointer$(~#data~0.base, ~#data~0.offset, ~#data~0.base, 6 + ~#data~0.offset, 4); srcloc: L522-1 {430#(and (not (= (select (store (select |#memory_$Pointer$.base| |main_~#data~0.base|) (+ |main_~#data~0.offset| 6) |main_~#data~0.base|) |main_~#data~0.offset|) |main_~#data~0.base|)) (= (store (store |#valid| (select (store (select |#memory_$Pointer$.base| |main_~#data~0.base|) (+ |main_~#data~0.offset| 6) |main_~#data~0.base|) |main_~#data~0.offset|) 0) |main_~#data~0.base| 0) |old(#valid)|))} is VALID [2020-07-29 00:54:39,386 INFO L280 TraceCheckUtils]: 8: Hoare triple {430#(and (not (= (select (store (select |#memory_$Pointer$.base| |main_~#data~0.base|) (+ |main_~#data~0.offset| 6) |main_~#data~0.base|) |main_~#data~0.offset|) |main_~#data~0.base|)) (= (store (store |#valid| (select (store (select |#memory_$Pointer$.base| |main_~#data~0.base|) (+ |main_~#data~0.offset| 6) |main_~#data~0.base|) |main_~#data~0.offset|) 0) |main_~#data~0.base| 0) |old(#valid)|))} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#data~0.base, ~#data~0.offset, 4); srcloc: L523 {431#(and (= (store (store |#valid| |main_#t~mem3.base| 0) |main_~#data~0.base| 0) |old(#valid)|) (not (= |main_#t~mem3.base| |main_~#data~0.base|)))} is VALID [2020-07-29 00:54:39,386 INFO L280 TraceCheckUtils]: 9: Hoare triple {431#(and (= (store (store |#valid| |main_#t~mem3.base| 0) |main_~#data~0.base| 0) |old(#valid)|) (not (= |main_#t~mem3.base| |main_~#data~0.base|)))} assume 0 == #t~mem3.offset; {431#(and (= (store (store |#valid| |main_#t~mem3.base| 0) |main_~#data~0.base| 0) |old(#valid)|) (not (= |main_#t~mem3.base| |main_~#data~0.base|)))} is VALID [2020-07-29 00:54:39,387 INFO L280 TraceCheckUtils]: 10: Hoare triple {431#(and (= (store (store |#valid| |main_#t~mem3.base| 0) |main_~#data~0.base| 0) |old(#valid)|) (not (= |main_#t~mem3.base| |main_~#data~0.base|)))} assume #t~mem3.base < #StackHeapBarrier; {431#(and (= (store (store |#valid| |main_#t~mem3.base| 0) |main_~#data~0.base| 0) |old(#valid)|) (not (= |main_#t~mem3.base| |main_~#data~0.base|)))} is VALID [2020-07-29 00:54:39,388 INFO L280 TraceCheckUtils]: 11: Hoare triple {431#(and (= (store (store |#valid| |main_#t~mem3.base| 0) |main_~#data~0.base| 0) |old(#valid)|) (not (= |main_#t~mem3.base| |main_~#data~0.base|)))} assume 0 == #t~mem3.base || 1 == #valid[#t~mem3.base];call ULTIMATE.dealloc(#t~mem3.base, #t~mem3.offset);havoc #t~mem3.base, #t~mem3.offset;#res := 0;call ULTIMATE.dealloc(~#data~0.base, ~#data~0.offset);havoc ~#data~0.base, ~#data~0.offset; {428#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 00:54:39,389 INFO L280 TraceCheckUtils]: 12: Hoare triple {428#(= |#valid| |old(#valid)|)} assume !(#valid == old(#valid)); {424#false} is VALID [2020-07-29 00:54:39,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 00:54:39,390 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097294046] [2020-07-29 00:54:39,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 00:54:39,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-29 00:54:39,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43195013] [2020-07-29 00:54:39,391 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2020-07-29 00:54:39,392 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 00:54:39,392 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 00:54:39,431 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:54:39,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-29 00:54:39,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 00:54:39,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 00:54:39,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-29 00:54:39,432 INFO L87 Difference]: Start difference. First operand 14 states and 13 transitions. Second operand 7 states. [2020-07-29 00:54:39,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:54:39,642 INFO L93 Difference]: Finished difference Result 13 states and 12 transitions. [2020-07-29 00:54:39,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 00:54:39,642 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2020-07-29 00:54:39,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 00:54:39,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 00:54:39,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2020-07-29 00:54:39,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 00:54:39,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2020-07-29 00:54:39,649 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 13 transitions. [2020-07-29 00:54:39,671 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 00:54:39,672 INFO L225 Difference]: With dead ends: 13 [2020-07-29 00:54:39,672 INFO L226 Difference]: Without dead ends: 0 [2020-07-29 00:54:39,673 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-29 00:54:39,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-29 00:54:39,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-29 00:54:39,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 00:54:39,673 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-29 00:54:39,673 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-29 00:54:39,674 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-29 00:54:39,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:54:39,674 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 00:54:39,674 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-29 00:54:39,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:54:39,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:54:39,674 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-29 00:54:39,675 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-29 00:54:39,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 00:54:39,675 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 00:54:39,675 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-29 00:54:39,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:54:39,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 00:54:39,676 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 00:54:39,676 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 00:54:39,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-29 00:54:39,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-29 00:54:39,676 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2020-07-29 00:54:39,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 00:54:39,677 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 00:54:39,677 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-29 00:54:39,677 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-29 00:54:39,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 00:54:39,677 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-29 00:54:39,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.07 12:54:39 BoogieIcfgContainer [2020-07-29 00:54:39,683 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-29 00:54:39,684 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 00:54:39,684 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 00:54:39,684 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 00:54:39,685 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 12:54:37" (3/4) ... [2020-07-29 00:54:39,688 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-29 00:54:39,694 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2020-07-29 00:54:39,695 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2020-07-29 00:54:39,695 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2020-07-29 00:54:39,695 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2020-07-29 00:54:39,696 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2020-07-29 00:54:39,696 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2020-07-29 00:54:39,696 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2020-07-29 00:54:39,709 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2020-07-29 00:54:39,710 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-07-29 00:54:39,710 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-07-29 00:54:39,711 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-07-29 00:54:39,760 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-29 00:54:39,760 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 00:54:39,764 INFO L168 Benchmark]: Toolchain (without parser) took 3965.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 206.0 MB). Free memory was 957.5 MB in the beginning and 1.2 GB in the end (delta: -202.1 MB). Peak memory consumption was 3.9 MB. Max. memory is 11.5 GB. [2020-07-29 00:54:39,764 INFO L168 Benchmark]: CDTParser took 0.29 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:54:39,765 INFO L168 Benchmark]: CACSL2BoogieTranslator took 606.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 952.2 MB in the beginning and 1.1 GB in the end (delta: -161.8 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2020-07-29 00:54:39,766 INFO L168 Benchmark]: Boogie Preprocessor took 58.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2020-07-29 00:54:39,766 INFO L168 Benchmark]: RCFGBuilder took 572.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.7 MB). Peak memory consumption was 45.7 MB. Max. memory is 11.5 GB. [2020-07-29 00:54:39,767 INFO L168 Benchmark]: TraceAbstraction took 2643.06 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 74.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -104.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 00:54:39,767 INFO L168 Benchmark]: Witness Printer took 76.74 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 00:54:39,770 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.29 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 606.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 952.2 MB in the beginning and 1.1 GB in the end (delta: -161.8 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 572.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.7 MB). Peak memory consumption was 45.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2643.06 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 74.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -104.9 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 76.74 ms. Allocated memory is still 1.2 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: 523]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 523]: 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: 512]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 524]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 522]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 522]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 524]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 524]: free always succeeds For all program executions holds that free always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 41 locations, 10 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 2.5s, OverallIterations: 6, TraceHistogramMax: 1, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 47 SDtfs, 61 SDslu, 72 SDs, 0 SdLazy, 170 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 60 NumberOfCodeBlocks, 60 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 54 ConstructedInterpolants, 0 QuantifiedInterpolants, 3568 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...