./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext3/scopes4-1.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/scopes4-1.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 58596999bba5cc256a412be61e4f9e3e6d264c81e8972a76406a7a850d8c4606 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 00:03:07,697 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 00:03:07,698 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 00:03:07,727 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 00:03:07,728 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 00:03:07,728 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 00:03:07,729 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 00:03:07,731 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 00:03:07,732 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 00:03:07,733 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 00:03:07,733 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 00:03:07,734 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 00:03:07,734 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 00:03:07,735 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 00:03:07,736 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 00:03:07,737 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 00:03:07,737 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 00:03:07,738 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 00:03:07,739 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 00:03:07,740 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 00:03:07,741 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 00:03:07,742 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 00:03:07,743 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 00:03:07,744 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 00:03:07,746 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 00:03:07,746 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 00:03:07,746 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 00:03:07,747 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 00:03:07,747 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 00:03:07,748 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 00:03:07,748 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 00:03:07,749 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 00:03:07,749 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 00:03:07,750 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 00:03:07,751 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 00:03:07,751 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 00:03:07,751 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 00:03:07,752 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 00:03:07,752 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 00:03:07,753 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 00:03:07,753 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 00:03:07,754 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-02-21 00:03:07,771 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 00:03:07,771 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 00:03:07,772 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 00:03:07,772 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 00:03:07,772 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 00:03:07,772 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 00:03:07,773 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 00:03:07,773 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 00:03:07,773 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 00:03:07,773 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 00:03:07,774 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 00:03:07,774 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 00:03:07,774 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 00:03:07,774 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 00:03:07,774 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 00:03:07,774 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-21 00:03:07,775 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-21 00:03:07,775 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-21 00:03:07,775 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 00:03:07,775 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-21 00:03:07,775 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 00:03:07,775 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 00:03:07,776 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 00:03:07,776 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 00:03:07,776 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 00:03:07,776 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 00:03:07,776 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 00:03:07,776 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 00:03:07,777 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 00:03:07,777 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 00:03:07,777 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 58596999bba5cc256a412be61e4f9e3e6d264c81e8972a76406a7a850d8c4606 [2022-02-21 00:03:07,959 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 00:03:07,988 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 00:03:07,990 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 00:03:07,991 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 00:03:07,992 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 00:03:07,993 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext3/scopes4-1.c [2022-02-21 00:03:08,052 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1adfab67/1c264d1de6864cb2a7033999a8f11581/FLAG52756ac41 [2022-02-21 00:03:08,416 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 00:03:08,416 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/scopes4-1.c [2022-02-21 00:03:08,423 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1adfab67/1c264d1de6864cb2a7033999a8f11581/FLAG52756ac41 [2022-02-21 00:03:08,433 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1adfab67/1c264d1de6864cb2a7033999a8f11581 [2022-02-21 00:03:08,436 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 00:03:08,438 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 00:03:08,441 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 00:03:08,441 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 00:03:08,443 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 00:03:08,447 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 12:03:08" (1/1) ... [2022-02-21 00:03:08,448 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7383264b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:03:08, skipping insertion in model container [2022-02-21 00:03:08,449 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 12:03:08" (1/1) ... [2022-02-21 00:03:08,454 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 00:03:08,462 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 00:03:08,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 00:03:08,609 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 00:03:08,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 00:03:08,628 INFO L208 MainTranslator]: Completed translation [2022-02-21 00:03:08,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:03:08 WrapperNode [2022-02-21 00:03:08,628 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 00:03:08,629 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 00:03:08,629 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 00:03:08,629 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 00:03:08,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:03:08" (1/1) ... [2022-02-21 00:03:08,639 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:03:08" (1/1) ... [2022-02-21 00:03:08,655 INFO L137 Inliner]: procedures = 11, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 29 [2022-02-21 00:03:08,656 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 00:03:08,656 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 00:03:08,657 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 00:03:08,657 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 00:03:08,662 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:03:08" (1/1) ... [2022-02-21 00:03:08,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:03:08" (1/1) ... [2022-02-21 00:03:08,671 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:03:08" (1/1) ... [2022-02-21 00:03:08,671 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:03:08" (1/1) ... [2022-02-21 00:03:08,678 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:03:08" (1/1) ... [2022-02-21 00:03:08,679 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:03:08" (1/1) ... [2022-02-21 00:03:08,680 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:03:08" (1/1) ... [2022-02-21 00:03:08,681 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 00:03:08,681 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 00:03:08,682 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 00:03:08,682 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 00:03:08,682 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:03:08" (1/1) ... [2022-02-21 00:03:08,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 00:03:08,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:03:08,707 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-21 00:03:08,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-21 00:03:08,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 00:03:08,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 00:03:08,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 00:03:08,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 00:03:08,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 00:03:08,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 00:03:08,793 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 00:03:08,795 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 00:03:08,887 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 00:03:08,895 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 00:03:08,911 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-21 00:03:08,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 12:03:08 BoogieIcfgContainer [2022-02-21 00:03:08,913 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 00:03:08,914 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 00:03:08,914 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 00:03:08,916 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 00:03:08,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 12:03:08" (1/3) ... [2022-02-21 00:03:08,917 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52bb10c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 12:03:08, skipping insertion in model container [2022-02-21 00:03:08,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:03:08" (2/3) ... [2022-02-21 00:03:08,918 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52bb10c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 12:03:08, skipping insertion in model container [2022-02-21 00:03:08,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 12:03:08" (3/3) ... [2022-02-21 00:03:08,919 INFO L111 eAbstractionObserver]: Analyzing ICFG scopes4-1.c [2022-02-21 00:03:08,922 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 00:03:08,922 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2022-02-21 00:03:08,961 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 00:03:08,969 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-21 00:03:08,969 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-02-21 00:03:08,981 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 10 states have (on average 1.5) internal successors, (15), 15 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:08,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-21 00:03:08,985 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:03:08,986 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-21 00:03:08,986 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1 more)] === [2022-02-21 00:03:08,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:03:08,990 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-02-21 00:03:09,000 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:03:09,001 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044353660] [2022-02-21 00:03:09,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:09,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:03:09,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:09,134 INFO L290 TraceCheckUtils]: 0: Hoare triple {19#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1);~#arr~0.base, ~#arr~0.offset := 2, 0;call #Ultimate.allocInit(4096, 2);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#arr~0.base);~arr~1 := ~const~array~~LB~int~RB~int(); {21#(and (= (select |#valid| |~#arr~0.base|) (select |#valid| 2)) (= (select |#valid| |~#arr~0.base|) 1))} is VALID [2022-02-21 00:03:09,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#(and (= (select |#valid| |~#arr~0.base|) (select |#valid| 2)) (= (select |#valid| |~#arr~0.base|) 1))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret1#1.base, main_#t~ret1#1.offset, main_#t~nondet2#1, main_#t~mem3#1, main_~a~0#1.base, main_~a~0#1.offset;assume { :begin_inline_foo } true;havoc foo_#res#1.base, foo_#res#1.offset;havoc foo_#t~ret0#1.base, foo_#t~ret0#1.offset;assume { :begin_inline_foo2 } true;havoc foo2_#res#1.base, foo2_#res#1.offset; {21#(and (= (select |#valid| |~#arr~0.base|) (select |#valid| 2)) (= (select |#valid| |~#arr~0.base|) 1))} is VALID [2022-02-21 00:03:09,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#(and (= (select |#valid| |~#arr~0.base|) (select |#valid| 2)) (= (select |#valid| |~#arr~0.base|) 1))} assume !(1 == #valid[~#arr~0.base]); {20#false} is VALID [2022-02-21 00:03:09,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:03:09,137 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:03:09,138 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044353660] [2022-02-21 00:03:09,138 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044353660] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:03:09,138 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:03:09,139 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-02-21 00:03:09,140 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761453250] [2022-02-21 00:03:09,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:03:09,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-21 00:03:09,144 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:03:09,146 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:09,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:09,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:03:09,152 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:03:09,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:03:09,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:03:09,168 INFO L87 Difference]: Start difference. First operand has 16 states, 10 states have (on average 1.5) internal successors, (15), 15 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:09,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:09,206 INFO L93 Difference]: Finished difference Result 15 states and 14 transitions. [2022-02-21 00:03:09,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:03:09,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-21 00:03:09,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:03:09,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:09,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2022-02-21 00:03:09,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:09,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2022-02-21 00:03:09,217 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 15 transitions. [2022-02-21 00:03:09,245 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:09,250 INFO L225 Difference]: With dead ends: 15 [2022-02-21 00:03:09,250 INFO L226 Difference]: Without dead ends: 13 [2022-02-21 00:03:09,252 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:03:09,256 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 12 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:03:09,258 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 6 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:03:09,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-02-21 00:03:09,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-02-21 00:03:09,282 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:03:09,282 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 12 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:09,283 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 12 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:09,283 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 12 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:09,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:09,285 INFO L93 Difference]: Finished difference Result 13 states and 12 transitions. [2022-02-21 00:03:09,285 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 12 transitions. [2022-02-21 00:03:09,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:09,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:09,290 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 12 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 13 states. [2022-02-21 00:03:09,290 INFO L87 Difference]: Start difference. First operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 12 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 13 states. [2022-02-21 00:03:09,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:09,291 INFO L93 Difference]: Finished difference Result 13 states and 12 transitions. [2022-02-21 00:03:09,291 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 12 transitions. [2022-02-21 00:03:09,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:09,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:09,292 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:03:09,292 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:03:09,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 12 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:09,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 12 transitions. [2022-02-21 00:03:09,294 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 12 transitions. Word has length 3 [2022-02-21 00:03:09,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:03:09,294 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 12 transitions. [2022-02-21 00:03:09,294 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:09,294 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 12 transitions. [2022-02-21 00:03:09,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-21 00:03:09,295 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:03:09,295 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-21 00:03:09,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 00:03:09,295 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1 more)] === [2022-02-21 00:03:09,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:03:09,296 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-02-21 00:03:09,296 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:03:09,296 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683872386] [2022-02-21 00:03:09,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:09,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:03:09,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:09,339 INFO L290 TraceCheckUtils]: 0: Hoare triple {78#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1);~#arr~0.base, ~#arr~0.offset := 2, 0;call #Ultimate.allocInit(4096, 2);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#arr~0.base);~arr~1 := ~const~array~~LB~int~RB~int(); {80#(and (= (+ (- 4096) (select |#length| |~#arr~0.base|)) 0) (= |~#arr~0.offset| 0))} is VALID [2022-02-21 00:03:09,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {80#(and (= (+ (- 4096) (select |#length| |~#arr~0.base|)) 0) (= |~#arr~0.offset| 0))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret1#1.base, main_#t~ret1#1.offset, main_#t~nondet2#1, main_#t~mem3#1, main_~a~0#1.base, main_~a~0#1.offset;assume { :begin_inline_foo } true;havoc foo_#res#1.base, foo_#res#1.offset;havoc foo_#t~ret0#1.base, foo_#t~ret0#1.offset;assume { :begin_inline_foo2 } true;havoc foo2_#res#1.base, foo2_#res#1.offset; {80#(and (= (+ (- 4096) (select |#length| |~#arr~0.base|)) 0) (= |~#arr~0.offset| 0))} is VALID [2022-02-21 00:03:09,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {80#(and (= (+ (- 4096) (select |#length| |~#arr~0.base|)) 0) (= |~#arr~0.offset| 0))} assume !(4 + (776 + ~#arr~0.offset) <= #length[~#arr~0.base] && 0 <= 776 + ~#arr~0.offset); {79#false} is VALID [2022-02-21 00:03:09,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:03:09,341 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:03:09,341 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683872386] [2022-02-21 00:03:09,342 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683872386] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:03:09,342 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:03:09,342 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-02-21 00:03:09,342 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115000073] [2022-02-21 00:03:09,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:03:09,343 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-21 00:03:09,344 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:03:09,344 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:09,347 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:09,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:03:09,348 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:03:09,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:03:09,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:03:09,348 INFO L87 Difference]: Start difference. First operand 13 states and 12 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:09,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:09,363 INFO L93 Difference]: Finished difference Result 12 states and 11 transitions. [2022-02-21 00:03:09,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:03:09,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-21 00:03:09,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:03:09,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:09,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2022-02-21 00:03:09,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:09,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2022-02-21 00:03:09,365 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 12 transitions. [2022-02-21 00:03:09,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:09,377 INFO L225 Difference]: With dead ends: 12 [2022-02-21 00:03:09,377 INFO L226 Difference]: Without dead ends: 12 [2022-02-21 00:03:09,377 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:03:09,378 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 9 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:03:09,379 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 7 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:03:09,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-02-21 00:03:09,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-02-21 00:03:09,380 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:03:09,380 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand has 12 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 11 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:09,381 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand has 12 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 11 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:09,381 INFO L87 Difference]: Start difference. First operand 12 states. Second operand has 12 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 11 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:09,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:09,382 INFO L93 Difference]: Finished difference Result 12 states and 11 transitions. [2022-02-21 00:03:09,382 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 11 transitions. [2022-02-21 00:03:09,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:09,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:09,383 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 11 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states. [2022-02-21 00:03:09,383 INFO L87 Difference]: Start difference. First operand has 12 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 11 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states. [2022-02-21 00:03:09,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:09,384 INFO L93 Difference]: Finished difference Result 12 states and 11 transitions. [2022-02-21 00:03:09,384 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 11 transitions. [2022-02-21 00:03:09,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:09,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:09,384 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:03:09,384 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:03:09,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 11 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:09,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 11 transitions. [2022-02-21 00:03:09,385 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 11 transitions. Word has length 3 [2022-02-21 00:03:09,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:03:09,386 INFO L470 AbstractCegarLoop]: Abstraction has 12 states and 11 transitions. [2022-02-21 00:03:09,386 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:09,386 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 11 transitions. [2022-02-21 00:03:09,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-21 00:03:09,386 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:03:09,386 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:03:09,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 00:03:09,387 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1 more)] === [2022-02-21 00:03:09,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:03:09,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1803025956, now seen corresponding path program 1 times [2022-02-21 00:03:09,388 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:03:09,388 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850643579] [2022-02-21 00:03:09,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:09,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:03:09,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:09,430 INFO L290 TraceCheckUtils]: 0: Hoare triple {131#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1);~#arr~0.base, ~#arr~0.offset := 2, 0;call #Ultimate.allocInit(4096, 2);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#arr~0.base);~arr~1 := ~const~array~~LB~int~RB~int(); {131#true} is VALID [2022-02-21 00:03:09,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {131#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret1#1.base, main_#t~ret1#1.offset, main_#t~nondet2#1, main_#t~mem3#1, main_~a~0#1.base, main_~a~0#1.offset;assume { :begin_inline_foo } true;havoc foo_#res#1.base, foo_#res#1.offset;havoc foo_#t~ret0#1.base, foo_#t~ret0#1.offset;assume { :begin_inline_foo2 } true;havoc foo2_#res#1.base, foo2_#res#1.offset; {131#true} is VALID [2022-02-21 00:03:09,431 INFO L290 TraceCheckUtils]: 2: Hoare triple {131#true} SUMMARY for call write~int(13, ~#arr~0.base, 776 + ~#arr~0.offset, 4); srcloc: L6 {133#(= (select |#valid| |~#arr~0.base|) 1)} is VALID [2022-02-21 00:03:09,431 INFO L290 TraceCheckUtils]: 3: Hoare triple {133#(= (select |#valid| |~#arr~0.base|) 1)} foo2_#res#1.base, foo2_#res#1.offset := ~#arr~0.base, 4 + ~#arr~0.offset; {134#(= (select |#valid| |ULTIMATE.start_foo2_#res#1.base|) 1)} is VALID [2022-02-21 00:03:09,432 INFO L290 TraceCheckUtils]: 4: Hoare triple {134#(= (select |#valid| |ULTIMATE.start_foo2_#res#1.base|) 1)} foo_#t~ret0#1.base, foo_#t~ret0#1.offset := foo2_#res#1.base, foo2_#res#1.offset;assume { :end_inline_foo2 } true;foo_#res#1.base, foo_#res#1.offset := foo_#t~ret0#1.base, foo_#t~ret0#1.offset;havoc foo_#t~ret0#1.base, foo_#t~ret0#1.offset; {135#(= (select |#valid| |ULTIMATE.start_foo_#res#1.base|) 1)} is VALID [2022-02-21 00:03:09,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {135#(= (select |#valid| |ULTIMATE.start_foo_#res#1.base|) 1)} main_#t~ret1#1.base, main_#t~ret1#1.offset := foo_#res#1.base, foo_#res#1.offset;assume { :end_inline_foo } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret1#1.base, main_#t~ret1#1.offset;havoc main_#t~ret1#1.base, main_#t~ret1#1.offset;havoc main_#t~nondet2#1; {136#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) 1)} is VALID [2022-02-21 00:03:09,433 INFO L290 TraceCheckUtils]: 6: Hoare triple {136#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) 1)} assume !(1 == #valid[main_~a~0#1.base]); {132#false} is VALID [2022-02-21 00:03:09,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:03:09,433 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:03:09,433 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850643579] [2022-02-21 00:03:09,434 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850643579] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:03:09,434 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:03:09,434 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 00:03:09,434 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20371484] [2022-02-21 00:03:09,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:03:09,435 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-21 00:03:09,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:03:09,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:09,441 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:09,441 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 00:03:09,441 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:03:09,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 00:03:09,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-21 00:03:09,442 INFO L87 Difference]: Start difference. First operand 12 states and 11 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:09,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:09,498 INFO L93 Difference]: Finished difference Result 11 states and 10 transitions. [2022-02-21 00:03:09,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 00:03:09,498 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-21 00:03:09,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:03:09,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:09,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2022-02-21 00:03:09,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:09,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2022-02-21 00:03:09,500 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 11 transitions. [2022-02-21 00:03:09,509 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:09,510 INFO L225 Difference]: With dead ends: 11 [2022-02-21 00:03:09,510 INFO L226 Difference]: Without dead ends: 11 [2022-02-21 00:03:09,510 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-02-21 00:03:09,511 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 23 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:03:09,511 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 2 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:03:09,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-02-21 00:03:09,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-02-21 00:03:09,513 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:03:09,513 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand has 11 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 10 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:09,513 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand has 11 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 10 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:09,513 INFO L87 Difference]: Start difference. First operand 11 states. Second operand has 11 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 10 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:09,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:09,514 INFO L93 Difference]: Finished difference Result 11 states and 10 transitions. [2022-02-21 00:03:09,514 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 10 transitions. [2022-02-21 00:03:09,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:09,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:09,515 INFO L74 IsIncluded]: Start isIncluded. First operand has 11 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 10 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 11 states. [2022-02-21 00:03:09,515 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 10 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 11 states. [2022-02-21 00:03:09,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:09,515 INFO L93 Difference]: Finished difference Result 11 states and 10 transitions. [2022-02-21 00:03:09,516 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 10 transitions. [2022-02-21 00:03:09,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:09,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:09,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:03:09,516 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:03:09,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 10 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:09,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 10 transitions. [2022-02-21 00:03:09,517 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 10 transitions. Word has length 7 [2022-02-21 00:03:09,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:03:09,517 INFO L470 AbstractCegarLoop]: Abstraction has 11 states and 10 transitions. [2022-02-21 00:03:09,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:09,517 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 10 transitions. [2022-02-21 00:03:09,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-21 00:03:09,518 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:03:09,518 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:03:09,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-21 00:03:09,518 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1 more)] === [2022-02-21 00:03:09,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:03:09,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1803025957, now seen corresponding path program 1 times [2022-02-21 00:03:09,519 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:03:09,519 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261506364] [2022-02-21 00:03:09,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:09,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:03:09,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:09,623 INFO L290 TraceCheckUtils]: 0: Hoare triple {189#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1);~#arr~0.base, ~#arr~0.offset := 2, 0;call #Ultimate.allocInit(4096, 2);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#arr~0.base);~arr~1 := ~const~array~~LB~int~RB~int(); {191#(and (= |~#arr~0.offset| 0) (= 4096 (select |#length| 2)) (= 2 |~#arr~0.base|))} is VALID [2022-02-21 00:03:09,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {191#(and (= |~#arr~0.offset| 0) (= 4096 (select |#length| 2)) (= 2 |~#arr~0.base|))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret1#1.base, main_#t~ret1#1.offset, main_#t~nondet2#1, main_#t~mem3#1, main_~a~0#1.base, main_~a~0#1.offset;assume { :begin_inline_foo } true;havoc foo_#res#1.base, foo_#res#1.offset;havoc foo_#t~ret0#1.base, foo_#t~ret0#1.offset;assume { :begin_inline_foo2 } true;havoc foo2_#res#1.base, foo2_#res#1.offset; {191#(and (= |~#arr~0.offset| 0) (= 4096 (select |#length| 2)) (= 2 |~#arr~0.base|))} is VALID [2022-02-21 00:03:09,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {191#(and (= |~#arr~0.offset| 0) (= 4096 (select |#length| 2)) (= 2 |~#arr~0.base|))} SUMMARY for call write~int(13, ~#arr~0.base, 776 + ~#arr~0.offset, 4); srcloc: L6 {191#(and (= |~#arr~0.offset| 0) (= 4096 (select |#length| 2)) (= 2 |~#arr~0.base|))} is VALID [2022-02-21 00:03:09,625 INFO L290 TraceCheckUtils]: 3: Hoare triple {191#(and (= |~#arr~0.offset| 0) (= 4096 (select |#length| 2)) (= 2 |~#arr~0.base|))} foo2_#res#1.base, foo2_#res#1.offset := ~#arr~0.base, 4 + ~#arr~0.offset; {192#(and (= 4096 (select |#length| 2)) (<= |ULTIMATE.start_foo2_#res#1.offset| 4) (= 2 |ULTIMATE.start_foo2_#res#1.base|) (<= 4 |ULTIMATE.start_foo2_#res#1.offset|))} is VALID [2022-02-21 00:03:09,626 INFO L290 TraceCheckUtils]: 4: Hoare triple {192#(and (= 4096 (select |#length| 2)) (<= |ULTIMATE.start_foo2_#res#1.offset| 4) (= 2 |ULTIMATE.start_foo2_#res#1.base|) (<= 4 |ULTIMATE.start_foo2_#res#1.offset|))} foo_#t~ret0#1.base, foo_#t~ret0#1.offset := foo2_#res#1.base, foo2_#res#1.offset;assume { :end_inline_foo2 } true;foo_#res#1.base, foo_#res#1.offset := foo_#t~ret0#1.base, foo_#t~ret0#1.offset;havoc foo_#t~ret0#1.base, foo_#t~ret0#1.offset; {193#(and (= 2 |ULTIMATE.start_foo_#res#1.base|) (= 4096 (select |#length| 2)) (<= |ULTIMATE.start_foo_#res#1.offset| 4) (<= 4 |ULTIMATE.start_foo_#res#1.offset|))} is VALID [2022-02-21 00:03:09,626 INFO L290 TraceCheckUtils]: 5: Hoare triple {193#(and (= 2 |ULTIMATE.start_foo_#res#1.base|) (= 4096 (select |#length| 2)) (<= |ULTIMATE.start_foo_#res#1.offset| 4) (<= 4 |ULTIMATE.start_foo_#res#1.offset|))} main_#t~ret1#1.base, main_#t~ret1#1.offset := foo_#res#1.base, foo_#res#1.offset;assume { :end_inline_foo } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret1#1.base, main_#t~ret1#1.offset;havoc main_#t~ret1#1.base, main_#t~ret1#1.offset;havoc main_#t~nondet2#1; {194#(and (<= 4 |ULTIMATE.start_main_~a~0#1.offset|) (<= |ULTIMATE.start_main_~a~0#1.offset| 4) (= (+ (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (- 4096)) 0))} is VALID [2022-02-21 00:03:09,627 INFO L290 TraceCheckUtils]: 6: Hoare triple {194#(and (<= 4 |ULTIMATE.start_main_~a~0#1.offset|) (<= |ULTIMATE.start_main_~a~0#1.offset| 4) (= (+ (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (- 4096)) 0))} assume !(4 + main_~a~0#1.offset <= #length[main_~a~0#1.base] && 0 <= main_~a~0#1.offset); {190#false} is VALID [2022-02-21 00:03:09,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:03:09,627 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:03:09,627 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261506364] [2022-02-21 00:03:09,628 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261506364] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:03:09,628 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:03:09,628 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 00:03:09,628 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252293522] [2022-02-21 00:03:09,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:03:09,628 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-21 00:03:09,629 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:03:09,629 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:09,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:09,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 00:03:09,635 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:03:09,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 00:03:09,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-21 00:03:09,636 INFO L87 Difference]: Start difference. First operand 11 states and 10 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:09,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:09,724 INFO L93 Difference]: Finished difference Result 10 states and 9 transitions. [2022-02-21 00:03:09,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 00:03:09,725 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-21 00:03:09,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:03:09,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:09,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2022-02-21 00:03:09,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:09,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2022-02-21 00:03:09,726 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 10 transitions. [2022-02-21 00:03:09,736 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:09,737 INFO L225 Difference]: With dead ends: 10 [2022-02-21 00:03:09,737 INFO L226 Difference]: Without dead ends: 10 [2022-02-21 00:03:09,737 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-02-21 00:03:09,738 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 18 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:03:09,738 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 4 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:03:09,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2022-02-21 00:03:09,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-02-21 00:03:09,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:03:09,739 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states. Second operand has 10 states, 9 states have (on average 1.0) internal successors, (9), 9 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:09,740 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand has 10 states, 9 states have (on average 1.0) internal successors, (9), 9 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:09,740 INFO L87 Difference]: Start difference. First operand 10 states. Second operand has 10 states, 9 states have (on average 1.0) internal successors, (9), 9 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:09,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:09,740 INFO L93 Difference]: Finished difference Result 10 states and 9 transitions. [2022-02-21 00:03:09,741 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 9 transitions. [2022-02-21 00:03:09,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:09,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:09,741 INFO L74 IsIncluded]: Start isIncluded. First operand has 10 states, 9 states have (on average 1.0) internal successors, (9), 9 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 10 states. [2022-02-21 00:03:09,741 INFO L87 Difference]: Start difference. First operand has 10 states, 9 states have (on average 1.0) internal successors, (9), 9 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 10 states. [2022-02-21 00:03:09,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:09,742 INFO L93 Difference]: Finished difference Result 10 states and 9 transitions. [2022-02-21 00:03:09,742 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 9 transitions. [2022-02-21 00:03:09,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:09,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:09,742 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:03:09,742 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:03:09,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.0) internal successors, (9), 9 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:09,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 9 transitions. [2022-02-21 00:03:09,743 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 9 transitions. Word has length 7 [2022-02-21 00:03:09,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:03:09,743 INFO L470 AbstractCegarLoop]: Abstraction has 10 states and 9 transitions. [2022-02-21 00:03:09,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:09,744 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 9 transitions. [2022-02-21 00:03:09,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-21 00:03:09,744 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:03:09,744 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:03:09,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-21 00:03:09,745 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 1 more)] === [2022-02-21 00:03:09,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:03:09,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1836122917, now seen corresponding path program 1 times [2022-02-21 00:03:09,745 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:03:09,745 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876123017] [2022-02-21 00:03:09,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:09,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:03:09,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:09,768 INFO L290 TraceCheckUtils]: 0: Hoare triple {243#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(4, 1);call write~init~int(37, 1, 0, 1);call write~init~int(100, 1, 1, 1);call write~init~int(10, 1, 2, 1);call write~init~int(0, 1, 3, 1);~#arr~0.base, ~#arr~0.offset := 2, 0;call #Ultimate.allocInit(4096, 2);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#arr~0.base);~arr~1 := ~const~array~~LB~int~RB~int(); {243#true} is VALID [2022-02-21 00:03:09,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {243#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret1#1.base, main_#t~ret1#1.offset, main_#t~nondet2#1, main_#t~mem3#1, main_~a~0#1.base, main_~a~0#1.offset;assume { :begin_inline_foo } true;havoc foo_#res#1.base, foo_#res#1.offset;havoc foo_#t~ret0#1.base, foo_#t~ret0#1.offset;assume { :begin_inline_foo2 } true;havoc foo2_#res#1.base, foo2_#res#1.offset; {245#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-21 00:03:09,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {245#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} SUMMARY for call write~int(13, ~#arr~0.base, 776 + ~#arr~0.offset, 4); srcloc: L6 {245#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-21 00:03:09,770 INFO L290 TraceCheckUtils]: 3: Hoare triple {245#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} foo2_#res#1.base, foo2_#res#1.offset := ~#arr~0.base, 4 + ~#arr~0.offset; {245#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-21 00:03:09,771 INFO L290 TraceCheckUtils]: 4: Hoare triple {245#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} foo_#t~ret0#1.base, foo_#t~ret0#1.offset := foo2_#res#1.base, foo2_#res#1.offset;assume { :end_inline_foo2 } true;foo_#res#1.base, foo_#res#1.offset := foo_#t~ret0#1.base, foo_#t~ret0#1.offset;havoc foo_#t~ret0#1.base, foo_#t~ret0#1.offset; {245#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-21 00:03:09,771 INFO L290 TraceCheckUtils]: 5: Hoare triple {245#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} main_#t~ret1#1.base, main_#t~ret1#1.offset := foo_#res#1.base, foo_#res#1.offset;assume { :end_inline_foo } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret1#1.base, main_#t~ret1#1.offset;havoc main_#t~ret1#1.base, main_#t~ret1#1.offset;havoc main_#t~nondet2#1; {245#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-21 00:03:09,772 INFO L290 TraceCheckUtils]: 6: Hoare triple {245#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} SUMMARY for call main_#t~mem3#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4); srcloc: L18 {245#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-21 00:03:09,772 INFO L290 TraceCheckUtils]: 7: Hoare triple {245#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} havoc main_#t~mem3#1;main_#res#1 := 0; {245#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-21 00:03:09,772 INFO L290 TraceCheckUtils]: 8: Hoare triple {245#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume !(#valid == main_old_#valid#1); {244#false} is VALID [2022-02-21 00:03:09,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:03:09,773 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:03:09,773 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876123017] [2022-02-21 00:03:09,773 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876123017] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:03:09,773 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:03:09,773 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 00:03:09,773 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741355343] [2022-02-21 00:03:09,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:03:09,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-21 00:03:09,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:03:09,774 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:09,781 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:09,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:03:09,781 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:03:09,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:03:09,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:03:09,782 INFO L87 Difference]: Start difference. First operand 10 states and 9 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:09,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:09,789 INFO L93 Difference]: Finished difference Result 9 states and 8 transitions. [2022-02-21 00:03:09,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:03:09,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-21 00:03:09,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:03:09,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:09,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2022-02-21 00:03:09,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:09,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2022-02-21 00:03:09,791 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 9 transitions. [2022-02-21 00:03:09,797 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:09,797 INFO L225 Difference]: With dead ends: 9 [2022-02-21 00:03:09,797 INFO L226 Difference]: Without dead ends: 0 [2022-02-21 00:03:09,797 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:03:09,798 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:03:09,798 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:03:09,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-21 00:03:09,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-21 00:03:09,799 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:03:09,799 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:09,799 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:09,800 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:09,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:09,800 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 00:03:09,800 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 00:03:09,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:09,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:09,800 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-21 00:03:09,800 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-21 00:03:09,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:09,801 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 00:03:09,801 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 00:03:09,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:09,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:09,801 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:03:09,801 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:03:09,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:09,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 00:03:09,801 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 9 [2022-02-21 00:03:09,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:03:09,802 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 00:03:09,802 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:09,802 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 00:03:09,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:09,804 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATION (4 of 5 remaining) [2022-02-21 00:03:09,804 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATION (3 of 5 remaining) [2022-02-21 00:03:09,804 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATION (2 of 5 remaining) [2022-02-21 00:03:09,805 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATION (1 of 5 remaining) [2022-02-21 00:03:09,805 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2022-02-21 00:03:09,805 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-21 00:03:09,807 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-02-21 00:03:09,808 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-21 00:03:09,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.02 12:03:09 BoogieIcfgContainer [2022-02-21 00:03:09,810 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-21 00:03:09,811 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 00:03:09,811 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 00:03:09,811 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 00:03:09,812 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 12:03:08" (3/4) ... [2022-02-21 00:03:09,814 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-21 00:03:09,820 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2022-02-21 00:03:09,820 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-21 00:03:09,820 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-02-21 00:03:09,821 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-21 00:03:09,838 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-21 00:03:09,838 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 00:03:09,839 INFO L158 Benchmark]: Toolchain (without parser) took 1400.56ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 68.0MB in the beginning and 79.8MB in the end (delta: -11.8MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. [2022-02-21 00:03:09,839 INFO L158 Benchmark]: CDTParser took 1.70ms. Allocated memory is still 100.7MB. Free memory was 57.5MB in the beginning and 57.5MB in the end (delta: 43.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 00:03:09,839 INFO L158 Benchmark]: CACSL2BoogieTranslator took 188.13ms. Allocated memory is still 100.7MB. Free memory was 67.7MB in the beginning and 76.2MB in the end (delta: -8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 00:03:09,839 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.70ms. Allocated memory is still 100.7MB. Free memory was 76.2MB in the beginning and 74.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 00:03:09,840 INFO L158 Benchmark]: Boogie Preprocessor took 24.44ms. Allocated memory is still 100.7MB. Free memory was 74.4MB in the beginning and 73.7MB in the end (delta: 734.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 00:03:09,840 INFO L158 Benchmark]: RCFGBuilder took 231.66ms. Allocated memory is still 100.7MB. Free memory was 73.7MB in the beginning and 62.8MB in the end (delta: 10.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-21 00:03:09,840 INFO L158 Benchmark]: TraceAbstraction took 896.45ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 62.4MB in the beginning and 81.9MB in the end (delta: -19.5MB). Peak memory consumption was 2.4MB. Max. memory is 16.1GB. [2022-02-21 00:03:09,840 INFO L158 Benchmark]: Witness Printer took 26.97ms. Allocated memory is still 121.6MB. Free memory was 81.9MB in the beginning and 79.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 00:03:09,841 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.70ms. Allocated memory is still 100.7MB. Free memory was 57.5MB in the beginning and 57.5MB in the end (delta: 43.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 188.13ms. Allocated memory is still 100.7MB. Free memory was 67.7MB in the beginning and 76.2MB in the end (delta: -8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.70ms. Allocated memory is still 100.7MB. Free memory was 76.2MB in the beginning and 74.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.44ms. Allocated memory is still 100.7MB. Free memory was 74.4MB in the beginning and 73.7MB in the end (delta: 734.0kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 231.66ms. Allocated memory is still 100.7MB. Free memory was 73.7MB in the beginning and 62.8MB in the end (delta: 10.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 896.45ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 62.4MB in the beginning and 81.9MB in the end (delta: -19.5MB). Peak memory consumption was 2.4MB. Max. memory is 16.1GB. * Witness Printer took 26.97ms. Allocated memory is still 121.6MB. Free memory was 81.9MB in the beginning and 79.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 6]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 6]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 62 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 62 mSDsluCounter, 25 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 52 IncrementalHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 25 mSDtfsCounter, 52 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=0, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 29 NumberOfCodeBlocks, 29 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 24 ConstructedInterpolants, 0 QuantifiedInterpolants, 172 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-02-21 00:03:09,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE