./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength2_-write.c --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/ldv-memsafety/ArraysOfVariableLength2_-write.c -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 a6853fb9e064ccfef5e54a8bac94eb86beeed80f ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:00:15,750 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:00:15,753 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:00:15,771 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:00:15,772 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:00:15,774 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:00:15,776 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:00:15,788 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:00:15,793 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:00:15,797 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:00:15,798 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:00:15,799 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:00:15,800 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:00:15,803 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:00:15,804 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:00:15,805 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:00:15,807 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:00:15,809 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:00:15,811 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:00:15,815 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:00:15,821 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:00:15,824 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:00:15,826 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:00:15,827 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:00:15,830 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:00:15,830 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:00:15,830 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:00:15,832 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:00:15,833 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:00:15,833 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:00:15,834 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:00:15,835 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:00:15,836 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:00:15,836 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:00:15,838 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:00:15,838 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:00:15,839 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:00:15,840 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:00:15,840 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:00:15,841 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:00:15,842 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:00:15,843 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2020-07-29 01:00:15,880 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:00:15,880 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:00:15,884 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:00:15,885 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:00:15,885 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:00:15,885 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:00:15,885 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 01:00:15,886 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:00:15,886 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:00:15,886 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 01:00:15,888 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:00:15,888 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-07-29 01:00:15,889 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-07-29 01:00:15,889 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-07-29 01:00:15,889 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-29 01:00:15,889 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-07-29 01:00:15,890 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 01:00:15,890 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:00:15,890 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:00:15,892 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:00:15,892 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-29 01:00:15,892 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-29 01:00:15,892 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 01:00:15,892 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:00:15,893 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-29 01:00:15,893 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:00:15,893 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-29 01:00:15,893 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:00:15,894 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 -> a6853fb9e064ccfef5e54a8bac94eb86beeed80f [2020-07-29 01:00:16,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:00:16,242 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:00:16,246 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:00:16,247 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:00:16,248 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:00:16,248 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength2_-write.c [2020-07-29 01:00:16,329 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90fe8525b/d024489b89604e35a57acd97ab4d2cbb/FLAG9bd41d26c [2020-07-29 01:00:16,810 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:00:16,811 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength2_-write.c [2020-07-29 01:00:16,817 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90fe8525b/d024489b89604e35a57acd97ab4d2cbb/FLAG9bd41d26c [2020-07-29 01:00:17,181 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90fe8525b/d024489b89604e35a57acd97ab4d2cbb [2020-07-29 01:00:17,185 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:00:17,189 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-07-29 01:00:17,190 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:00:17,190 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:00:17,194 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:00:17,196 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:00:17" (1/1) ... [2020-07-29 01:00:17,199 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2686916e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:00:17, skipping insertion in model container [2020-07-29 01:00:17,200 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:00:17" (1/1) ... [2020-07-29 01:00:17,208 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:00:17,226 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:00:17,410 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:00:17,422 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:00:17,448 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:00:17,564 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:00:17,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:00:17 WrapperNode [2020-07-29 01:00:17,565 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:00:17,566 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:00:17,566 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:00:17,566 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:00:17,581 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:00:17" (1/1) ... [2020-07-29 01:00:17,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:00:17" (1/1) ... [2020-07-29 01:00:17,591 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:00:17" (1/1) ... [2020-07-29 01:00:17,592 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:00:17" (1/1) ... [2020-07-29 01:00:17,604 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:00:17" (1/1) ... [2020-07-29 01:00:17,611 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:00:17" (1/1) ... [2020-07-29 01:00:17,613 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:00:17" (1/1) ... [2020-07-29 01:00:17,615 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:00:17,616 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:00:17,616 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:00:17,616 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:00:17,617 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:00:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 01:00:17,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-29 01:00:17,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:00:17,683 INFO L138 BoogieDeclarations]: Found implementation of procedure bar [2020-07-29 01:00:17,684 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2020-07-29 01:00:17,684 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-29 01:00:17,684 INFO L130 BoogieDeclarations]: Found specification of procedure bar [2020-07-29 01:00:17,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:00:17,685 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2020-07-29 01:00:17,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:00:17,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:00:17,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:00:17,686 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-29 01:00:17,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-29 01:00:17,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:00:18,230 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:00:18,230 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-29 01:00:18,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:00:18 BoogieIcfgContainer [2020-07-29 01:00:18,235 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:00:18,236 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-29 01:00:18,237 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-29 01:00:18,240 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-29 01:00:18,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.07 01:00:17" (1/3) ... [2020-07-29 01:00:18,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dce8f3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:00:18, skipping insertion in model container [2020-07-29 01:00:18,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:00:17" (2/3) ... [2020-07-29 01:00:18,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dce8f3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:00:18, skipping insertion in model container [2020-07-29 01:00:18,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:00:18" (3/3) ... [2020-07-29 01:00:18,244 INFO L109 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength2_-write.c [2020-07-29 01:00:18,257 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-29 01:00:18,266 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2020-07-29 01:00:18,281 INFO L251 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2020-07-29 01:00:18,304 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-29 01:00:18,305 INFO L376 AbstractCegarLoop]: Hoare is false [2020-07-29 01:00:18,305 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-29 01:00:18,305 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:00:18,305 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:00:18,306 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-29 01:00:18,306 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:00:18,306 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-29 01:00:18,323 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states. [2020-07-29 01:00:18,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-29 01:00:18,335 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:00:18,336 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:00:18,337 INFO L427 AbstractCegarLoop]: === Iteration 1 === [barErr1REQUIRES_VIOLATION, barErr0REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:00:18,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:00:18,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1403638412, now seen corresponding path program 1 times [2020-07-29 01:00:18,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:00:18,356 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173316983] [2020-07-29 01:00:18,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:00:18,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:18,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:00:18,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:18,573 INFO L280 TraceCheckUtils]: 0: Hoare triple {60#(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; {55#true} is VALID [2020-07-29 01:00:18,573 INFO L280 TraceCheckUtils]: 1: Hoare triple {55#true} assume true; {55#true} is VALID [2020-07-29 01:00:18,574 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {55#true} {55#true} #101#return; {55#true} is VALID [2020-07-29 01:00:18,578 INFO L263 TraceCheckUtils]: 0: Hoare triple {55#true} call ULTIMATE.init(); {60#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:00:18,578 INFO L280 TraceCheckUtils]: 1: Hoare triple {60#(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; {55#true} is VALID [2020-07-29 01:00:18,579 INFO L280 TraceCheckUtils]: 2: Hoare triple {55#true} assume true; {55#true} is VALID [2020-07-29 01:00:18,579 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {55#true} {55#true} #101#return; {55#true} is VALID [2020-07-29 01:00:18,579 INFO L263 TraceCheckUtils]: 4: Hoare triple {55#true} call #t~ret8 := main(); {55#true} is VALID [2020-07-29 01:00:18,580 INFO L280 TraceCheckUtils]: 5: Hoare triple {55#true} havoc ~i~2;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);~i~2 := 0; {55#true} is VALID [2020-07-29 01:00:18,581 INFO L280 TraceCheckUtils]: 6: Hoare triple {55#true} assume !true; {56#false} is VALID [2020-07-29 01:00:18,582 INFO L280 TraceCheckUtils]: 7: Hoare triple {56#false} ~i~2 := 0; {56#false} is VALID [2020-07-29 01:00:18,582 INFO L280 TraceCheckUtils]: 8: Hoare triple {56#false} assume !!(~i~2 < 100); {56#false} is VALID [2020-07-29 01:00:18,582 INFO L280 TraceCheckUtils]: 9: Hoare triple {56#false} assume !(1 == #valid[~#b~0.base]); {56#false} is VALID [2020-07-29 01:00:18,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:00:18,585 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173316983] [2020-07-29 01:00:18,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:00:18,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:00:18,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883458057] [2020-07-29 01:00:18,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-29 01:00:18,597 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:00:18,601 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:00:18,626 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 01:00:18,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-29 01:00:18,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:00:18,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:00:18,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:00:18,639 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 3 states. [2020-07-29 01:00:18,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:18,873 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2020-07-29 01:00:18,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:00:18,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-29 01:00:18,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:00:18,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:00:18,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2020-07-29 01:00:18,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:00:18,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2020-07-29 01:00:18,895 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2020-07-29 01:00:18,994 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:19,010 INFO L225 Difference]: With dead ends: 52 [2020-07-29 01:00:19,010 INFO L226 Difference]: Without dead ends: 49 [2020-07-29 01:00:19,013 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:00:19,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-29 01:00:19,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2020-07-29 01:00:19,065 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:00:19,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 49 states. [2020-07-29 01:00:19,068 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2020-07-29 01:00:19,068 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2020-07-29 01:00:19,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:19,086 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2020-07-29 01:00:19,086 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2020-07-29 01:00:19,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:19,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:19,089 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2020-07-29 01:00:19,089 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2020-07-29 01:00:19,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:19,100 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2020-07-29 01:00:19,100 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2020-07-29 01:00:19,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:19,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:19,102 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:00:19,103 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:00:19,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-29 01:00:19,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2020-07-29 01:00:19,109 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 10 [2020-07-29 01:00:19,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:00:19,110 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2020-07-29 01:00:19,110 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-29 01:00:19,110 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2020-07-29 01:00:19,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-29 01:00:19,111 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:00:19,111 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:00:19,112 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-29 01:00:19,112 INFO L427 AbstractCegarLoop]: === Iteration 2 === [barErr1REQUIRES_VIOLATION, barErr0REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:00:19,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:00:19,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1403995904, now seen corresponding path program 1 times [2020-07-29 01:00:19,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:00:19,114 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381717835] [2020-07-29 01:00:19,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:00:19,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:19,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:00:19,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:19,197 INFO L280 TraceCheckUtils]: 0: Hoare triple {268#(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; {262#true} is VALID [2020-07-29 01:00:19,197 INFO L280 TraceCheckUtils]: 1: Hoare triple {262#true} assume true; {262#true} is VALID [2020-07-29 01:00:19,198 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {262#true} {262#true} #101#return; {262#true} is VALID [2020-07-29 01:00:19,199 INFO L263 TraceCheckUtils]: 0: Hoare triple {262#true} call ULTIMATE.init(); {268#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:00:19,199 INFO L280 TraceCheckUtils]: 1: Hoare triple {268#(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; {262#true} is VALID [2020-07-29 01:00:19,200 INFO L280 TraceCheckUtils]: 2: Hoare triple {262#true} assume true; {262#true} is VALID [2020-07-29 01:00:19,200 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {262#true} {262#true} #101#return; {262#true} is VALID [2020-07-29 01:00:19,201 INFO L263 TraceCheckUtils]: 4: Hoare triple {262#true} call #t~ret8 := main(); {262#true} is VALID [2020-07-29 01:00:19,202 INFO L280 TraceCheckUtils]: 5: Hoare triple {262#true} havoc ~i~2;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);~i~2 := 0; {267#(= 0 main_~i~2)} is VALID [2020-07-29 01:00:19,203 INFO L280 TraceCheckUtils]: 6: Hoare triple {267#(= 0 main_~i~2)} assume !(~i~2 < 100); {263#false} is VALID [2020-07-29 01:00:19,203 INFO L280 TraceCheckUtils]: 7: Hoare triple {263#false} ~i~2 := 0; {263#false} is VALID [2020-07-29 01:00:19,203 INFO L280 TraceCheckUtils]: 8: Hoare triple {263#false} assume !!(~i~2 < 100); {263#false} is VALID [2020-07-29 01:00:19,204 INFO L280 TraceCheckUtils]: 9: Hoare triple {263#false} assume !(1 == #valid[~#b~0.base]); {263#false} is VALID [2020-07-29 01:00:19,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:00:19,205 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381717835] [2020-07-29 01:00:19,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:00:19,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:00:19,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357846952] [2020-07-29 01:00:19,207 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-07-29 01:00:19,208 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:00:19,208 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:00:19,229 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 01:00:19,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:00:19,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:00:19,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:00:19,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:00:19,231 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 4 states. [2020-07-29 01:00:19,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:19,527 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2020-07-29 01:00:19,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:00:19,528 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-07-29 01:00:19,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:00:19,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:00:19,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2020-07-29 01:00:19,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:00:19,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2020-07-29 01:00:19,537 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 63 transitions. [2020-07-29 01:00:19,635 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:19,639 INFO L225 Difference]: With dead ends: 56 [2020-07-29 01:00:19,639 INFO L226 Difference]: Without dead ends: 56 [2020-07-29 01:00:19,640 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:00:19,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-07-29 01:00:19,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 49. [2020-07-29 01:00:19,647 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:00:19,647 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 49 states. [2020-07-29 01:00:19,647 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 49 states. [2020-07-29 01:00:19,648 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 49 states. [2020-07-29 01:00:19,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:19,654 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2020-07-29 01:00:19,654 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2020-07-29 01:00:19,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:19,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:19,656 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 56 states. [2020-07-29 01:00:19,656 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 56 states. [2020-07-29 01:00:19,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:19,661 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2020-07-29 01:00:19,662 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2020-07-29 01:00:19,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:19,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:19,664 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:00:19,664 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:00:19,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-29 01:00:19,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2020-07-29 01:00:19,668 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 10 [2020-07-29 01:00:19,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:00:19,668 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2020-07-29 01:00:19,669 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:00:19,669 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2020-07-29 01:00:19,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-29 01:00:19,670 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:00:19,670 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:00:19,670 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-29 01:00:19,671 INFO L427 AbstractCegarLoop]: === Iteration 3 === [barErr1REQUIRES_VIOLATION, barErr0REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:00:19,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:00:19,671 INFO L82 PathProgramCache]: Analyzing trace with hash -571487811, now seen corresponding path program 1 times [2020-07-29 01:00:19,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:00:19,672 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232514061] [2020-07-29 01:00:19,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:00:19,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:19,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:00:19,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:19,830 INFO L280 TraceCheckUtils]: 0: Hoare triple {496#(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; {488#true} is VALID [2020-07-29 01:00:19,831 INFO L280 TraceCheckUtils]: 1: Hoare triple {488#true} assume true; {488#true} is VALID [2020-07-29 01:00:19,831 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {488#true} {488#true} #101#return; {488#true} is VALID [2020-07-29 01:00:19,833 INFO L263 TraceCheckUtils]: 0: Hoare triple {488#true} call ULTIMATE.init(); {496#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:00:19,833 INFO L280 TraceCheckUtils]: 1: Hoare triple {496#(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; {488#true} is VALID [2020-07-29 01:00:19,834 INFO L280 TraceCheckUtils]: 2: Hoare triple {488#true} assume true; {488#true} is VALID [2020-07-29 01:00:19,834 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {488#true} {488#true} #101#return; {488#true} is VALID [2020-07-29 01:00:19,835 INFO L263 TraceCheckUtils]: 4: Hoare triple {488#true} call #t~ret8 := main(); {488#true} is VALID [2020-07-29 01:00:19,836 INFO L280 TraceCheckUtils]: 5: Hoare triple {488#true} havoc ~i~2;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);~i~2 := 0; {493#(= (select |#valid| |main_~#b~0.base|) 1)} is VALID [2020-07-29 01:00:19,837 INFO L280 TraceCheckUtils]: 6: Hoare triple {493#(= (select |#valid| |main_~#b~0.base|) 1)} assume !!(~i~2 < 100); {493#(= (select |#valid| |main_~#b~0.base|) 1)} is VALID [2020-07-29 01:00:19,839 INFO L263 TraceCheckUtils]: 7: Hoare triple {493#(= (select |#valid| |main_~#b~0.base|) 1)} call #t~ret6 := foo(~i~2, ~#b~0.base, ~#b~0.offset, 1 + ~i~2); {494#(= 1 (select |#valid| |foo_#in~b.base|))} is VALID [2020-07-29 01:00:19,841 INFO L280 TraceCheckUtils]: 8: Hoare triple {494#(= 1 (select |#valid| |foo_#in~b.base|))} ~n := #in~n;~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4 * ~n);havoc ~i~1;~i~1 := 0; {495#(= 1 (select |#valid| foo_~b.base))} is VALID [2020-07-29 01:00:19,842 INFO L280 TraceCheckUtils]: 9: Hoare triple {495#(= 1 (select |#valid| foo_~b.base))} assume !!(~i~1 < ~size); {495#(= 1 (select |#valid| foo_~b.base))} is VALID [2020-07-29 01:00:19,843 INFO L280 TraceCheckUtils]: 10: Hoare triple {495#(= 1 (select |#valid| foo_~b.base))} assume !(1 == #valid[~b.base]); {489#false} is VALID [2020-07-29 01:00:19,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:00:19,845 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232514061] [2020-07-29 01:00:19,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:00:19,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 01:00:19,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032141914] [2020-07-29 01:00:19,847 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-07-29 01:00:19,847 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:00:19,847 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:00:19,864 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 01:00:19,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-29 01:00:19,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:00:19,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:00:19,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:00:19,866 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 6 states. [2020-07-29 01:00:20,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:20,367 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2020-07-29 01:00:20,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:00:20,367 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-07-29 01:00:20,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:00:20,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:00:20,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2020-07-29 01:00:20,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:00:20,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2020-07-29 01:00:20,380 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 52 transitions. [2020-07-29 01:00:20,455 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:20,458 INFO L225 Difference]: With dead ends: 47 [2020-07-29 01:00:20,458 INFO L226 Difference]: Without dead ends: 47 [2020-07-29 01:00:20,458 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-29 01:00:20,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-29 01:00:20,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-07-29 01:00:20,466 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:00:20,466 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 47 states. [2020-07-29 01:00:20,466 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2020-07-29 01:00:20,467 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2020-07-29 01:00:20,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:20,472 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2020-07-29 01:00:20,472 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2020-07-29 01:00:20,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:20,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:20,475 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2020-07-29 01:00:20,476 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2020-07-29 01:00:20,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:20,479 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2020-07-29 01:00:20,479 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2020-07-29 01:00:20,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:20,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:20,484 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:00:20,484 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:00:20,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-29 01:00:20,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2020-07-29 01:00:20,494 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 11 [2020-07-29 01:00:20,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:00:20,494 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2020-07-29 01:00:20,495 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-29 01:00:20,495 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2020-07-29 01:00:20,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-29 01:00:20,495 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:00:20,495 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:00:20,496 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-29 01:00:20,496 INFO L427 AbstractCegarLoop]: === Iteration 4 === [barErr1REQUIRES_VIOLATION, barErr0REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:00:20,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:00:20,496 INFO L82 PathProgramCache]: Analyzing trace with hash -571487810, now seen corresponding path program 1 times [2020-07-29 01:00:20,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:00:20,497 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78280536] [2020-07-29 01:00:20,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:00:20,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:20,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:00:20,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:20,660 INFO L280 TraceCheckUtils]: 0: Hoare triple {699#(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; {691#true} is VALID [2020-07-29 01:00:20,661 INFO L280 TraceCheckUtils]: 1: Hoare triple {691#true} assume true; {691#true} is VALID [2020-07-29 01:00:20,661 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {691#true} {691#true} #101#return; {691#true} is VALID [2020-07-29 01:00:20,662 INFO L263 TraceCheckUtils]: 0: Hoare triple {691#true} call ULTIMATE.init(); {699#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:00:20,663 INFO L280 TraceCheckUtils]: 1: Hoare triple {699#(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; {691#true} is VALID [2020-07-29 01:00:20,663 INFO L280 TraceCheckUtils]: 2: Hoare triple {691#true} assume true; {691#true} is VALID [2020-07-29 01:00:20,663 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {691#true} {691#true} #101#return; {691#true} is VALID [2020-07-29 01:00:20,664 INFO L263 TraceCheckUtils]: 4: Hoare triple {691#true} call #t~ret8 := main(); {691#true} is VALID [2020-07-29 01:00:20,669 INFO L280 TraceCheckUtils]: 5: Hoare triple {691#true} havoc ~i~2;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);~i~2 := 0; {696#(and (= 400 (select |#length| |main_~#b~0.base|)) (= (select |#valid| |main_~#b~0.base|) 1) (= 0 |main_~#b~0.offset|))} is VALID [2020-07-29 01:00:20,670 INFO L280 TraceCheckUtils]: 6: Hoare triple {696#(and (= 400 (select |#length| |main_~#b~0.base|)) (= (select |#valid| |main_~#b~0.base|) 1) (= 0 |main_~#b~0.offset|))} assume !!(~i~2 < 100); {696#(and (= 400 (select |#length| |main_~#b~0.base|)) (= (select |#valid| |main_~#b~0.base|) 1) (= 0 |main_~#b~0.offset|))} is VALID [2020-07-29 01:00:20,675 INFO L263 TraceCheckUtils]: 7: Hoare triple {696#(and (= 400 (select |#length| |main_~#b~0.base|)) (= (select |#valid| |main_~#b~0.base|) 1) (= 0 |main_~#b~0.offset|))} call #t~ret6 := foo(~i~2, ~#b~0.base, ~#b~0.offset, 1 + ~i~2); {697#(and (= 1 (select |#valid| |foo_#in~b.base|)) (= 0 |foo_#in~b.offset|) (= 400 (select |#length| |foo_#in~b.base|)))} is VALID [2020-07-29 01:00:20,676 INFO L280 TraceCheckUtils]: 8: Hoare triple {697#(and (= 1 (select |#valid| |foo_#in~b.base|)) (= 0 |foo_#in~b.offset|) (= 400 (select |#length| |foo_#in~b.base|)))} ~n := #in~n;~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4 * ~n);havoc ~i~1;~i~1 := 0; {698#(and (= foo_~b.offset 0) (= 0 foo_~i~1) (= 400 (select |#length| foo_~b.base)))} is VALID [2020-07-29 01:00:20,680 INFO L280 TraceCheckUtils]: 9: Hoare triple {698#(and (= foo_~b.offset 0) (= 0 foo_~i~1) (= 400 (select |#length| foo_~b.base)))} assume !!(~i~1 < ~size); {698#(and (= foo_~b.offset 0) (= 0 foo_~i~1) (= 400 (select |#length| foo_~b.base)))} is VALID [2020-07-29 01:00:20,682 INFO L280 TraceCheckUtils]: 10: Hoare triple {698#(and (= foo_~b.offset 0) (= 0 foo_~i~1) (= 400 (select |#length| foo_~b.base)))} assume !(4 + (~b.offset + 4 * ~i~1) <= #length[~b.base] && 0 <= ~b.offset + 4 * ~i~1); {692#false} is VALID [2020-07-29 01:00:20,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:00:20,684 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78280536] [2020-07-29 01:00:20,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:00:20,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 01:00:20,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64218502] [2020-07-29 01:00:20,685 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-07-29 01:00:20,686 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:00:20,686 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:00:20,702 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 01:00:20,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-29 01:00:20,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:00:20,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:00:20,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:00:20,704 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 6 states. [2020-07-29 01:00:21,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:21,360 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2020-07-29 01:00:21,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:00:21,360 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-07-29 01:00:21,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:00:21,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:00:21,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2020-07-29 01:00:21,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:00:21,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2020-07-29 01:00:21,367 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 84 transitions. [2020-07-29 01:00:21,479 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:21,482 INFO L225 Difference]: With dead ends: 72 [2020-07-29 01:00:21,483 INFO L226 Difference]: Without dead ends: 72 [2020-07-29 01:00:21,483 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-29 01:00:21,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-07-29 01:00:21,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 56. [2020-07-29 01:00:21,489 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:00:21,489 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 56 states. [2020-07-29 01:00:21,489 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 56 states. [2020-07-29 01:00:21,490 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 56 states. [2020-07-29 01:00:21,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:21,494 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2020-07-29 01:00:21,494 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2020-07-29 01:00:21,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:21,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:21,495 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 72 states. [2020-07-29 01:00:21,495 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 72 states. [2020-07-29 01:00:21,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:21,500 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2020-07-29 01:00:21,500 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2020-07-29 01:00:21,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:21,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:21,501 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:00:21,501 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:00:21,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-29 01:00:21,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2020-07-29 01:00:21,505 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 11 [2020-07-29 01:00:21,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:00:21,505 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2020-07-29 01:00:21,506 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-29 01:00:21,506 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2020-07-29 01:00:21,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-29 01:00:21,506 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:00:21,506 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:00:21,507 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-29 01:00:21,507 INFO L427 AbstractCegarLoop]: === Iteration 5 === [barErr1REQUIRES_VIOLATION, barErr0REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:00:21,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:00:21,507 INFO L82 PathProgramCache]: Analyzing trace with hash -536252953, now seen corresponding path program 1 times [2020-07-29 01:00:21,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:00:21,508 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198546039] [2020-07-29 01:00:21,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:00:21,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:21,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:00:21,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:21,603 INFO L280 TraceCheckUtils]: 0: Hoare triple {984#(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; {978#true} is VALID [2020-07-29 01:00:21,604 INFO L280 TraceCheckUtils]: 1: Hoare triple {978#true} assume true; {978#true} is VALID [2020-07-29 01:00:21,604 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {978#true} {978#true} #101#return; {978#true} is VALID [2020-07-29 01:00:21,605 INFO L263 TraceCheckUtils]: 0: Hoare triple {978#true} call ULTIMATE.init(); {984#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:00:21,606 INFO L280 TraceCheckUtils]: 1: Hoare triple {984#(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; {978#true} is VALID [2020-07-29 01:00:21,606 INFO L280 TraceCheckUtils]: 2: Hoare triple {978#true} assume true; {978#true} is VALID [2020-07-29 01:00:21,606 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {978#true} {978#true} #101#return; {978#true} is VALID [2020-07-29 01:00:21,607 INFO L263 TraceCheckUtils]: 4: Hoare triple {978#true} call #t~ret8 := main(); {978#true} is VALID [2020-07-29 01:00:21,607 INFO L280 TraceCheckUtils]: 5: Hoare triple {978#true} havoc ~i~2;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);~i~2 := 0; {978#true} is VALID [2020-07-29 01:00:21,607 INFO L280 TraceCheckUtils]: 6: Hoare triple {978#true} assume !!(~i~2 < 100); {978#true} is VALID [2020-07-29 01:00:21,608 INFO L263 TraceCheckUtils]: 7: Hoare triple {978#true} call #t~ret6 := foo(~i~2, ~#b~0.base, ~#b~0.offset, 1 + ~i~2); {978#true} is VALID [2020-07-29 01:00:21,609 INFO L280 TraceCheckUtils]: 8: Hoare triple {978#true} ~n := #in~n;~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4 * ~n);havoc ~i~1;~i~1 := 0; {983#(= 1 (select |#valid| |foo_~#a~0.base|))} is VALID [2020-07-29 01:00:21,610 INFO L280 TraceCheckUtils]: 9: Hoare triple {983#(= 1 (select |#valid| |foo_~#a~0.base|))} assume !!(~i~1 < ~size); {983#(= 1 (select |#valid| |foo_~#a~0.base|))} is VALID [2020-07-29 01:00:21,611 INFO L280 TraceCheckUtils]: 10: Hoare triple {983#(= 1 (select |#valid| |foo_~#a~0.base|))} SUMMARY for call #t~mem3 := read~int(~b.base, ~b.offset + 4 * ~i~1, 4); srcloc: L23 {983#(= 1 (select |#valid| |foo_~#a~0.base|))} is VALID [2020-07-29 01:00:21,612 INFO L280 TraceCheckUtils]: 11: Hoare triple {983#(= 1 (select |#valid| |foo_~#a~0.base|))} assume !(1 == #valid[~#a~0.base]); {979#false} is VALID [2020-07-29 01:00:21,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:00:21,614 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198546039] [2020-07-29 01:00:21,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:00:21,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:00:21,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757876565] [2020-07-29 01:00:21,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-07-29 01:00:21,615 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:00:21,615 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:00:21,633 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 01:00:21,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:00:21,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:00:21,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:00:21,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:00:21,634 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand 4 states. [2020-07-29 01:00:21,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:21,854 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2020-07-29 01:00:21,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:00:21,854 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-07-29 01:00:21,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:00:21,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:00:21,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2020-07-29 01:00:21,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:00:21,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2020-07-29 01:00:21,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 50 transitions. [2020-07-29 01:00:21,933 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:21,937 INFO L225 Difference]: With dead ends: 55 [2020-07-29 01:00:21,937 INFO L226 Difference]: Without dead ends: 55 [2020-07-29 01:00:21,938 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:00:21,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-29 01:00:21,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2020-07-29 01:00:21,942 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:00:21,942 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 55 states. [2020-07-29 01:00:21,942 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2020-07-29 01:00:21,943 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2020-07-29 01:00:21,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:21,946 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2020-07-29 01:00:21,946 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2020-07-29 01:00:21,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:21,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:21,947 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2020-07-29 01:00:21,947 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2020-07-29 01:00:21,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:21,950 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2020-07-29 01:00:21,951 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2020-07-29 01:00:21,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:21,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:21,951 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:00:21,952 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:00:21,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-29 01:00:21,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2020-07-29 01:00:21,955 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 12 [2020-07-29 01:00:21,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:00:21,955 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2020-07-29 01:00:21,955 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:00:21,955 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2020-07-29 01:00:21,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-29 01:00:21,956 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:00:21,956 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:00:21,956 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-29 01:00:21,957 INFO L427 AbstractCegarLoop]: === Iteration 6 === [barErr1REQUIRES_VIOLATION, barErr0REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:00:21,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:00:21,957 INFO L82 PathProgramCache]: Analyzing trace with hash -536252952, now seen corresponding path program 1 times [2020-07-29 01:00:21,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:00:21,958 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714508956] [2020-07-29 01:00:21,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:00:21,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:00:21,975 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:00:21,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:00:21,990 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:00:22,022 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:00:22,022 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-29 01:00:22,023 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-29 01:00:22,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.07 01:00:22 BoogieIcfgContainer [2020-07-29 01:00:22,050 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-29 01:00:22,050 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:00:22,050 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:00:22,051 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:00:22,051 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:00:18" (3/4) ... [2020-07-29 01:00:22,054 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-07-29 01:00:22,104 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-29 01:00:22,105 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:00:22,108 INFO L168 Benchmark]: Toolchain (without parser) took 4920.41 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 222.3 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -97.0 MB). Peak memory consumption was 125.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:00:22,109 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:00:22,110 INFO L168 Benchmark]: CACSL2BoogieTranslator took 375.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.1 MB). Free memory was 960.2 MB in the beginning and 1.2 GB in the end (delta: -200.1 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2020-07-29 01:00:22,110 INFO L168 Benchmark]: Boogie Preprocessor took 49.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:00:22,111 INFO L168 Benchmark]: RCFGBuilder took 619.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 45.6 MB). Peak memory consumption was 45.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:00:22,112 INFO L168 Benchmark]: TraceAbstraction took 3813.48 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 58.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.7 MB). Peak memory consumption was 108.9 MB. Max. memory is 11.5 GB. [2020-07-29 01:00:22,113 INFO L168 Benchmark]: Witness Printer took 54.22 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:00:22,116 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.26 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 375.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.1 MB). Free memory was 960.2 MB in the beginning and 1.2 GB in the end (delta: -200.1 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 49.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 619.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 45.6 MB). Peak memory consumption was 45.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3813.48 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 58.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.7 MB). Peak memory consumption was 108.9 MB. Max. memory is 11.5 GB. * Witness Printer took 54.22 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 23]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L32] int i, b[100]; [L33] i = 0 VAL [b={3:0}, i=0] [L33] COND TRUE i < 100 VAL [b={3:0}, i=0] [L34] CALL foo(i, b, i + 1) VAL [\old(n)=0, \old(size)=1, b={3:0}] [L21] int a[n], i; [L22] i = 0 VAL [\old(n)=0, \old(size)=1, a={2:0}, b={3:0}, b={3:0}, i=0, n=0, size=1] [L22] COND TRUE i < size VAL [\old(n)=0, \old(size)=1, a={2:0}, b={3:0}, b={3:0}, i=0, n=0, size=1] [L23] EXPR b[i] VAL [\old(n)=0, \old(size)=1, a={2:0}, b={3:0}, b={3:0}, b[i]=402, i=0, n=0, size=1] [L23] a[i] = b[i] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 52 locations, 11 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 3.7s, OverallIterations: 6, TraceHistogramMax: 1, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 200 SDtfs, 125 SDslu, 165 SDs, 0 SdLazy, 439 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 23 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 66 NumberOfCodeBlocks, 66 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 49 ConstructedInterpolants, 0 QuantifiedInterpolants, 1884 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...