./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext3/scopes4-2.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-2.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 d3e64a3bb1136adaedbe48fbb8a8a2a2e8de15e4ab22e021abc9c36f399fb6cc --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 00:03:09,027 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 00:03:09,034 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 00:03:09,063 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 00:03:09,063 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 00:03:09,064 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 00:03:09,065 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 00:03:09,067 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 00:03:09,068 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 00:03:09,068 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 00:03:09,069 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 00:03:09,071 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 00:03:09,071 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 00:03:09,075 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 00:03:09,077 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 00:03:09,079 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 00:03:09,079 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 00:03:09,081 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 00:03:09,084 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 00:03:09,086 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 00:03:09,089 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 00:03:09,090 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 00:03:09,091 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 00:03:09,092 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 00:03:09,095 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 00:03:09,097 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 00:03:09,098 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 00:03:09,099 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 00:03:09,099 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 00:03:09,100 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 00:03:09,100 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 00:03:09,101 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 00:03:09,102 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 00:03:09,103 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 00:03:09,104 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 00:03:09,104 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 00:03:09,105 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 00:03:09,105 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 00:03:09,105 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 00:03:09,106 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 00:03:09,107 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 00:03:09,107 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:09,133 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 00:03:09,133 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 00:03:09,133 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 00:03:09,133 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 00:03:09,134 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 00:03:09,134 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 00:03:09,135 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 00:03:09,135 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 00:03:09,135 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 00:03:09,135 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 00:03:09,136 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 00:03:09,136 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 00:03:09,136 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 00:03:09,136 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 00:03:09,137 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 00:03:09,137 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-21 00:03:09,137 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-21 00:03:09,137 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-21 00:03:09,137 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 00:03:09,137 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-21 00:03:09,137 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 00:03:09,138 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 00:03:09,138 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 00:03:09,138 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 00:03:09,138 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 00:03:09,138 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 00:03:09,138 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 00:03:09,139 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 00:03:09,139 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 00:03:09,139 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 00:03:09,139 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 -> d3e64a3bb1136adaedbe48fbb8a8a2a2e8de15e4ab22e021abc9c36f399fb6cc [2022-02-21 00:03:09,375 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 00:03:09,398 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 00:03:09,400 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 00:03:09,401 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 00:03:09,402 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 00:03:09,403 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext3/scopes4-2.c [2022-02-21 00:03:09,473 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1334e9c6e/38177c4326d24473a2d775ca4bffe006/FLAG3ae9c8399 [2022-02-21 00:03:09,782 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 00:03:09,782 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/scopes4-2.c [2022-02-21 00:03:09,789 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1334e9c6e/38177c4326d24473a2d775ca4bffe006/FLAG3ae9c8399 [2022-02-21 00:03:10,224 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1334e9c6e/38177c4326d24473a2d775ca4bffe006 [2022-02-21 00:03:10,226 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 00:03:10,228 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 00:03:10,230 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 00:03:10,230 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 00:03:10,233 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 00:03:10,233 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 12:03:10" (1/1) ... [2022-02-21 00:03:10,234 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dc254f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:03:10, skipping insertion in model container [2022-02-21 00:03:10,234 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 12:03:10" (1/1) ... [2022-02-21 00:03:10,239 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 00:03:10,248 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 00:03:10,364 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 00:03:10,380 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 00:03:10,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 00:03:10,406 INFO L208 MainTranslator]: Completed translation [2022-02-21 00:03:10,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:03:10 WrapperNode [2022-02-21 00:03:10,407 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 00:03:10,408 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 00:03:10,409 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 00:03:10,409 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 00:03:10,416 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:10" (1/1) ... [2022-02-21 00:03:10,421 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:10" (1/1) ... [2022-02-21 00:03:10,437 INFO L137 Inliner]: procedures = 12, calls = 14, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 31 [2022-02-21 00:03:10,438 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 00:03:10,439 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 00:03:10,439 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 00:03:10,439 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 00:03:10,443 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:10" (1/1) ... [2022-02-21 00:03:10,444 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:10" (1/1) ... [2022-02-21 00:03:10,453 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:10" (1/1) ... [2022-02-21 00:03:10,453 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:10" (1/1) ... [2022-02-21 00:03:10,465 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:10" (1/1) ... [2022-02-21 00:03:10,466 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:10" (1/1) ... [2022-02-21 00:03:10,467 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:10" (1/1) ... [2022-02-21 00:03:10,468 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 00:03:10,472 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 00:03:10,473 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 00:03:10,473 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 00:03:10,474 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:03:10" (1/1) ... [2022-02-21 00:03:10,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 00:03:10,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:03:10,498 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:10,506 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:10,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 00:03:10,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 00:03:10,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 00:03:10,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 00:03:10,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 00:03:10,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 00:03:10,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 00:03:10,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 00:03:10,598 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 00:03:10,599 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 00:03:10,741 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 00:03:10,745 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 00:03:10,746 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-21 00:03:10,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 12:03:10 BoogieIcfgContainer [2022-02-21 00:03:10,747 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 00:03:10,748 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 00:03:10,748 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 00:03:10,750 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 00:03:10,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 12:03:10" (1/3) ... [2022-02-21 00:03:10,778 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f602d63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 12:03:10, skipping insertion in model container [2022-02-21 00:03:10,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:03:10" (2/3) ... [2022-02-21 00:03:10,779 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f602d63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 12:03:10, skipping insertion in model container [2022-02-21 00:03:10,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 12:03:10" (3/3) ... [2022-02-21 00:03:10,781 INFO L111 eAbstractionObserver]: Analyzing ICFG scopes4-2.c [2022-02-21 00:03:10,784 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 00:03:10,785 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2022-02-21 00:03:10,822 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 00:03:10,828 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:10,828 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-02-21 00:03:10,842 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:10,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-21 00:03:10,850 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:03:10,851 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-21 00:03:10,851 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:10,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:03:10,856 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-02-21 00:03:10,862 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:03:10,862 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223725234] [2022-02-21 00:03:10,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:10,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:03:10,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:11,024 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); {19#true} is VALID [2022-02-21 00:03:11,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {19#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, foo_~arr~1#1;havoc foo_~arr~1#1;assume { :begin_inline_foo2 } true;havoc foo2_#res#1.base, foo2_#res#1.offset;havoc foo2_~#arr~0#1.base, foo2_~#arr~0#1.offset;call foo2_~#arr~0#1.base, foo2_~#arr~0#1.offset := #Ultimate.allocOnStack(4096); {21#(= (select |#valid| |ULTIMATE.start_foo2_~#arr~0#1.base|) 1)} is VALID [2022-02-21 00:03:11,029 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#(= (select |#valid| |ULTIMATE.start_foo2_~#arr~0#1.base|) 1)} assume !(1 == #valid[foo2_~#arr~0#1.base]); {20#false} is VALID [2022-02-21 00:03:11,030 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:11,030 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:03:11,030 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223725234] [2022-02-21 00:03:11,031 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223725234] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:03:11,031 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:03:11,031 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 00:03:11,032 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540164492] [2022-02-21 00:03:11,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:03:11,036 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 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:11,037 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:03:11,039 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), 3 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:11,046 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:11,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:03:11,047 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:03:11,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:03:11,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:03:11,066 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), 3 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:11,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:11,108 INFO L93 Difference]: Finished difference Result 15 states and 14 transitions. [2022-02-21 00:03:11,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:03:11,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 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:11,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:03:11,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 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:11,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2022-02-21 00:03:11,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 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:11,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2022-02-21 00:03:11,117 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 15 transitions. [2022-02-21 00:03:11,138 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:11,146 INFO L225 Difference]: With dead ends: 15 [2022-02-21 00:03:11,146 INFO L226 Difference]: Without dead ends: 13 [2022-02-21 00:03:11,148 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:11,150 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:03:11,151 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 16 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:03:11,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-02-21 00:03:11,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-02-21 00:03:11,172 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:03:11,172 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:11,173 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:11,173 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:11,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:11,175 INFO L93 Difference]: Finished difference Result 13 states and 12 transitions. [2022-02-21 00:03:11,176 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 12 transitions. [2022-02-21 00:03:11,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:11,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:11,177 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:11,178 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:11,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:11,182 INFO L93 Difference]: Finished difference Result 13 states and 12 transitions. [2022-02-21 00:03:11,182 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 12 transitions. [2022-02-21 00:03:11,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:11,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:11,183 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:03:11,183 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:03:11,183 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:11,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 12 transitions. [2022-02-21 00:03:11,185 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 12 transitions. Word has length 3 [2022-02-21 00:03:11,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:03:11,186 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 12 transitions. [2022-02-21 00:03:11,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 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:11,187 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 12 transitions. [2022-02-21 00:03:11,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-21 00:03:11,187 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:03:11,188 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-21 00:03:11,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 00:03:11,188 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:11,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:03:11,190 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-02-21 00:03:11,191 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:03:11,191 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140001825] [2022-02-21 00:03:11,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:11,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:03:11,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:11,258 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); {78#true} is VALID [2022-02-21 00:03:11,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {78#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, foo_~arr~1#1;havoc foo_~arr~1#1;assume { :begin_inline_foo2 } true;havoc foo2_#res#1.base, foo2_#res#1.offset;havoc foo2_~#arr~0#1.base, foo2_~#arr~0#1.offset;call foo2_~#arr~0#1.base, foo2_~#arr~0#1.offset := #Ultimate.allocOnStack(4096); {80#(and (= (+ (- 4096) (select |#length| |ULTIMATE.start_foo2_~#arr~0#1.base|)) 0) (= |ULTIMATE.start_foo2_~#arr~0#1.offset| 0))} is VALID [2022-02-21 00:03:11,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {80#(and (= (+ (- 4096) (select |#length| |ULTIMATE.start_foo2_~#arr~0#1.base|)) 0) (= |ULTIMATE.start_foo2_~#arr~0#1.offset| 0))} assume !(4 + (776 + foo2_~#arr~0#1.offset) <= #length[foo2_~#arr~0#1.base] && 0 <= 776 + foo2_~#arr~0#1.offset); {79#false} is VALID [2022-02-21 00:03:11,261 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:11,261 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:03:11,262 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140001825] [2022-02-21 00:03:11,263 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140001825] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:03:11,264 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:03:11,264 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 00:03:11,264 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025638328] [2022-02-21 00:03:11,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:03:11,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 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:11,266 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:03:11,267 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), 3 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:11,270 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:11,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:03:11,271 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:03:11,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:03:11,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:03:11,272 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), 3 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:11,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:11,290 INFO L93 Difference]: Finished difference Result 12 states and 11 transitions. [2022-02-21 00:03:11,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:03:11,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 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:11,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:03:11,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 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:11,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2022-02-21 00:03:11,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 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:11,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2022-02-21 00:03:11,292 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 12 transitions. [2022-02-21 00:03:11,302 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:11,303 INFO L225 Difference]: With dead ends: 12 [2022-02-21 00:03:11,303 INFO L226 Difference]: Without dead ends: 12 [2022-02-21 00:03:11,303 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:11,304 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 1 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:03:11,305 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 14 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:03:11,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-02-21 00:03:11,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-02-21 00:03:11,306 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:03:11,307 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:11,307 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:11,307 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:11,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:11,308 INFO L93 Difference]: Finished difference Result 12 states and 11 transitions. [2022-02-21 00:03:11,308 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 11 transitions. [2022-02-21 00:03:11,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:11,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:11,309 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:11,309 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:11,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:11,310 INFO L93 Difference]: Finished difference Result 12 states and 11 transitions. [2022-02-21 00:03:11,310 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 11 transitions. [2022-02-21 00:03:11,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:11,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:11,310 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:03:11,311 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:03:11,311 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:11,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 11 transitions. [2022-02-21 00:03:11,314 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 11 transitions. Word has length 3 [2022-02-21 00:03:11,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:03:11,314 INFO L470 AbstractCegarLoop]: Abstraction has 12 states and 11 transitions. [2022-02-21 00:03:11,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 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:11,314 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 11 transitions. [2022-02-21 00:03:11,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-21 00:03:11,315 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:03:11,315 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:03:11,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 00:03:11,316 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:11,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:03:11,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1803025956, now seen corresponding path program 1 times [2022-02-21 00:03:11,317 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:03:11,317 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947563277] [2022-02-21 00:03:11,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:11,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:03:11,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 00:03:11,337 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 00:03:11,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 00:03:11,364 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 00:03:11,364 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-21 00:03:11,365 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2REQUIRES_VIOLATION (4 of 5 remaining) [2022-02-21 00:03:11,367 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (3 of 5 remaining) [2022-02-21 00:03:11,367 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (2 of 5 remaining) [2022-02-21 00:03:11,367 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (1 of 5 remaining) [2022-02-21 00:03:11,367 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2022-02-21 00:03:11,368 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-21 00:03:11,370 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-21 00:03:11,372 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-21 00:03:11,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.02 12:03:11 BoogieIcfgContainer [2022-02-21 00:03:11,384 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-21 00:03:11,385 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 00:03:11,385 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 00:03:11,385 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 00:03:11,385 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:10" (3/4) ... [2022-02-21 00:03:11,387 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-02-21 00:03:11,407 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-21 00:03:11,407 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 00:03:11,408 INFO L158 Benchmark]: Toolchain (without parser) took 1180.22ms. Allocated memory was 94.4MB in the beginning and 119.5MB in the end (delta: 25.2MB). Free memory was 61.9MB in the beginning and 68.7MB in the end (delta: -6.7MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2022-02-21 00:03:11,409 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 94.4MB. Free memory was 49.2MB in the beginning and 49.2MB in the end (delta: 45.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 00:03:11,409 INFO L158 Benchmark]: CACSL2BoogieTranslator took 177.52ms. Allocated memory is still 94.4MB. Free memory was 61.8MB in the beginning and 71.0MB in the end (delta: -9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 00:03:11,409 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.58ms. Allocated memory is still 94.4MB. Free memory was 71.0MB in the beginning and 69.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 00:03:11,409 INFO L158 Benchmark]: Boogie Preprocessor took 33.10ms. Allocated memory is still 94.4MB. Free memory was 69.4MB in the beginning and 68.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 00:03:11,410 INFO L158 Benchmark]: RCFGBuilder took 274.67ms. Allocated memory is still 94.4MB. Free memory was 68.2MB in the beginning and 57.9MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 00:03:11,410 INFO L158 Benchmark]: TraceAbstraction took 636.63ms. Allocated memory was 94.4MB in the beginning and 119.5MB in the end (delta: 25.2MB). Free memory was 57.4MB in the beginning and 70.2MB in the end (delta: -12.8MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. [2022-02-21 00:03:11,410 INFO L158 Benchmark]: Witness Printer took 22.63ms. Allocated memory is still 119.5MB. Free memory was 70.2MB in the beginning and 68.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 00:03:11,412 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 0.16ms. Allocated memory is still 94.4MB. Free memory was 49.2MB in the beginning and 49.2MB in the end (delta: 45.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 177.52ms. Allocated memory is still 94.4MB. Free memory was 61.8MB in the beginning and 71.0MB in the end (delta: -9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.58ms. Allocated memory is still 94.4MB. Free memory was 71.0MB in the beginning and 69.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.10ms. Allocated memory is still 94.4MB. Free memory was 69.4MB in the beginning and 68.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 274.67ms. Allocated memory is still 94.4MB. Free memory was 68.2MB in the beginning and 57.9MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 636.63ms. Allocated memory was 94.4MB in the beginning and 119.5MB in the end (delta: 25.2MB). Free memory was 57.4MB in the beginning and 70.2MB in the end (delta: -12.8MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. * Witness Printer took 22.63ms. Allocated memory is still 119.5MB. Free memory was 70.2MB in the beginning and 68.7MB in the end (delta: 1.5MB). 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 - CounterExampleResult [Line: 18]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L17] CALL, EXPR foo() [L12] int arr[123]; [L13] CALL, EXPR foo2() [L5] int arr[1024]; VAL [arr={5:0}] [L6] arr[194] = 13 VAL [arr={5:0}] [L7] return arr + 1; [L7] return arr + 1; VAL [\result={5:4}] [L13] RET, EXPR foo2() [L13] return foo2(); [L17] RET, EXPR foo() [L17] int *a = foo(); [L18] \read(*a) - UnprovableResult [Line: 6]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 6]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 16]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15 IncrementalHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 20 mSDtfsCounter, 15 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=0, InterpolantAutomatonStates: 6, 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 13 NumberOfCodeBlocks, 13 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 18 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-02-21 00:03:11,439 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)