./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext3/derefAfterFree2.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/memsafety-ext3/derefAfterFree2.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 44834c55142a76240cb3980fc2bb6f5aeaa27c83 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:17:16,716 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:17:16,718 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:17:16,738 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:17:16,738 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:17:16,740 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:17:16,743 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:17:16,754 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:17:16,759 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:17:16,763 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:17:16,765 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:17:16,767 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:17:16,767 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:17:16,770 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:17:16,771 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:17:16,772 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:17:16,774 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:17:16,776 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:17:16,779 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:17:16,783 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:17:16,788 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:17:16,792 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:17:16,794 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:17:16,795 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:17:16,798 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:17:16,798 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:17:16,799 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:17:16,800 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:17:16,801 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:17:16,802 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:17:16,802 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:17:16,804 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:17:16,805 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:17:16,806 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:17:16,807 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:17:16,807 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:17:16,808 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:17:16,809 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:17:16,809 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:17:16,810 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:17:16,811 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:17:16,812 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:17:16,844 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:17:16,844 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:17:16,846 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:17:16,847 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:17:16,847 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:17:16,847 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:17:16,848 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 01:17:16,848 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:17:16,848 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:17:16,848 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 01:17:16,850 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:17:16,850 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-07-29 01:17:16,850 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-07-29 01:17:16,851 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-07-29 01:17:16,851 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-29 01:17:16,851 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-07-29 01:17:16,852 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 01:17:16,852 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:17:16,852 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:17:16,852 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:17:16,853 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-29 01:17:16,853 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-29 01:17:16,853 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 01:17:16,854 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:17:16,854 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-29 01:17:16,854 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:17:16,854 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-29 01:17:16,855 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:17:16,855 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 -> 44834c55142a76240cb3980fc2bb6f5aeaa27c83 [2020-07-29 01:17:17,165 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:17:17,184 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:17:17,187 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:17:17,188 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:17:17,189 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:17:17,190 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext3/derefAfterFree2.c [2020-07-29 01:17:17,255 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/220d2adcb/08d53cdffaf0451398c8cf66fa2482c4/FLAGd5efbc9f1 [2020-07-29 01:17:17,703 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:17:17,704 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/derefAfterFree2.c [2020-07-29 01:17:17,711 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/220d2adcb/08d53cdffaf0451398c8cf66fa2482c4/FLAGd5efbc9f1 [2020-07-29 01:17:18,072 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/220d2adcb/08d53cdffaf0451398c8cf66fa2482c4 [2020-07-29 01:17:18,075 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:17:18,077 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-07-29 01:17:18,078 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:17:18,079 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:17:18,082 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:17:18,084 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:17:18" (1/1) ... [2020-07-29 01:17:18,088 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24c6090d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:18, skipping insertion in model container [2020-07-29 01:17:18,088 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:17:18" (1/1) ... [2020-07-29 01:17:18,096 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:17:18,110 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:17:18,258 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:17:18,270 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:17:18,287 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:17:18,302 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:17:18,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:18 WrapperNode [2020-07-29 01:17:18,302 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:17:18,303 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:17:18,303 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:17:18,303 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:17:18,314 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:18" (1/1) ... [2020-07-29 01:17:18,314 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:18" (1/1) ... [2020-07-29 01:17:18,374 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:18" (1/1) ... [2020-07-29 01:17:18,375 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:18" (1/1) ... [2020-07-29 01:17:18,383 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:18" (1/1) ... [2020-07-29 01:17:18,388 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:18" (1/1) ... [2020-07-29 01:17:18,389 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:18" (1/1) ... [2020-07-29 01:17:18,391 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:17:18,392 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:17:18,392 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:17:18,392 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:17:18,393 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:18" (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:17:18,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-29 01:17:18,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:17:18,448 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-29 01:17:18,448 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-29 01:17:18,449 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-29 01:17:18,449 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-29 01:17:18,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-29 01:17:18,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:17:18,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:17:18,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-29 01:17:18,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:17:18,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:17:18,831 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:17:18,832 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-29 01:17:18,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:17:18 BoogieIcfgContainer [2020-07-29 01:17:18,836 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:17:18,841 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-29 01:17:18,841 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-29 01:17:18,846 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-29 01:17:18,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.07 01:17:18" (1/3) ... [2020-07-29 01:17:18,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e16203 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:17:18, skipping insertion in model container [2020-07-29 01:17:18,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:17:18" (2/3) ... [2020-07-29 01:17:18,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e16203 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:17:18, skipping insertion in model container [2020-07-29 01:17:18,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:17:18" (3/3) ... [2020-07-29 01:17:18,850 INFO L109 eAbstractionObserver]: Analyzing ICFG derefAfterFree2.c [2020-07-29 01:17:18,859 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-29 01:17:18,866 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-07-29 01:17:18,879 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-07-29 01:17:18,897 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-29 01:17:18,897 INFO L376 AbstractCegarLoop]: Hoare is false [2020-07-29 01:17:18,898 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-29 01:17:18,898 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:17:18,898 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:17:18,898 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-29 01:17:18,898 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:17:18,898 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-29 01:17:18,911 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-07-29 01:17:18,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-29 01:17:18,920 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:18,921 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:17:18,921 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:17:18,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:18,928 INFO L82 PathProgramCache]: Analyzing trace with hash 868112163, now seen corresponding path program 1 times [2020-07-29 01:17:18,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:18,936 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231275662] [2020-07-29 01:17:18,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:19,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:19,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:17:19,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:19,192 INFO L280 TraceCheckUtils]: 0: Hoare triple {33#(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; {27#true} is VALID [2020-07-29 01:17:19,192 INFO L280 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2020-07-29 01:17:19,193 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #37#return; {27#true} is VALID [2020-07-29 01:17:19,196 INFO L263 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {33#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:17:19,196 INFO L280 TraceCheckUtils]: 1: Hoare triple {33#(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; {27#true} is VALID [2020-07-29 01:17:19,197 INFO L280 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2020-07-29 01:17:19,197 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #37#return; {27#true} is VALID [2020-07-29 01:17:19,197 INFO L263 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret4 := main(); {27#true} is VALID [2020-07-29 01:17:19,199 INFO L280 TraceCheckUtils]: 5: Hoare triple {27#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(40);~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {32#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} is VALID [2020-07-29 01:17:19,201 INFO L280 TraceCheckUtils]: 6: Hoare triple {32#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} assume !!(~i~0 < 10); {32#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} is VALID [2020-07-29 01:17:19,203 INFO L280 TraceCheckUtils]: 7: Hoare triple {32#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} assume !(4 + (~p~0.offset + 4 * ~i~0) <= #length[~p~0.base] && 0 <= ~p~0.offset + 4 * ~i~0); {28#false} is VALID [2020-07-29 01:17: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:17:19,206 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231275662] [2020-07-29 01:17:19,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:17:19,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:17:19,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082926920] [2020-07-29 01:17:19,214 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-07-29 01:17:19,217 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:17:19,223 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:17:19,249 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:19,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:17:19,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:17:19,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:17:19,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:17:19,263 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 4 states. [2020-07-29 01:17:19,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:19,453 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2020-07-29 01:17:19,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:17:19,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-07-29 01:17:19,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:17:19,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:17:19,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2020-07-29 01:17:19,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:17:19,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2020-07-29 01:17:19,473 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 35 transitions. [2020-07-29 01:17:19,539 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:19,550 INFO L225 Difference]: With dead ends: 29 [2020-07-29 01:17:19,551 INFO L226 Difference]: Without dead ends: 26 [2020-07-29 01:17:19,553 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:17:19,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-29 01:17:19,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2020-07-29 01:17:19,587 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:17:19,588 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 24 states. [2020-07-29 01:17:19,589 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 24 states. [2020-07-29 01:17:19,589 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 24 states. [2020-07-29 01:17:19,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:19,594 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2020-07-29 01:17:19,594 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2020-07-29 01:17:19,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:19,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:19,595 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 26 states. [2020-07-29 01:17:19,595 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 26 states. [2020-07-29 01:17:19,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:19,600 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2020-07-29 01:17:19,600 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2020-07-29 01:17:19,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:19,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:19,601 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:17:19,601 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:17:19,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-29 01:17:19,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2020-07-29 01:17:19,605 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 8 [2020-07-29 01:17:19,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:17:19,606 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2020-07-29 01:17:19,606 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:17:19,607 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2020-07-29 01:17:19,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-29 01:17:19,607 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:19,607 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:17:19,608 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-29 01:17:19,608 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:17:19,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:19,609 INFO L82 PathProgramCache]: Analyzing trace with hash 868112162, now seen corresponding path program 1 times [2020-07-29 01:17:19,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:19,610 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294213309] [2020-07-29 01:17:19,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:19,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:19,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:17:19,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:19,670 INFO L280 TraceCheckUtils]: 0: Hoare triple {147#(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; {141#true} is VALID [2020-07-29 01:17:19,671 INFO L280 TraceCheckUtils]: 1: Hoare triple {141#true} assume true; {141#true} is VALID [2020-07-29 01:17:19,671 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {141#true} {141#true} #37#return; {141#true} is VALID [2020-07-29 01:17:19,673 INFO L263 TraceCheckUtils]: 0: Hoare triple {141#true} call ULTIMATE.init(); {147#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:17:19,673 INFO L280 TraceCheckUtils]: 1: Hoare triple {147#(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; {141#true} is VALID [2020-07-29 01:17:19,674 INFO L280 TraceCheckUtils]: 2: Hoare triple {141#true} assume true; {141#true} is VALID [2020-07-29 01:17:19,674 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {141#true} {141#true} #37#return; {141#true} is VALID [2020-07-29 01:17:19,674 INFO L263 TraceCheckUtils]: 4: Hoare triple {141#true} call #t~ret4 := main(); {141#true} is VALID [2020-07-29 01:17:19,676 INFO L280 TraceCheckUtils]: 5: Hoare triple {141#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(40);~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {146#(= 1 (select |#valid| main_~p~0.base))} is VALID [2020-07-29 01:17:19,677 INFO L280 TraceCheckUtils]: 6: Hoare triple {146#(= 1 (select |#valid| main_~p~0.base))} assume !!(~i~0 < 10); {146#(= 1 (select |#valid| main_~p~0.base))} is VALID [2020-07-29 01:17:19,678 INFO L280 TraceCheckUtils]: 7: Hoare triple {146#(= 1 (select |#valid| main_~p~0.base))} assume !(1 == #valid[~p~0.base]); {142#false} is VALID [2020-07-29 01:17:19,679 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:17:19,680 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294213309] [2020-07-29 01:17:19,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:17:19,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:17:19,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441895278] [2020-07-29 01:17:19,683 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-07-29 01:17:19,683 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:17:19,684 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:17:19,697 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:19,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:17:19,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:17:19,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:17:19,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:17:19,699 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 4 states. [2020-07-29 01:17:19,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:19,813 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2020-07-29 01:17:19,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:17:19,813 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-07-29 01:17:19,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:17:19,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:17:19,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2020-07-29 01:17:19,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:17:19,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2020-07-29 01:17:19,819 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 30 transitions. [2020-07-29 01:17:19,864 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:19,866 INFO L225 Difference]: With dead ends: 30 [2020-07-29 01:17:19,866 INFO L226 Difference]: Without dead ends: 30 [2020-07-29 01:17:19,867 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:17:19,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-29 01:17:19,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2020-07-29 01:17:19,872 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:17:19,872 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 26 states. [2020-07-29 01:17:19,872 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 26 states. [2020-07-29 01:17:19,873 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 26 states. [2020-07-29 01:17:19,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:19,876 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2020-07-29 01:17:19,876 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-07-29 01:17:19,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:19,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:19,878 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 30 states. [2020-07-29 01:17:19,878 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 30 states. [2020-07-29 01:17:19,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:19,881 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2020-07-29 01:17:19,882 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-07-29 01:17:19,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:19,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:19,883 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:17:19,883 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:17:19,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-29 01:17:19,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2020-07-29 01:17:19,886 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 8 [2020-07-29 01:17:19,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:17:19,887 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2020-07-29 01:17:19,887 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:17:19,887 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2020-07-29 01:17:19,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-29 01:17:19,888 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:19,888 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:17:19,889 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-29 01:17:19,889 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:17:19,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:19,890 INFO L82 PathProgramCache]: Analyzing trace with hash -258436314, now seen corresponding path program 1 times [2020-07-29 01:17:19,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:19,891 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320891426] [2020-07-29 01:17:19,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:19,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:20,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:17:20,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:20,034 INFO L280 TraceCheckUtils]: 0: Hoare triple {273#(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; {266#true} is VALID [2020-07-29 01:17:20,034 INFO L280 TraceCheckUtils]: 1: Hoare triple {266#true} assume true; {266#true} is VALID [2020-07-29 01:17:20,035 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {266#true} {266#true} #37#return; {266#true} is VALID [2020-07-29 01:17:20,036 INFO L263 TraceCheckUtils]: 0: Hoare triple {266#true} call ULTIMATE.init(); {273#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:17:20,037 INFO L280 TraceCheckUtils]: 1: Hoare triple {273#(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; {266#true} is VALID [2020-07-29 01:17:20,037 INFO L280 TraceCheckUtils]: 2: Hoare triple {266#true} assume true; {266#true} is VALID [2020-07-29 01:17:20,038 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {266#true} {266#true} #37#return; {266#true} is VALID [2020-07-29 01:17:20,038 INFO L263 TraceCheckUtils]: 4: Hoare triple {266#true} call #t~ret4 := main(); {266#true} is VALID [2020-07-29 01:17:20,040 INFO L280 TraceCheckUtils]: 5: Hoare triple {266#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(40);~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {271#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} is VALID [2020-07-29 01:17:20,042 INFO L280 TraceCheckUtils]: 6: Hoare triple {271#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} assume !!(~i~0 < 10); {271#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} is VALID [2020-07-29 01:17:20,046 INFO L280 TraceCheckUtils]: 7: Hoare triple {271#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); srcloc: L9 {271#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} is VALID [2020-07-29 01:17:20,047 INFO L280 TraceCheckUtils]: 8: Hoare triple {271#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} assume !(5 == ~i~0); {271#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} is VALID [2020-07-29 01:17:20,048 INFO L280 TraceCheckUtils]: 9: Hoare triple {271#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {272#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2020-07-29 01:17:20,050 INFO L280 TraceCheckUtils]: 10: Hoare triple {272#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < 10); {272#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2020-07-29 01:17:20,051 INFO L280 TraceCheckUtils]: 11: Hoare triple {272#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (<= main_~i~0 1) (<= 1 main_~i~0))} assume !(4 + (~p~0.offset + 4 * ~i~0) <= #length[~p~0.base] && 0 <= ~p~0.offset + 4 * ~i~0); {267#false} is VALID [2020-07-29 01:17:20,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:20,053 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320891426] [2020-07-29 01:17:20,054 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022041074] [2020-07-29 01:17:20,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:17:20,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:20,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-29 01:17:20,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:20,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:17:20,193 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-29 01:17:20,194 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:17:20,208 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:17:20,209 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:17:20,209 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-07-29 01:17:20,213 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:17:20,213 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_7|]. (and (= 0 main_~p~0.offset) (= (store |v_#length_7| main_~p~0.base 40) |#length|) (= 0 main_~i~0)) [2020-07-29 01:17:20,214 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 main_~p~0.offset) (= 0 main_~i~0) (= 40 (select |#length| main_~p~0.base))) [2020-07-29 01:17:20,292 INFO L263 TraceCheckUtils]: 0: Hoare triple {266#true} call ULTIMATE.init(); {266#true} is VALID [2020-07-29 01:17:20,293 INFO L280 TraceCheckUtils]: 1: Hoare triple {266#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {266#true} is VALID [2020-07-29 01:17:20,293 INFO L280 TraceCheckUtils]: 2: Hoare triple {266#true} assume true; {266#true} is VALID [2020-07-29 01:17:20,294 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {266#true} {266#true} #37#return; {266#true} is VALID [2020-07-29 01:17:20,294 INFO L263 TraceCheckUtils]: 4: Hoare triple {266#true} call #t~ret4 := main(); {266#true} is VALID [2020-07-29 01:17:20,296 INFO L280 TraceCheckUtils]: 5: Hoare triple {266#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(40);~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {271#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} is VALID [2020-07-29 01:17:20,297 INFO L280 TraceCheckUtils]: 6: Hoare triple {271#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} assume !!(~i~0 < 10); {271#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} is VALID [2020-07-29 01:17:20,299 INFO L280 TraceCheckUtils]: 7: Hoare triple {271#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); srcloc: L9 {271#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} is VALID [2020-07-29 01:17:20,300 INFO L280 TraceCheckUtils]: 8: Hoare triple {271#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} assume !(5 == ~i~0); {271#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} is VALID [2020-07-29 01:17:20,301 INFO L280 TraceCheckUtils]: 9: Hoare triple {271#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {272#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2020-07-29 01:17:20,303 INFO L280 TraceCheckUtils]: 10: Hoare triple {272#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < 10); {272#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2020-07-29 01:17:20,304 INFO L280 TraceCheckUtils]: 11: Hoare triple {272#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (<= main_~i~0 1) (<= 1 main_~i~0))} assume !(4 + (~p~0.offset + 4 * ~i~0) <= #length[~p~0.base] && 0 <= ~p~0.offset + 4 * ~i~0); {267#false} is VALID [2020-07-29 01:17:20,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:20,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:17:20,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2020-07-29 01:17:20,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917123208] [2020-07-29 01:17:20,307 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-29 01:17:20,307 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:17:20,308 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:17:20,332 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 01:17:20,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 01:17:20,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:17:20,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:17:20,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:17:20,333 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 5 states. [2020-07-29 01:17:20,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:20,549 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2020-07-29 01:17:20,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:17:20,549 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-29 01:17:20,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:17:20,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:17:20,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2020-07-29 01:17:20,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:17:20,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2020-07-29 01:17:20,554 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2020-07-29 01:17:20,606 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:20,608 INFO L225 Difference]: With dead ends: 31 [2020-07-29 01:17:20,608 INFO L226 Difference]: Without dead ends: 31 [2020-07-29 01:17:20,609 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:17:20,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-29 01:17:20,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2020-07-29 01:17:20,617 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:17:20,618 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 30 states. [2020-07-29 01:17:20,618 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 30 states. [2020-07-29 01:17:20,618 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 30 states. [2020-07-29 01:17:20,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:20,626 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2020-07-29 01:17:20,626 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2020-07-29 01:17:20,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:20,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:20,627 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 31 states. [2020-07-29 01:17:20,628 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 31 states. [2020-07-29 01:17:20,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:20,634 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2020-07-29 01:17:20,635 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2020-07-29 01:17:20,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:20,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:20,636 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:17:20,636 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:17:20,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-29 01:17:20,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2020-07-29 01:17:20,639 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 12 [2020-07-29 01:17:20,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:17:20,640 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2020-07-29 01:17:20,640 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 01:17:20,640 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-29 01:17:20,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-29 01:17:20,643 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:20,643 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:17:20,856 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-29 01:17:20,857 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:17:20,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:20,858 INFO L82 PathProgramCache]: Analyzing trace with hash -31517271, now seen corresponding path program 2 times [2020-07-29 01:17:20,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:20,858 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470820831] [2020-07-29 01:17:20,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:20,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:21,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:17:21,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:21,030 INFO L280 TraceCheckUtils]: 0: Hoare triple {441#(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; {432#true} is VALID [2020-07-29 01:17:21,031 INFO L280 TraceCheckUtils]: 1: Hoare triple {432#true} assume true; {432#true} is VALID [2020-07-29 01:17:21,031 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {432#true} {432#true} #37#return; {432#true} is VALID [2020-07-29 01:17:21,033 INFO L263 TraceCheckUtils]: 0: Hoare triple {432#true} call ULTIMATE.init(); {441#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:17:21,033 INFO L280 TraceCheckUtils]: 1: Hoare triple {441#(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; {432#true} is VALID [2020-07-29 01:17:21,034 INFO L280 TraceCheckUtils]: 2: Hoare triple {432#true} assume true; {432#true} is VALID [2020-07-29 01:17:21,034 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {432#true} {432#true} #37#return; {432#true} is VALID [2020-07-29 01:17:21,035 INFO L263 TraceCheckUtils]: 4: Hoare triple {432#true} call #t~ret4 := main(); {432#true} is VALID [2020-07-29 01:17:21,036 INFO L280 TraceCheckUtils]: 5: Hoare triple {432#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(40);~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {437#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} is VALID [2020-07-29 01:17:21,038 INFO L280 TraceCheckUtils]: 6: Hoare triple {437#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} assume !!(~i~0 < 10); {437#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} is VALID [2020-07-29 01:17:21,039 INFO L280 TraceCheckUtils]: 7: Hoare triple {437#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); srcloc: L9 {437#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} is VALID [2020-07-29 01:17:21,040 INFO L280 TraceCheckUtils]: 8: Hoare triple {437#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} assume !(5 == ~i~0); {437#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} is VALID [2020-07-29 01:17:21,041 INFO L280 TraceCheckUtils]: 9: Hoare triple {437#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {438#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (<= 1 main_~i~0))} is VALID [2020-07-29 01:17:21,043 INFO L280 TraceCheckUtils]: 10: Hoare triple {438#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (<= 1 main_~i~0))} assume !!(~i~0 < 10); {438#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (<= 1 main_~i~0))} is VALID [2020-07-29 01:17:21,044 INFO L280 TraceCheckUtils]: 11: Hoare triple {438#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (<= 1 main_~i~0))} SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); srcloc: L9 {438#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (<= 1 main_~i~0))} is VALID [2020-07-29 01:17:21,046 INFO L280 TraceCheckUtils]: 12: Hoare triple {438#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (<= 1 main_~i~0))} assume !(5 == ~i~0); {438#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (<= 1 main_~i~0))} is VALID [2020-07-29 01:17:21,047 INFO L280 TraceCheckUtils]: 13: Hoare triple {438#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {439#(and (<= 2 main_~i~0) (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)))} is VALID [2020-07-29 01:17:21,049 INFO L280 TraceCheckUtils]: 14: Hoare triple {439#(and (<= 2 main_~i~0) (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)))} assume !!(~i~0 < 10); {440#(and (<= 2 main_~i~0) (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (<= main_~i~0 9))} is VALID [2020-07-29 01:17:21,050 INFO L280 TraceCheckUtils]: 15: Hoare triple {440#(and (<= 2 main_~i~0) (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (<= main_~i~0 9))} assume !(4 + (~p~0.offset + 4 * ~i~0) <= #length[~p~0.base] && 0 <= ~p~0.offset + 4 * ~i~0); {433#false} is VALID [2020-07-29 01:17:21,052 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:21,053 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470820831] [2020-07-29 01:17:21,053 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333029147] [2020-07-29 01:17:21,053 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:17:21,088 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 01:17:21,088 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:17:21,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-29 01:17:21,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:21,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:17:21,123 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-29 01:17:21,123 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:17:21,131 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:17:21,132 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:17:21,132 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-07-29 01:17:21,135 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:17:21,135 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_8|]. (and (= 0 main_~p~0.offset) (= |#length| (store |v_#length_8| main_~p~0.base 40)) (= 0 main_~i~0)) [2020-07-29 01:17:21,136 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 main_~p~0.offset) (= 0 main_~i~0) (= 40 (select |#length| main_~p~0.base))) [2020-07-29 01:17:21,207 INFO L263 TraceCheckUtils]: 0: Hoare triple {432#true} call ULTIMATE.init(); {432#true} is VALID [2020-07-29 01:17:21,207 INFO L280 TraceCheckUtils]: 1: Hoare triple {432#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {432#true} is VALID [2020-07-29 01:17:21,207 INFO L280 TraceCheckUtils]: 2: Hoare triple {432#true} assume true; {432#true} is VALID [2020-07-29 01:17:21,208 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {432#true} {432#true} #37#return; {432#true} is VALID [2020-07-29 01:17:21,208 INFO L263 TraceCheckUtils]: 4: Hoare triple {432#true} call #t~ret4 := main(); {432#true} is VALID [2020-07-29 01:17:21,210 INFO L280 TraceCheckUtils]: 5: Hoare triple {432#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(40);~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {437#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} is VALID [2020-07-29 01:17:21,211 INFO L280 TraceCheckUtils]: 6: Hoare triple {437#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} assume !!(~i~0 < 10); {437#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} is VALID [2020-07-29 01:17:21,213 INFO L280 TraceCheckUtils]: 7: Hoare triple {437#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); srcloc: L9 {437#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} is VALID [2020-07-29 01:17:21,214 INFO L280 TraceCheckUtils]: 8: Hoare triple {437#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} assume !(5 == ~i~0); {437#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} is VALID [2020-07-29 01:17:21,215 INFO L280 TraceCheckUtils]: 9: Hoare triple {437#(and (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)) (= 0 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {472#(and (= 1 main_~i~0) (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)))} is VALID [2020-07-29 01:17:21,216 INFO L280 TraceCheckUtils]: 10: Hoare triple {472#(and (= 1 main_~i~0) (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)))} assume !!(~i~0 < 10); {472#(and (= 1 main_~i~0) (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)))} is VALID [2020-07-29 01:17:21,217 INFO L280 TraceCheckUtils]: 11: Hoare triple {472#(and (= 1 main_~i~0) (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)))} SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); srcloc: L9 {472#(and (= 1 main_~i~0) (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)))} is VALID [2020-07-29 01:17:21,218 INFO L280 TraceCheckUtils]: 12: Hoare triple {472#(and (= 1 main_~i~0) (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)))} assume !(5 == ~i~0); {472#(and (= 1 main_~i~0) (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)))} is VALID [2020-07-29 01:17:21,219 INFO L280 TraceCheckUtils]: 13: Hoare triple {472#(and (= 1 main_~i~0) (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {485#(and (= 2 main_~i~0) (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)))} is VALID [2020-07-29 01:17:21,221 INFO L280 TraceCheckUtils]: 14: Hoare triple {485#(and (= 2 main_~i~0) (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)))} assume !!(~i~0 < 10); {485#(and (= 2 main_~i~0) (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)))} is VALID [2020-07-29 01:17:21,222 INFO L280 TraceCheckUtils]: 15: Hoare triple {485#(and (= 2 main_~i~0) (= 0 main_~p~0.offset) (= 40 (select |#length| main_~p~0.base)))} assume !(4 + (~p~0.offset + 4 * ~i~0) <= #length[~p~0.base] && 0 <= ~p~0.offset + 4 * ~i~0); {433#false} is VALID [2020-07-29 01:17:21,223 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:21,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:17:21,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2020-07-29 01:17:21,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952186691] [2020-07-29 01:17:21,225 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2020-07-29 01:17:21,225 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:17:21,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 01:17:21,260 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 01:17:21,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-29 01:17:21,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:17:21,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-29 01:17:21,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:17:21,262 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 9 states. [2020-07-29 01:17:21,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:21,632 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2020-07-29 01:17:21,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:17:21,632 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2020-07-29 01:17:21,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:17:21,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:17:21,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 38 transitions. [2020-07-29 01:17:21,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:17:21,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 38 transitions. [2020-07-29 01:17:21,637 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 38 transitions. [2020-07-29 01:17:21,709 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:21,711 INFO L225 Difference]: With dead ends: 34 [2020-07-29 01:17:21,711 INFO L226 Difference]: Without dead ends: 34 [2020-07-29 01:17:21,712 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:17:21,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-29 01:17:21,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-07-29 01:17:21,717 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:17:21,717 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 34 states. [2020-07-29 01:17:21,717 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2020-07-29 01:17:21,717 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2020-07-29 01:17:21,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:21,720 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2020-07-29 01:17:21,720 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2020-07-29 01:17:21,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:21,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:21,721 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2020-07-29 01:17:21,721 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2020-07-29 01:17:21,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:21,723 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2020-07-29 01:17:21,723 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2020-07-29 01:17:21,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:21,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:21,724 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:17:21,724 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:17:21,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-29 01:17:21,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2020-07-29 01:17:21,729 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 16 [2020-07-29 01:17:21,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:17:21,730 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2020-07-29 01:17:21,730 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-29 01:17:21,730 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2020-07-29 01:17:21,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-29 01:17:21,731 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:21,731 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:17:21,931 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:17:21,932 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:17:21,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:21,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1273613558, now seen corresponding path program 1 times [2020-07-29 01:17:21,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:21,933 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848856629] [2020-07-29 01:17:21,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:21,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:22,094 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:17:22,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:22,106 INFO L280 TraceCheckUtils]: 0: Hoare triple {636#(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; {627#true} is VALID [2020-07-29 01:17:22,107 INFO L280 TraceCheckUtils]: 1: Hoare triple {627#true} assume true; {627#true} is VALID [2020-07-29 01:17:22,107 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {627#true} {627#true} #37#return; {627#true} is VALID [2020-07-29 01:17:22,108 INFO L263 TraceCheckUtils]: 0: Hoare triple {627#true} call ULTIMATE.init(); {636#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:17:22,108 INFO L280 TraceCheckUtils]: 1: Hoare triple {636#(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; {627#true} is VALID [2020-07-29 01:17:22,108 INFO L280 TraceCheckUtils]: 2: Hoare triple {627#true} assume true; {627#true} is VALID [2020-07-29 01:17:22,109 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {627#true} {627#true} #37#return; {627#true} is VALID [2020-07-29 01:17:22,109 INFO L263 TraceCheckUtils]: 4: Hoare triple {627#true} call #t~ret4 := main(); {627#true} is VALID [2020-07-29 01:17:22,110 INFO L280 TraceCheckUtils]: 5: Hoare triple {627#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(40);~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {632#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:22,110 INFO L280 TraceCheckUtils]: 6: Hoare triple {632#(= 0 main_~i~0)} assume !!(~i~0 < 10); {632#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:22,111 INFO L280 TraceCheckUtils]: 7: Hoare triple {632#(= 0 main_~i~0)} SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); srcloc: L9 {632#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:22,112 INFO L280 TraceCheckUtils]: 8: Hoare triple {632#(= 0 main_~i~0)} assume !(5 == ~i~0); {632#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:22,112 INFO L280 TraceCheckUtils]: 9: Hoare triple {632#(= 0 main_~i~0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {633#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:22,113 INFO L280 TraceCheckUtils]: 10: Hoare triple {633#(<= main_~i~0 1)} assume !!(~i~0 < 10); {633#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:22,113 INFO L280 TraceCheckUtils]: 11: Hoare triple {633#(<= main_~i~0 1)} SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); srcloc: L9 {633#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:22,114 INFO L280 TraceCheckUtils]: 12: Hoare triple {633#(<= main_~i~0 1)} assume !(5 == ~i~0); {633#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:22,115 INFO L280 TraceCheckUtils]: 13: Hoare triple {633#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {634#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:22,115 INFO L280 TraceCheckUtils]: 14: Hoare triple {634#(<= main_~i~0 2)} assume !!(~i~0 < 10); {634#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:22,116 INFO L280 TraceCheckUtils]: 15: Hoare triple {634#(<= main_~i~0 2)} SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); srcloc: L9 {634#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:22,116 INFO L280 TraceCheckUtils]: 16: Hoare triple {634#(<= main_~i~0 2)} assume !(5 == ~i~0); {634#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:22,120 INFO L280 TraceCheckUtils]: 17: Hoare triple {634#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {635#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:22,121 INFO L280 TraceCheckUtils]: 18: Hoare triple {635#(<= main_~i~0 3)} assume !!(~i~0 < 10); {635#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:22,122 INFO L280 TraceCheckUtils]: 19: Hoare triple {635#(<= main_~i~0 3)} SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); srcloc: L9 {635#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:22,122 INFO L280 TraceCheckUtils]: 20: Hoare triple {635#(<= main_~i~0 3)} assume 5 == ~i~0; {628#false} is VALID [2020-07-29 01:17:22,122 INFO L280 TraceCheckUtils]: 21: Hoare triple {628#false} assume 0 == ~p~0.offset; {628#false} is VALID [2020-07-29 01:17:22,123 INFO L280 TraceCheckUtils]: 22: Hoare triple {628#false} assume !(~p~0.base < #StackHeapBarrier); {628#false} is VALID [2020-07-29 01:17:22,123 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:22,124 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848856629] [2020-07-29 01:17:22,124 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234853357] [2020-07-29 01:17:22,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-07-29 01:17:22,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:17:22,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:17:22,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:22,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:17:22,312 INFO L263 TraceCheckUtils]: 0: Hoare triple {627#true} call ULTIMATE.init(); {627#true} is VALID [2020-07-29 01:17:22,312 INFO L280 TraceCheckUtils]: 1: Hoare triple {627#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {627#true} is VALID [2020-07-29 01:17:22,312 INFO L280 TraceCheckUtils]: 2: Hoare triple {627#true} assume true; {627#true} is VALID [2020-07-29 01:17:22,312 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {627#true} {627#true} #37#return; {627#true} is VALID [2020-07-29 01:17:22,313 INFO L263 TraceCheckUtils]: 4: Hoare triple {627#true} call #t~ret4 := main(); {627#true} is VALID [2020-07-29 01:17:22,320 INFO L280 TraceCheckUtils]: 5: Hoare triple {627#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(40);~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {655#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:22,321 INFO L280 TraceCheckUtils]: 6: Hoare triple {655#(<= main_~i~0 0)} assume !!(~i~0 < 10); {655#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:22,322 INFO L280 TraceCheckUtils]: 7: Hoare triple {655#(<= main_~i~0 0)} SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); srcloc: L9 {655#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:22,323 INFO L280 TraceCheckUtils]: 8: Hoare triple {655#(<= main_~i~0 0)} assume !(5 == ~i~0); {655#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:22,324 INFO L280 TraceCheckUtils]: 9: Hoare triple {655#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {633#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:22,340 INFO L280 TraceCheckUtils]: 10: Hoare triple {633#(<= main_~i~0 1)} assume !!(~i~0 < 10); {633#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:22,343 INFO L280 TraceCheckUtils]: 11: Hoare triple {633#(<= main_~i~0 1)} SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); srcloc: L9 {633#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:22,345 INFO L280 TraceCheckUtils]: 12: Hoare triple {633#(<= main_~i~0 1)} assume !(5 == ~i~0); {633#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:22,346 INFO L280 TraceCheckUtils]: 13: Hoare triple {633#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {634#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:22,346 INFO L280 TraceCheckUtils]: 14: Hoare triple {634#(<= main_~i~0 2)} assume !!(~i~0 < 10); {634#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:22,347 INFO L280 TraceCheckUtils]: 15: Hoare triple {634#(<= main_~i~0 2)} SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); srcloc: L9 {634#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:22,348 INFO L280 TraceCheckUtils]: 16: Hoare triple {634#(<= main_~i~0 2)} assume !(5 == ~i~0); {634#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:22,349 INFO L280 TraceCheckUtils]: 17: Hoare triple {634#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {635#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:22,353 INFO L280 TraceCheckUtils]: 18: Hoare triple {635#(<= main_~i~0 3)} assume !!(~i~0 < 10); {635#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:22,353 INFO L280 TraceCheckUtils]: 19: Hoare triple {635#(<= main_~i~0 3)} SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); srcloc: L9 {635#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:22,354 INFO L280 TraceCheckUtils]: 20: Hoare triple {635#(<= main_~i~0 3)} assume 5 == ~i~0; {628#false} is VALID [2020-07-29 01:17:22,354 INFO L280 TraceCheckUtils]: 21: Hoare triple {628#false} assume 0 == ~p~0.offset; {628#false} is VALID [2020-07-29 01:17:22,354 INFO L280 TraceCheckUtils]: 22: Hoare triple {628#false} assume !(~p~0.base < #StackHeapBarrier); {628#false} is VALID [2020-07-29 01:17:22,355 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:22,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:17:22,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2020-07-29 01:17:22,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318494087] [2020-07-29 01:17:22,356 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2020-07-29 01:17:22,357 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:17:22,357 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-29 01:17:22,389 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:22,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-29 01:17:22,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:17:22,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-29 01:17:22,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-07-29 01:17:22,391 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 8 states. [2020-07-29 01:17:22,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:22,562 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2020-07-29 01:17:22,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 01:17:22,562 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2020-07-29 01:17:22,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:17:22,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:17:22,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2020-07-29 01:17:22,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:17:22,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2020-07-29 01:17:22,567 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 36 transitions. [2020-07-29 01:17:22,607 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:22,608 INFO L225 Difference]: With dead ends: 37 [2020-07-29 01:17:22,608 INFO L226 Difference]: Without dead ends: 37 [2020-07-29 01:17:22,609 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-07-29 01:17:22,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-29 01:17:22,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2020-07-29 01:17:22,612 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:17:22,612 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 36 states. [2020-07-29 01:17:22,612 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 36 states. [2020-07-29 01:17:22,612 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 36 states. [2020-07-29 01:17:22,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:22,616 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2020-07-29 01:17:22,616 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2020-07-29 01:17:22,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:22,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:22,617 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 37 states. [2020-07-29 01:17:22,617 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 37 states. [2020-07-29 01:17:22,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:22,621 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2020-07-29 01:17:22,621 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2020-07-29 01:17:22,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:22,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:22,622 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:17:22,622 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:17:22,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-29 01:17:22,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2020-07-29 01:17:22,626 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 23 [2020-07-29 01:17:22,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:17:22,626 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2020-07-29 01:17:22,627 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-29 01:17:22,627 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2020-07-29 01:17:22,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-29 01:17:22,627 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:22,627 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:17:22,842 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:17:22,843 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:17:22,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:22,844 INFO L82 PathProgramCache]: Analyzing trace with hash 130667105, now seen corresponding path program 1 times [2020-07-29 01:17:22,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:22,845 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430609442] [2020-07-29 01:17:22,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:22,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:22,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:17:22,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:22,975 INFO L280 TraceCheckUtils]: 0: Hoare triple {863#(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; {853#true} is VALID [2020-07-29 01:17:22,975 INFO L280 TraceCheckUtils]: 1: Hoare triple {853#true} assume true; {853#true} is VALID [2020-07-29 01:17:22,976 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {853#true} {853#true} #37#return; {853#true} is VALID [2020-07-29 01:17:22,977 INFO L263 TraceCheckUtils]: 0: Hoare triple {853#true} call ULTIMATE.init(); {863#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:17:22,977 INFO L280 TraceCheckUtils]: 1: Hoare triple {863#(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; {853#true} is VALID [2020-07-29 01:17:22,977 INFO L280 TraceCheckUtils]: 2: Hoare triple {853#true} assume true; {853#true} is VALID [2020-07-29 01:17:22,977 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {853#true} {853#true} #37#return; {853#true} is VALID [2020-07-29 01:17:22,978 INFO L263 TraceCheckUtils]: 4: Hoare triple {853#true} call #t~ret4 := main(); {853#true} is VALID [2020-07-29 01:17:22,979 INFO L280 TraceCheckUtils]: 5: Hoare triple {853#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(40);~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {858#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:22,979 INFO L280 TraceCheckUtils]: 6: Hoare triple {858#(= 0 main_~i~0)} assume !!(~i~0 < 10); {858#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:22,980 INFO L280 TraceCheckUtils]: 7: Hoare triple {858#(= 0 main_~i~0)} SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); srcloc: L9 {858#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:22,981 INFO L280 TraceCheckUtils]: 8: Hoare triple {858#(= 0 main_~i~0)} assume !(5 == ~i~0); {858#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:22,981 INFO L280 TraceCheckUtils]: 9: Hoare triple {858#(= 0 main_~i~0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {859#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:22,982 INFO L280 TraceCheckUtils]: 10: Hoare triple {859#(<= main_~i~0 1)} assume !!(~i~0 < 10); {859#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:22,983 INFO L280 TraceCheckUtils]: 11: Hoare triple {859#(<= main_~i~0 1)} SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); srcloc: L9 {859#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:22,983 INFO L280 TraceCheckUtils]: 12: Hoare triple {859#(<= main_~i~0 1)} assume !(5 == ~i~0); {859#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:22,984 INFO L280 TraceCheckUtils]: 13: Hoare triple {859#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {860#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:22,985 INFO L280 TraceCheckUtils]: 14: Hoare triple {860#(<= main_~i~0 2)} assume !!(~i~0 < 10); {860#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:22,985 INFO L280 TraceCheckUtils]: 15: Hoare triple {860#(<= main_~i~0 2)} SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); srcloc: L9 {860#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:22,986 INFO L280 TraceCheckUtils]: 16: Hoare triple {860#(<= main_~i~0 2)} assume !(5 == ~i~0); {860#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:22,987 INFO L280 TraceCheckUtils]: 17: Hoare triple {860#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {861#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:22,988 INFO L280 TraceCheckUtils]: 18: Hoare triple {861#(<= main_~i~0 3)} assume !!(~i~0 < 10); {861#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:22,988 INFO L280 TraceCheckUtils]: 19: Hoare triple {861#(<= main_~i~0 3)} SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); srcloc: L9 {861#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:22,989 INFO L280 TraceCheckUtils]: 20: Hoare triple {861#(<= main_~i~0 3)} assume !(5 == ~i~0); {861#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:22,990 INFO L280 TraceCheckUtils]: 21: Hoare triple {861#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {862#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:22,991 INFO L280 TraceCheckUtils]: 22: Hoare triple {862#(<= main_~i~0 4)} assume !(~i~0 < 10); {854#false} is VALID [2020-07-29 01:17:22,991 INFO L280 TraceCheckUtils]: 23: Hoare triple {854#false} #res := 0; {854#false} is VALID [2020-07-29 01:17:22,991 INFO L280 TraceCheckUtils]: 24: Hoare triple {854#false} assume !(#valid == old(#valid)); {854#false} is VALID [2020-07-29 01:17:22,992 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:22,993 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430609442] [2020-07-29 01:17:22,993 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29632331] [2020-07-29 01:17:22,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:17:23,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:23,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:17:23,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:23,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:17:23,202 INFO L263 TraceCheckUtils]: 0: Hoare triple {853#true} call ULTIMATE.init(); {853#true} is VALID [2020-07-29 01:17:23,202 INFO L280 TraceCheckUtils]: 1: Hoare triple {853#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {853#true} is VALID [2020-07-29 01:17:23,202 INFO L280 TraceCheckUtils]: 2: Hoare triple {853#true} assume true; {853#true} is VALID [2020-07-29 01:17:23,202 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {853#true} {853#true} #37#return; {853#true} is VALID [2020-07-29 01:17:23,202 INFO L263 TraceCheckUtils]: 4: Hoare triple {853#true} call #t~ret4 := main(); {853#true} is VALID [2020-07-29 01:17:23,205 INFO L280 TraceCheckUtils]: 5: Hoare triple {853#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(40);~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {882#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:23,207 INFO L280 TraceCheckUtils]: 6: Hoare triple {882#(<= main_~i~0 0)} assume !!(~i~0 < 10); {882#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:23,207 INFO L280 TraceCheckUtils]: 7: Hoare triple {882#(<= main_~i~0 0)} SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); srcloc: L9 {882#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:23,208 INFO L280 TraceCheckUtils]: 8: Hoare triple {882#(<= main_~i~0 0)} assume !(5 == ~i~0); {882#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:23,209 INFO L280 TraceCheckUtils]: 9: Hoare triple {882#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {859#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:23,209 INFO L280 TraceCheckUtils]: 10: Hoare triple {859#(<= main_~i~0 1)} assume !!(~i~0 < 10); {859#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:23,210 INFO L280 TraceCheckUtils]: 11: Hoare triple {859#(<= main_~i~0 1)} SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); srcloc: L9 {859#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:23,210 INFO L280 TraceCheckUtils]: 12: Hoare triple {859#(<= main_~i~0 1)} assume !(5 == ~i~0); {859#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:23,211 INFO L280 TraceCheckUtils]: 13: Hoare triple {859#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {860#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:23,215 INFO L280 TraceCheckUtils]: 14: Hoare triple {860#(<= main_~i~0 2)} assume !!(~i~0 < 10); {860#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:23,216 INFO L280 TraceCheckUtils]: 15: Hoare triple {860#(<= main_~i~0 2)} SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); srcloc: L9 {860#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:23,216 INFO L280 TraceCheckUtils]: 16: Hoare triple {860#(<= main_~i~0 2)} assume !(5 == ~i~0); {860#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:23,217 INFO L280 TraceCheckUtils]: 17: Hoare triple {860#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {861#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:23,217 INFO L280 TraceCheckUtils]: 18: Hoare triple {861#(<= main_~i~0 3)} assume !!(~i~0 < 10); {861#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:23,218 INFO L280 TraceCheckUtils]: 19: Hoare triple {861#(<= main_~i~0 3)} SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); srcloc: L9 {861#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:23,218 INFO L280 TraceCheckUtils]: 20: Hoare triple {861#(<= main_~i~0 3)} assume !(5 == ~i~0); {861#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:23,219 INFO L280 TraceCheckUtils]: 21: Hoare triple {861#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {862#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:23,219 INFO L280 TraceCheckUtils]: 22: Hoare triple {862#(<= main_~i~0 4)} assume !(~i~0 < 10); {854#false} is VALID [2020-07-29 01:17:23,219 INFO L280 TraceCheckUtils]: 23: Hoare triple {854#false} #res := 0; {854#false} is VALID [2020-07-29 01:17:23,220 INFO L280 TraceCheckUtils]: 24: Hoare triple {854#false} assume !(#valid == old(#valid)); {854#false} is VALID [2020-07-29 01:17:23,220 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:23,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:17:23,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2020-07-29 01:17:23,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693769927] [2020-07-29 01:17:23,221 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-07-29 01:17:23,222 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:17:23,222 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 01:17:23,258 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:23,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-29 01:17:23,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:17:23,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-29 01:17:23,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:17:23,259 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 9 states. [2020-07-29 01:17:23,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:23,447 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2020-07-29 01:17:23,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:17:23,448 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-07-29 01:17:23,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:17:23,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:17:23,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2020-07-29 01:17:23,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:17:23,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2020-07-29 01:17:23,452 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 41 transitions. [2020-07-29 01:17:23,508 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:23,509 INFO L225 Difference]: With dead ends: 41 [2020-07-29 01:17:23,509 INFO L226 Difference]: Without dead ends: 41 [2020-07-29 01:17:23,510 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:17:23,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-29 01:17:23,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2020-07-29 01:17:23,514 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:17:23,515 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 40 states. [2020-07-29 01:17:23,515 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 40 states. [2020-07-29 01:17:23,515 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 40 states. [2020-07-29 01:17:23,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:23,517 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2020-07-29 01:17:23,517 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2020-07-29 01:17:23,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:23,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:23,518 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 41 states. [2020-07-29 01:17:23,518 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 41 states. [2020-07-29 01:17:23,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:23,520 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2020-07-29 01:17:23,520 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2020-07-29 01:17:23,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:23,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:23,521 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:17:23,521 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:17:23,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-29 01:17:23,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2020-07-29 01:17:23,523 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 25 [2020-07-29 01:17:23,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:17:23,523 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2020-07-29 01:17:23,523 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-29 01:17:23,523 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2020-07-29 01:17:23,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-29 01:17:23,524 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:23,524 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:17:23,737 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:17:23,738 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:17:23,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:23,739 INFO L82 PathProgramCache]: Analyzing trace with hash -656098114, now seen corresponding path program 2 times [2020-07-29 01:17:23,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:23,740 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911820292] [2020-07-29 01:17:23,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:23,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:23,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:17:23,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:23,889 INFO L280 TraceCheckUtils]: 0: Hoare triple {1113#(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; {1102#true} is VALID [2020-07-29 01:17:23,889 INFO L280 TraceCheckUtils]: 1: Hoare triple {1102#true} assume true; {1102#true} is VALID [2020-07-29 01:17:23,889 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1102#true} {1102#true} #37#return; {1102#true} is VALID [2020-07-29 01:17:23,890 INFO L263 TraceCheckUtils]: 0: Hoare triple {1102#true} call ULTIMATE.init(); {1113#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:17:23,890 INFO L280 TraceCheckUtils]: 1: Hoare triple {1113#(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; {1102#true} is VALID [2020-07-29 01:17:23,890 INFO L280 TraceCheckUtils]: 2: Hoare triple {1102#true} assume true; {1102#true} is VALID [2020-07-29 01:17:23,890 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1102#true} {1102#true} #37#return; {1102#true} is VALID [2020-07-29 01:17:23,891 INFO L263 TraceCheckUtils]: 4: Hoare triple {1102#true} call #t~ret4 := main(); {1102#true} is VALID [2020-07-29 01:17:23,892 INFO L280 TraceCheckUtils]: 5: Hoare triple {1102#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(40);~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {1107#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:23,893 INFO L280 TraceCheckUtils]: 6: Hoare triple {1107#(= 0 main_~i~0)} assume !!(~i~0 < 10); {1107#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:23,893 INFO L280 TraceCheckUtils]: 7: Hoare triple {1107#(= 0 main_~i~0)} SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); srcloc: L9 {1107#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:23,893 INFO L280 TraceCheckUtils]: 8: Hoare triple {1107#(= 0 main_~i~0)} assume !(5 == ~i~0); {1107#(= 0 main_~i~0)} is VALID [2020-07-29 01:17:23,894 INFO L280 TraceCheckUtils]: 9: Hoare triple {1107#(= 0 main_~i~0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1108#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:23,894 INFO L280 TraceCheckUtils]: 10: Hoare triple {1108#(<= main_~i~0 1)} assume !!(~i~0 < 10); {1108#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:23,895 INFO L280 TraceCheckUtils]: 11: Hoare triple {1108#(<= main_~i~0 1)} SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); srcloc: L9 {1108#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:23,895 INFO L280 TraceCheckUtils]: 12: Hoare triple {1108#(<= main_~i~0 1)} assume !(5 == ~i~0); {1108#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:23,902 INFO L280 TraceCheckUtils]: 13: Hoare triple {1108#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1109#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:23,903 INFO L280 TraceCheckUtils]: 14: Hoare triple {1109#(<= main_~i~0 2)} assume !!(~i~0 < 10); {1109#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:23,904 INFO L280 TraceCheckUtils]: 15: Hoare triple {1109#(<= main_~i~0 2)} SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); srcloc: L9 {1109#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:23,904 INFO L280 TraceCheckUtils]: 16: Hoare triple {1109#(<= main_~i~0 2)} assume !(5 == ~i~0); {1109#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:23,905 INFO L280 TraceCheckUtils]: 17: Hoare triple {1109#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1110#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:23,905 INFO L280 TraceCheckUtils]: 18: Hoare triple {1110#(<= main_~i~0 3)} assume !!(~i~0 < 10); {1110#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:23,906 INFO L280 TraceCheckUtils]: 19: Hoare triple {1110#(<= main_~i~0 3)} SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); srcloc: L9 {1110#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:23,906 INFO L280 TraceCheckUtils]: 20: Hoare triple {1110#(<= main_~i~0 3)} assume !(5 == ~i~0); {1110#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:23,907 INFO L280 TraceCheckUtils]: 21: Hoare triple {1110#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1111#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:23,907 INFO L280 TraceCheckUtils]: 22: Hoare triple {1111#(<= main_~i~0 4)} assume !!(~i~0 < 10); {1111#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:23,908 INFO L280 TraceCheckUtils]: 23: Hoare triple {1111#(<= main_~i~0 4)} SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); srcloc: L9 {1111#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:23,908 INFO L280 TraceCheckUtils]: 24: Hoare triple {1111#(<= main_~i~0 4)} assume !(5 == ~i~0); {1111#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:23,909 INFO L280 TraceCheckUtils]: 25: Hoare triple {1111#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1112#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:23,909 INFO L280 TraceCheckUtils]: 26: Hoare triple {1112#(<= main_~i~0 5)} assume !(~i~0 < 10); {1103#false} is VALID [2020-07-29 01:17:23,909 INFO L280 TraceCheckUtils]: 27: Hoare triple {1103#false} #res := 0; {1103#false} is VALID [2020-07-29 01:17:23,910 INFO L280 TraceCheckUtils]: 28: Hoare triple {1103#false} assume !(#valid == old(#valid)); {1103#false} is VALID [2020-07-29 01:17:23,911 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:23,911 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911820292] [2020-07-29 01:17:23,911 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114108048] [2020-07-29 01:17:23,911 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:17:23,949 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 01:17:23,949 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:17:23,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:17:23,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:23,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:17:24,157 INFO L263 TraceCheckUtils]: 0: Hoare triple {1102#true} call ULTIMATE.init(); {1102#true} is VALID [2020-07-29 01:17:24,157 INFO L280 TraceCheckUtils]: 1: Hoare triple {1102#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1102#true} is VALID [2020-07-29 01:17:24,158 INFO L280 TraceCheckUtils]: 2: Hoare triple {1102#true} assume true; {1102#true} is VALID [2020-07-29 01:17:24,158 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1102#true} {1102#true} #37#return; {1102#true} is VALID [2020-07-29 01:17:24,158 INFO L263 TraceCheckUtils]: 4: Hoare triple {1102#true} call #t~ret4 := main(); {1102#true} is VALID [2020-07-29 01:17:24,162 INFO L280 TraceCheckUtils]: 5: Hoare triple {1102#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(40);~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {1132#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:24,166 INFO L280 TraceCheckUtils]: 6: Hoare triple {1132#(<= main_~i~0 0)} assume !!(~i~0 < 10); {1132#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:24,166 INFO L280 TraceCheckUtils]: 7: Hoare triple {1132#(<= main_~i~0 0)} SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); srcloc: L9 {1132#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:24,167 INFO L280 TraceCheckUtils]: 8: Hoare triple {1132#(<= main_~i~0 0)} assume !(5 == ~i~0); {1132#(<= main_~i~0 0)} is VALID [2020-07-29 01:17:24,168 INFO L280 TraceCheckUtils]: 9: Hoare triple {1132#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1108#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:24,169 INFO L280 TraceCheckUtils]: 10: Hoare triple {1108#(<= main_~i~0 1)} assume !!(~i~0 < 10); {1108#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:24,170 INFO L280 TraceCheckUtils]: 11: Hoare triple {1108#(<= main_~i~0 1)} SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); srcloc: L9 {1108#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:24,170 INFO L280 TraceCheckUtils]: 12: Hoare triple {1108#(<= main_~i~0 1)} assume !(5 == ~i~0); {1108#(<= main_~i~0 1)} is VALID [2020-07-29 01:17:24,171 INFO L280 TraceCheckUtils]: 13: Hoare triple {1108#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1109#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:24,172 INFO L280 TraceCheckUtils]: 14: Hoare triple {1109#(<= main_~i~0 2)} assume !!(~i~0 < 10); {1109#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:24,173 INFO L280 TraceCheckUtils]: 15: Hoare triple {1109#(<= main_~i~0 2)} SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); srcloc: L9 {1109#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:24,173 INFO L280 TraceCheckUtils]: 16: Hoare triple {1109#(<= main_~i~0 2)} assume !(5 == ~i~0); {1109#(<= main_~i~0 2)} is VALID [2020-07-29 01:17:24,174 INFO L280 TraceCheckUtils]: 17: Hoare triple {1109#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1110#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:24,175 INFO L280 TraceCheckUtils]: 18: Hoare triple {1110#(<= main_~i~0 3)} assume !!(~i~0 < 10); {1110#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:24,176 INFO L280 TraceCheckUtils]: 19: Hoare triple {1110#(<= main_~i~0 3)} SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); srcloc: L9 {1110#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:24,176 INFO L280 TraceCheckUtils]: 20: Hoare triple {1110#(<= main_~i~0 3)} assume !(5 == ~i~0); {1110#(<= main_~i~0 3)} is VALID [2020-07-29 01:17:24,178 INFO L280 TraceCheckUtils]: 21: Hoare triple {1110#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1111#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:24,182 INFO L280 TraceCheckUtils]: 22: Hoare triple {1111#(<= main_~i~0 4)} assume !!(~i~0 < 10); {1111#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:24,183 INFO L280 TraceCheckUtils]: 23: Hoare triple {1111#(<= main_~i~0 4)} SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); srcloc: L9 {1111#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:24,184 INFO L280 TraceCheckUtils]: 24: Hoare triple {1111#(<= main_~i~0 4)} assume !(5 == ~i~0); {1111#(<= main_~i~0 4)} is VALID [2020-07-29 01:17:24,185 INFO L280 TraceCheckUtils]: 25: Hoare triple {1111#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1112#(<= main_~i~0 5)} is VALID [2020-07-29 01:17:24,186 INFO L280 TraceCheckUtils]: 26: Hoare triple {1112#(<= main_~i~0 5)} assume !(~i~0 < 10); {1103#false} is VALID [2020-07-29 01:17:24,186 INFO L280 TraceCheckUtils]: 27: Hoare triple {1103#false} #res := 0; {1103#false} is VALID [2020-07-29 01:17:24,186 INFO L280 TraceCheckUtils]: 28: Hoare triple {1103#false} assume !(#valid == old(#valid)); {1103#false} is VALID [2020-07-29 01:17:24,188 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:17:24,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:17:24,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2020-07-29 01:17:24,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067915175] [2020-07-29 01:17:24,189 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2020-07-29 01:17:24,190 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:17:24,191 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-29 01:17:24,232 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:24,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-29 01:17:24,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:17:24,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-29 01:17:24,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:17:24,234 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 10 states. [2020-07-29 01:17:24,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:24,440 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2020-07-29 01:17:24,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 01:17:24,440 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2020-07-29 01:17:24,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:17:24,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:17:24,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 45 transitions. [2020-07-29 01:17:24,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:17:24,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 45 transitions. [2020-07-29 01:17:24,445 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 45 transitions. [2020-07-29 01:17:24,505 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:24,506 INFO L225 Difference]: With dead ends: 44 [2020-07-29 01:17:24,507 INFO L226 Difference]: Without dead ends: 44 [2020-07-29 01:17:24,507 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:17:24,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-29 01:17:24,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-07-29 01:17:24,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:17:24,511 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2020-07-29 01:17:24,511 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2020-07-29 01:17:24,511 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2020-07-29 01:17:24,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:24,512 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2020-07-29 01:17:24,512 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2020-07-29 01:17:24,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:24,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:24,513 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2020-07-29 01:17:24,513 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2020-07-29 01:17:24,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:24,514 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2020-07-29 01:17:24,515 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2020-07-29 01:17:24,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:24,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:24,515 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:17:24,515 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:17:24,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-29 01:17:24,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2020-07-29 01:17:24,517 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 29 [2020-07-29 01:17:24,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:17:24,517 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2020-07-29 01:17:24,517 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-29 01:17:24,518 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2020-07-29 01:17:24,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-29 01:17:24,518 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:24,518 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:17:24,732 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-29 01:17:24,733 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:17:24,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:24,733 INFO L82 PathProgramCache]: Analyzing trace with hash 851171268, now seen corresponding path program 2 times [2020-07-29 01:17:24,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:24,734 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54773316] [2020-07-29 01:17:24,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:24,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:24,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:17:24,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:17:24,852 INFO L280 TraceCheckUtils]: 0: Hoare triple {1383#(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; {1377#true} is VALID [2020-07-29 01:17:24,853 INFO L280 TraceCheckUtils]: 1: Hoare triple {1377#true} assume true; {1377#true} is VALID [2020-07-29 01:17:24,853 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1377#true} {1377#true} #37#return; {1377#true} is VALID [2020-07-29 01:17:24,854 INFO L263 TraceCheckUtils]: 0: Hoare triple {1377#true} call ULTIMATE.init(); {1383#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:17:24,854 INFO L280 TraceCheckUtils]: 1: Hoare triple {1383#(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; {1377#true} is VALID [2020-07-29 01:17:24,855 INFO L280 TraceCheckUtils]: 2: Hoare triple {1377#true} assume true; {1377#true} is VALID [2020-07-29 01:17:24,855 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1377#true} {1377#true} #37#return; {1377#true} is VALID [2020-07-29 01:17:24,855 INFO L263 TraceCheckUtils]: 4: Hoare triple {1377#true} call #t~ret4 := main(); {1377#true} is VALID [2020-07-29 01:17:24,857 INFO L280 TraceCheckUtils]: 5: Hoare triple {1377#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(40);~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {1382#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:17:24,857 INFO L280 TraceCheckUtils]: 6: Hoare triple {1382#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} assume !!(~i~0 < 10); {1382#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:17:24,858 INFO L280 TraceCheckUtils]: 7: Hoare triple {1382#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); srcloc: L9 {1382#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:17:24,859 INFO L280 TraceCheckUtils]: 8: Hoare triple {1382#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} assume !(5 == ~i~0); {1382#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:17:24,859 INFO L280 TraceCheckUtils]: 9: Hoare triple {1382#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1382#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:17:24,860 INFO L280 TraceCheckUtils]: 10: Hoare triple {1382#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} assume !!(~i~0 < 10); {1382#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:17:24,861 INFO L280 TraceCheckUtils]: 11: Hoare triple {1382#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); srcloc: L9 {1382#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:17:24,861 INFO L280 TraceCheckUtils]: 12: Hoare triple {1382#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} assume !(5 == ~i~0); {1382#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:17:24,862 INFO L280 TraceCheckUtils]: 13: Hoare triple {1382#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1382#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:17:24,863 INFO L280 TraceCheckUtils]: 14: Hoare triple {1382#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} assume !!(~i~0 < 10); {1382#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:17:24,863 INFO L280 TraceCheckUtils]: 15: Hoare triple {1382#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); srcloc: L9 {1382#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:17:24,864 INFO L280 TraceCheckUtils]: 16: Hoare triple {1382#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} assume !(5 == ~i~0); {1382#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:17:24,865 INFO L280 TraceCheckUtils]: 17: Hoare triple {1382#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1382#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:17:24,865 INFO L280 TraceCheckUtils]: 18: Hoare triple {1382#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} assume !!(~i~0 < 10); {1382#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:17:24,866 INFO L280 TraceCheckUtils]: 19: Hoare triple {1382#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); srcloc: L9 {1382#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:17:24,867 INFO L280 TraceCheckUtils]: 20: Hoare triple {1382#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} assume !(5 == ~i~0); {1382#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:17:24,867 INFO L280 TraceCheckUtils]: 21: Hoare triple {1382#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1382#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:17:24,868 INFO L280 TraceCheckUtils]: 22: Hoare triple {1382#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} assume !!(~i~0 < 10); {1382#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:17:24,868 INFO L280 TraceCheckUtils]: 23: Hoare triple {1382#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); srcloc: L9 {1382#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:17:24,869 INFO L280 TraceCheckUtils]: 24: Hoare triple {1382#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} assume !(5 == ~i~0); {1382#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:17:24,869 INFO L280 TraceCheckUtils]: 25: Hoare triple {1382#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1382#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:17:24,870 INFO L280 TraceCheckUtils]: 26: Hoare triple {1382#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} assume !!(~i~0 < 10); {1382#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:17:24,870 INFO L280 TraceCheckUtils]: 27: Hoare triple {1382#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset + 4 * ~i~0, 4); srcloc: L9 {1382#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:17:24,871 INFO L280 TraceCheckUtils]: 28: Hoare triple {1382#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} assume 5 == ~i~0; {1382#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:17:24,871 INFO L280 TraceCheckUtils]: 29: Hoare triple {1382#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} assume 0 == ~p~0.offset; {1382#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} is VALID [2020-07-29 01:17:24,872 INFO L280 TraceCheckUtils]: 30: Hoare triple {1382#(<= (+ main_~p~0.base 1) |#StackHeapBarrier|)} assume !(~p~0.base < #StackHeapBarrier); {1378#false} is VALID [2020-07-29 01:17:24,874 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-07-29 01:17:24,874 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54773316] [2020-07-29 01:17:24,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:17:24,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:17:24,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007136753] [2020-07-29 01:17:24,875 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2020-07-29 01:17:24,875 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:17:24,876 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:17:24,893 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:24,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:17:24,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:17:24,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:17:24,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:17:24,895 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 4 states. [2020-07-29 01:17:24,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:24,970 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2020-07-29 01:17:24,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:17:24,970 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2020-07-29 01:17:24,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:17:24,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:17:24,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2020-07-29 01:17:24,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:17:24,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2020-07-29 01:17:24,976 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 19 transitions. [2020-07-29 01:17:24,998 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:17:25,000 INFO L225 Difference]: With dead ends: 43 [2020-07-29 01:17:25,000 INFO L226 Difference]: Without dead ends: 43 [2020-07-29 01:17:25,001 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:17:25,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-29 01:17:25,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-07-29 01:17:25,010 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:17:25,011 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 43 states. [2020-07-29 01:17:25,011 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2020-07-29 01:17:25,011 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2020-07-29 01:17:25,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:25,017 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2020-07-29 01:17:25,017 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2020-07-29 01:17:25,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:25,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:25,018 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2020-07-29 01:17:25,018 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2020-07-29 01:17:25,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:17:25,021 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2020-07-29 01:17:25,022 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2020-07-29 01:17:25,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:17:25,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:17:25,023 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:17:25,023 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:17:25,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-29 01:17:25,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2020-07-29 01:17:25,025 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 31 [2020-07-29 01:17:25,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:17:25,026 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2020-07-29 01:17:25,026 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:17:25,026 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2020-07-29 01:17:25,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-29 01:17:25,030 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:17:25,030 INFO L422 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:17:25,030 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-29 01:17:25,031 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2020-07-29 01:17:25,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:17:25,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1037842699, now seen corresponding path program 1 times [2020-07-29 01:17:25,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:17:25,032 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143368898] [2020-07-29 01:17:25,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:17:25,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:17:25,060 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:17:25,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:17:25,077 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:17:25,101 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:17:25,102 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-29 01:17:25,102 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-29 01:17:25,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.07 01:17:25 BoogieIcfgContainer [2020-07-29 01:17:25,144 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-29 01:17:25,144 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:17:25,144 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:17:25,145 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:17:25,145 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:17:18" (3/4) ... [2020-07-29 01:17:25,148 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-07-29 01:17:25,240 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-29 01:17:25,240 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:17:25,242 INFO L168 Benchmark]: Toolchain (without parser) took 7166.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 207.1 MB). Free memory was 956.2 MB in the beginning and 828.5 MB in the end (delta: 127.7 MB). Peak memory consumption was 334.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:17:25,243 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:17:25,243 INFO L168 Benchmark]: CACSL2BoogieTranslator took 224.62 ms. Allocated memory is still 1.0 GB. Free memory was 956.2 MB in the beginning and 945.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:17:25,244 INFO L168 Benchmark]: Boogie Preprocessor took 88.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -183.9 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:17:25,244 INFO L168 Benchmark]: RCFGBuilder took 444.47 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: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:17:25,245 INFO L168 Benchmark]: TraceAbstraction took 6302.94 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.6 MB). Free memory was 1.1 GB in the beginning and 828.5 MB in the end (delta: 281.6 MB). Peak memory consumption was 349.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:17:25,245 INFO L168 Benchmark]: Witness Printer took 95.67 ms. Allocated memory is still 1.2 GB. Free memory is still 828.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:17:25,251 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 224.62 ms. Allocated memory is still 1.0 GB. Free memory was 956.2 MB in the beginning and 945.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 88.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -183.9 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 444.47 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: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6302.94 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.6 MB). Free memory was 1.1 GB in the beginning and 828.5 MB in the end (delta: 281.6 MB). Peak memory consumption was 349.2 MB. Max. memory is 11.5 GB. * Witness Printer took 95.67 ms. Allocated memory is still 1.2 GB. Free memory is still 828.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 9]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L6] int* p = malloc(10 * sizeof(int)); [L8] int i = 0; VAL [i=0, malloc(10 * sizeof(int))={2:0}, p={2:0}] [L8] COND TRUE i < 10 VAL [i=0, malloc(10 * sizeof(int))={2:0}, p={2:0}] [L9] p[i] = 1 VAL [i=0, malloc(10 * sizeof(int))={2:0}, p={2:0}] [L10] COND FALSE !(i == 5) VAL [i=0, malloc(10 * sizeof(int))={2:0}, p={2:0}] [L8] i++ VAL [i=1, malloc(10 * sizeof(int))={2:0}, p={2:0}] [L8] COND TRUE i < 10 VAL [i=1, malloc(10 * sizeof(int))={2:0}, p={2:0}] [L9] p[i] = 1 VAL [i=1, malloc(10 * sizeof(int))={2:0}, p={2:0}] [L10] COND FALSE !(i == 5) VAL [i=1, malloc(10 * sizeof(int))={2:0}, p={2:0}] [L8] i++ VAL [i=2, malloc(10 * sizeof(int))={2:0}, p={2:0}] [L8] COND TRUE i < 10 VAL [i=2, malloc(10 * sizeof(int))={2:0}, p={2:0}] [L9] p[i] = 1 VAL [i=2, malloc(10 * sizeof(int))={2:0}, p={2:0}] [L10] COND FALSE !(i == 5) VAL [i=2, malloc(10 * sizeof(int))={2:0}, p={2:0}] [L8] i++ VAL [i=3, malloc(10 * sizeof(int))={2:0}, p={2:0}] [L8] COND TRUE i < 10 VAL [i=3, malloc(10 * sizeof(int))={2:0}, p={2:0}] [L9] p[i] = 1 VAL [i=3, malloc(10 * sizeof(int))={2:0}, p={2:0}] [L10] COND FALSE !(i == 5) VAL [i=3, malloc(10 * sizeof(int))={2:0}, p={2:0}] [L8] i++ VAL [i=4, malloc(10 * sizeof(int))={2:0}, p={2:0}] [L8] COND TRUE i < 10 VAL [i=4, malloc(10 * sizeof(int))={2:0}, p={2:0}] [L9] p[i] = 1 VAL [i=4, malloc(10 * sizeof(int))={2:0}, p={2:0}] [L10] COND FALSE !(i == 5) VAL [i=4, malloc(10 * sizeof(int))={2:0}, p={2:0}] [L8] i++ VAL [i=5, malloc(10 * sizeof(int))={2:0}, p={2:0}] [L8] COND TRUE i < 10 VAL [i=5, malloc(10 * sizeof(int))={2:0}, p={2:0}] [L9] p[i] = 1 VAL [i=5, malloc(10 * sizeof(int))={2:0}, p={2:0}] [L10] COND TRUE i == 5 VAL [i=5, malloc(10 * sizeof(int))={2:0}, p={2:0}] [L11] free(p) VAL [i=5, malloc(10 * sizeof(int))={2:0}, p={2:0}] [L11] free(p) VAL [i=5, malloc(10 * sizeof(int))={2:0}, p={2:0}] [L11] free(p) [L8] i++ VAL [i=6, malloc(10 * sizeof(int))={2:0}, p={2:0}] [L8] COND TRUE i < 10 VAL [i=6, malloc(10 * sizeof(int))={2:0}, p={2:0}] [L9] p[i] = 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 24 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 6.2s, OverallIterations: 9, TraceHistogramMax: 7, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 102 SDtfs, 97 SDslu, 231 SDs, 0 SdLazy, 433 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 151 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=7, 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, 8 MinimizatonAttempts, 9 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 292 NumberOfCodeBlocks, 292 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 244 ConstructedInterpolants, 0 QuantifiedInterpolants, 20117 SizeOfPredicates, 7 NumberOfNonLiveVariables, 368 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 13 InterpolantComputations, 3 PerfectInterpolantSequences, 57/263 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...