./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memsetNonZero2.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/ldv-memsafety/memsetNonZero2.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 6c425285de916f5b42953c25151c39a4c727f5e6c15942a1f84cb765e683b1f9 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:53:40,182 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:53:40,184 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:53:40,212 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:53:40,212 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:53:40,215 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:53:40,216 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:53:40,220 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:53:40,221 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:53:40,222 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:53:40,223 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:53:40,224 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:53:40,224 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:53:40,229 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:53:40,230 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:53:40,232 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:53:40,235 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:53:40,236 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:53:40,237 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:53:40,239 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:53:40,243 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:53:40,243 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:53:40,244 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:53:40,245 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:53:40,246 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:53:40,249 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:53:40,249 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:53:40,250 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:53:40,251 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:53:40,251 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:53:40,251 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:53:40,252 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:53:40,253 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:53:40,254 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:53:40,255 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:53:40,256 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:53:40,256 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:53:40,256 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:53:40,256 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:53:40,257 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:53:40,257 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:53:40,258 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-02-20 23:53:40,282 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:53:40,283 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:53:40,283 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:53:40,283 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:53:40,284 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:53:40,284 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:53:40,285 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:53:40,285 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:53:40,285 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:53:40,285 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:53:40,286 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:53:40,286 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:53:40,286 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:53:40,286 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:53:40,287 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:53:40,287 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:53:40,287 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:53:40,287 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:53:40,287 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:53:40,287 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:53:40,288 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:53:40,288 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:53:40,288 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:53:40,288 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:53:40,288 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:53:40,289 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:53:40,289 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:53:40,290 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:53:40,291 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:53:40,291 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:53:40,291 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 -> 6c425285de916f5b42953c25151c39a4c727f5e6c15942a1f84cb765e683b1f9 [2022-02-20 23:53:40,471 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:53:40,489 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:53:40,491 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:53:40,492 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:53:40,493 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:53:40,494 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memsetNonZero2.c [2022-02-20 23:53:40,554 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34a9c0742/cd3410d9832e4abaa154334d0fd0367a/FLAGdeec5ccbb [2022-02-20 23:53:40,926 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:53:40,926 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memsetNonZero2.c [2022-02-20 23:53:40,930 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34a9c0742/cd3410d9832e4abaa154334d0fd0367a/FLAGdeec5ccbb [2022-02-20 23:53:40,939 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34a9c0742/cd3410d9832e4abaa154334d0fd0367a [2022-02-20 23:53:40,940 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:53:40,941 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:53:40,942 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:53:40,942 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:53:40,945 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:53:40,946 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:53:40" (1/1) ... [2022-02-20 23:53:40,947 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e515844 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:40, skipping insertion in model container [2022-02-20 23:53:40,947 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:53:40" (1/1) ... [2022-02-20 23:53:40,953 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:53:40,965 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:53:41,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:53:41,065 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:53:41,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:53:41,087 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:53:41,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:41 WrapperNode [2022-02-20 23:53:41,088 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:53:41,089 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:53:41,089 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:53:41,089 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:53:41,095 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:41" (1/1) ... [2022-02-20 23:53:41,100 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:41" (1/1) ... [2022-02-20 23:53:41,113 INFO L137 Inliner]: procedures = 7, calls = 6, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 17 [2022-02-20 23:53:41,113 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:53:41,114 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:53:41,114 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:53:41,114 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:53:41,119 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:41" (1/1) ... [2022-02-20 23:53:41,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:41" (1/1) ... [2022-02-20 23:53:41,120 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:41" (1/1) ... [2022-02-20 23:53:41,120 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:41" (1/1) ... [2022-02-20 23:53:41,122 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:41" (1/1) ... [2022-02-20 23:53:41,124 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:41" (1/1) ... [2022-02-20 23:53:41,124 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:41" (1/1) ... [2022-02-20 23:53:41,125 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:53:41,125 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:53:41,125 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:53:41,126 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:53:41,126 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:41" (1/1) ... [2022-02-20 23:53:41,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:53:41,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:53:41,145 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-20 23:53:41,150 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-20 23:53:41,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:53:41,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:53:41,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 23:53:41,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:53:41,203 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:53:41,204 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:53:41,285 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:53:41,290 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:53:41,291 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 23:53:41,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:53:41 BoogieIcfgContainer [2022-02-20 23:53:41,292 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:53:41,293 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:53:41,294 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:53:41,296 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:53:41,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:53:40" (1/3) ... [2022-02-20 23:53:41,296 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14c2ba7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:53:41, skipping insertion in model container [2022-02-20 23:53:41,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:41" (2/3) ... [2022-02-20 23:53:41,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14c2ba7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:53:41, skipping insertion in model container [2022-02-20 23:53:41,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:53:41" (3/3) ... [2022-02-20 23:53:41,298 INFO L111 eAbstractionObserver]: Analyzing ICFG memsetNonZero2.c [2022-02-20 23:53:41,301 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:53:41,301 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-02-20 23:53:41,360 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:53:41,364 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-20 23:53:41,364 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-02-20 23:53:41,381 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 8 states have (on average 1.5) internal successors, (12), 11 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-20 23:53:41,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:53:41,384 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:53:41,385 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:53:41,385 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-20 23:53:41,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:53:41,394 INFO L85 PathProgramCache]: Analyzing trace with hash 29856, now seen corresponding path program 1 times [2022-02-20 23:53:41,404 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:53:41,405 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98547680] [2022-02-20 23:53:41,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:53:41,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:53:41,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:53:41,580 INFO L290 TraceCheckUtils]: 0: Hoare triple {15#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {15#true} is VALID [2022-02-20 23:53:41,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {15#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~memset~res3#1.base, main_#t~memset~res3#1.offset, main_~#cstats~0#1.base, main_~#cstats~0#1.offset;call main_~#cstats~0#1.base, main_~#cstats~0#1.offset := #Ultimate.allocOnStack(40);assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~#cstats~0#1.base, main_~#cstats~0#1.offset, 10, 40; {17#(= (select |#valid| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) 1)} is VALID [2022-02-20 23:53:41,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {17#(= (select |#valid| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) 1)} assume !(1 == #valid[#Ultimate.C_memset_#ptr#1.base]); {16#false} is VALID [2022-02-20 23:53:41,584 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-20 23:53:41,585 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:53:41,585 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98547680] [2022-02-20 23:53:41,586 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98547680] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:53:41,586 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:53:41,586 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:53:41,588 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022083134] [2022-02-20 23:53:41,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:53:41,594 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-20 23:53:41,595 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:53:41,597 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-20 23:53:41,609 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-20 23:53:41,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:53:41,610 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:53:41,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:53:41,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:53:41,637 INFO L87 Difference]: Start difference. First operand has 12 states, 8 states have (on average 1.5) internal successors, (12), 11 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 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-20 23:53:41,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:41,671 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2022-02-20 23:53:41,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:53:41,672 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-20 23:53:41,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:53:41,673 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-20 23:53:41,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2022-02-20 23:53:41,679 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-20 23:53:41,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2022-02-20 23:53:41,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 12 transitions. [2022-02-20 23:53:41,701 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-20 23:53:41,707 INFO L225 Difference]: With dead ends: 11 [2022-02-20 23:53:41,708 INFO L226 Difference]: Without dead ends: 9 [2022-02-20 23:53:41,709 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-20 23:53:41,712 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 5 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 8 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-20 23:53:41,713 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 8 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:53:41,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2022-02-20 23:53:41,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-02-20 23:53:41,736 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:53:41,737 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 8 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-20 23:53:41,737 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 8 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-20 23:53:41,738 INFO L87 Difference]: Start difference. First operand 9 states. Second operand has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 8 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-20 23:53:41,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:41,740 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2022-02-20 23:53:41,741 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-02-20 23:53:41,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:41,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:41,741 INFO L74 IsIncluded]: Start isIncluded. First operand has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 8 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 9 states. [2022-02-20 23:53:41,742 INFO L87 Difference]: Start difference. First operand has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 8 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 9 states. [2022-02-20 23:53:41,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:41,744 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2022-02-20 23:53:41,744 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-02-20 23:53:41,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:41,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:41,745 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:53:41,745 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:53:41,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 8 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-20 23:53:41,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2022-02-20 23:53:41,749 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 3 [2022-02-20 23:53:41,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:53:41,749 INFO L470 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2022-02-20 23:53:41,750 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-20 23:53:41,750 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-02-20 23:53:41,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-20 23:53:41,751 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:53:41,751 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-20 23:53:41,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:53:41,752 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-20 23:53:41,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:53:41,755 INFO L85 PathProgramCache]: Analyzing trace with hash 925572, now seen corresponding path program 1 times [2022-02-20 23:53:41,755 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:53:41,755 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207915899] [2022-02-20 23:53:41,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:53:41,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:53:41,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:53:41,823 INFO L290 TraceCheckUtils]: 0: Hoare triple {58#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {58#true} is VALID [2022-02-20 23:53:41,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {58#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~memset~res3#1.base, main_#t~memset~res3#1.offset, main_~#cstats~0#1.base, main_~#cstats~0#1.offset;call main_~#cstats~0#1.base, main_~#cstats~0#1.offset := #Ultimate.allocOnStack(40);assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~#cstats~0#1.base, main_~#cstats~0#1.offset, 10, 40; {60#(and (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 0) (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| (select |#length| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|)))} is VALID [2022-02-20 23:53:41,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {60#(and (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 0) (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| (select |#length| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|)))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {60#(and (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 0) (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| (select |#length| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|)))} is VALID [2022-02-20 23:53:41,826 INFO L290 TraceCheckUtils]: 3: Hoare triple {60#(and (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 0) (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| (select |#length| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|)))} assume !(#Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset); {59#false} is VALID [2022-02-20 23:53:41,826 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-20 23:53:41,826 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:53:41,827 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207915899] [2022-02-20 23:53:41,827 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207915899] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:53:41,827 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:53:41,828 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:53:41,830 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66408730] [2022-02-20 23:53:41,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:53:41,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2022-02-20 23:53:41,831 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:53:41,831 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-20 23:53:41,837 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:41,837 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:53:41,837 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:53:41,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:53:41,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:53:41,843 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-20 23:53:41,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:41,860 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2022-02-20 23:53:41,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:53:41,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2022-02-20 23:53:41,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:53:41,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-20 23:53:41,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2022-02-20 23:53:41,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-20 23:53:41,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2022-02-20 23:53:41,864 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 9 transitions. [2022-02-20 23:53:41,877 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-20 23:53:41,878 INFO L225 Difference]: With dead ends: 8 [2022-02-20 23:53:41,878 INFO L226 Difference]: Without dead ends: 8 [2022-02-20 23:53:41,878 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-20 23:53:41,883 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 5 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:53:41,891 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 4 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:53:41,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2022-02-20 23:53:41,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-02-20 23:53:41,895 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:53:41,895 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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-20 23:53:41,895 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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-20 23:53:41,895 INFO L87 Difference]: Start difference. First operand 8 states. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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-20 23:53:41,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:41,897 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2022-02-20 23:53:41,897 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2022-02-20 23:53:41,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:41,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:41,899 INFO L74 IsIncluded]: Start isIncluded. First operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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 8 states. [2022-02-20 23:53:41,899 INFO L87 Difference]: Start difference. First operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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 8 states. [2022-02-20 23:53:41,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:41,901 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2022-02-20 23:53:41,901 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2022-02-20 23:53:41,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:41,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:41,901 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:53:41,901 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:53:41,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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-20 23:53:41,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2022-02-20 23:53:41,902 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2022-02-20 23:53:41,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:53:41,902 INFO L470 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2022-02-20 23:53:41,902 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-20 23:53:41,903 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2022-02-20 23:53:41,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:53:41,903 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:53:41,903 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:53:41,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:53:41,904 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-20 23:53:41,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:53:41,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1803953449, now seen corresponding path program 1 times [2022-02-20 23:53:41,904 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:53:41,904 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143293010] [2022-02-20 23:53:41,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:53:41,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:53:41,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:53:42,034 INFO L290 TraceCheckUtils]: 0: Hoare triple {95#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {95#true} is VALID [2022-02-20 23:53:42,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {95#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~memset~res3#1.base, main_#t~memset~res3#1.offset, main_~#cstats~0#1.base, main_~#cstats~0#1.offset;call main_~#cstats~0#1.base, main_~#cstats~0#1.offset := #Ultimate.allocOnStack(40);assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~#cstats~0#1.base, main_~#cstats~0#1.offset, 10, 40; {97#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= 40 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:53:42,035 INFO L290 TraceCheckUtils]: 2: Hoare triple {97#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= 40 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {97#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= 40 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:53:42,036 INFO L290 TraceCheckUtils]: 3: Hoare triple {97#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= 40 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr5#1;#Ultimate.C_memset_#t~loopctr5#1 := 0; {98#(and (<= 40 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) (div |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr5#1| 4294967296)) (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr5#1| 0))} is VALID [2022-02-20 23:53:42,037 INFO L290 TraceCheckUtils]: 4: Hoare triple {98#(and (<= 40 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) (div |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr5#1| 4294967296)) (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr5#1| 0))} assume !(#Ultimate.C_memset_#t~loopctr5#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {96#false} is VALID [2022-02-20 23:53:42,037 INFO L290 TraceCheckUtils]: 5: Hoare triple {96#false} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res3#1.base, main_#t~memset~res3#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res3#1.base, main_#t~memset~res3#1.offset;main_#res#1 := 0;call ULTIMATE.dealloc(main_~#cstats~0#1.base, main_~#cstats~0#1.offset);havoc main_~#cstats~0#1.base, main_~#cstats~0#1.offset; {96#false} is VALID [2022-02-20 23:53:42,037 INFO L290 TraceCheckUtils]: 6: Hoare triple {96#false} assume !(#valid == main_old_#valid#1); {96#false} is VALID [2022-02-20 23:53:42,037 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-20 23:53:42,038 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:53:42,038 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143293010] [2022-02-20 23:53:42,038 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143293010] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:53:42,038 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:53:42,038 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:53:42,038 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103712157] [2022-02-20 23:53:42,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:53:42,038 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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-20 23:53:42,039 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:53:42,039 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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-20 23:53:42,045 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-20 23:53:42,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:53:42,045 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:53:42,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:53:42,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:53:42,046 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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-20 23:53:42,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:42,066 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2022-02-20 23:53:42,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:53:42,066 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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-20 23:53:42,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:53:42,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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-20 23:53:42,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2022-02-20 23:53:42,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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-20 23:53:42,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2022-02-20 23:53:42,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 10 transitions. [2022-02-20 23:53:42,077 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-20 23:53:42,077 INFO L225 Difference]: With dead ends: 9 [2022-02-20 23:53:42,077 INFO L226 Difference]: Without dead ends: 9 [2022-02-20 23:53:42,077 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:53:42,078 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 5 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:53:42,079 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 10 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:53:42,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2022-02-20 23:53:42,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-02-20 23:53:42,080 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:53:42,080 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 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-20 23:53:42,080 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 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-20 23:53:42,080 INFO L87 Difference]: Start difference. First operand 9 states. Second operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 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-20 23:53:42,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:42,080 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2022-02-20 23:53:42,080 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-02-20 23:53:42,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:42,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:42,081 INFO L74 IsIncluded]: Start isIncluded. First operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 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 9 states. [2022-02-20 23:53:42,081 INFO L87 Difference]: Start difference. First operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 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 9 states. [2022-02-20 23:53:42,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:42,081 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2022-02-20 23:53:42,081 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-02-20 23:53:42,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:42,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:42,082 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:53:42,082 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:53:42,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 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-20 23:53:42,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2022-02-20 23:53:42,082 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2022-02-20 23:53:42,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:53:42,082 INFO L470 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2022-02-20 23:53:42,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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-20 23:53:42,082 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-02-20 23:53:42,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:53:42,083 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:53:42,083 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:53:42,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:53:42,083 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-20 23:53:42,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:53:42,083 INFO L85 PathProgramCache]: Analyzing trace with hash 87920521, now seen corresponding path program 1 times [2022-02-20 23:53:42,083 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:53:42,083 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560168081] [2022-02-20 23:53:42,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:53:42,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:53:42,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:53:42,219 INFO L290 TraceCheckUtils]: 0: Hoare triple {137#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {137#true} is VALID [2022-02-20 23:53:42,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {137#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~memset~res3#1.base, main_#t~memset~res3#1.offset, main_~#cstats~0#1.base, main_~#cstats~0#1.offset;call main_~#cstats~0#1.base, main_~#cstats~0#1.offset := #Ultimate.allocOnStack(40);assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~#cstats~0#1.base, main_~#cstats~0#1.offset, 10, 40; {139#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 40) (<= 40 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:53:42,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {139#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 40) (<= 40 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {139#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 40) (<= 40 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:53:42,221 INFO L290 TraceCheckUtils]: 3: Hoare triple {139#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 40) (<= 40 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr5#1;#Ultimate.C_memset_#t~loopctr5#1 := 0; {140#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 40) (<= 40 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr5#1| 0))} is VALID [2022-02-20 23:53:42,221 INFO L290 TraceCheckUtils]: 4: Hoare triple {140#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 40) (<= 40 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr5#1| 0))} assume #Ultimate.C_memset_#t~loopctr5#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#Ultimate.C_memset_#t~loopctr5#1 := 1 + #Ultimate.C_memset_#t~loopctr5#1; {141#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) (div |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr5#1| 4294967296)) (not (<= (+ (div |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr5#1| 4294967296) 1) 0)) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr5#1| 39) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:53:42,222 INFO L290 TraceCheckUtils]: 5: Hoare triple {141#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) (div |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr5#1| 4294967296)) (not (<= (+ (div |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr5#1| 4294967296) 1) 0)) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr5#1| 39) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume !(#Ultimate.C_memset_#t~loopctr5#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {138#false} is VALID [2022-02-20 23:53:42,222 INFO L290 TraceCheckUtils]: 6: Hoare triple {138#false} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res3#1.base, main_#t~memset~res3#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res3#1.base, main_#t~memset~res3#1.offset;main_#res#1 := 0;call ULTIMATE.dealloc(main_~#cstats~0#1.base, main_~#cstats~0#1.offset);havoc main_~#cstats~0#1.base, main_~#cstats~0#1.offset; {138#false} is VALID [2022-02-20 23:53:42,222 INFO L290 TraceCheckUtils]: 7: Hoare triple {138#false} assume !(#valid == main_old_#valid#1); {138#false} is VALID [2022-02-20 23:53:42,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:53:42,223 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:53:42,223 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560168081] [2022-02-20 23:53:42,223 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560168081] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:53:42,223 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717204373] [2022-02-20 23:53:42,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:53:42,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:53:42,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:53:42,228 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:53:42,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 23:53:42,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:53:42,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 23:53:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:53:42,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:53:42,424 INFO L290 TraceCheckUtils]: 0: Hoare triple {137#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {137#true} is VALID [2022-02-20 23:53:42,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {137#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~memset~res3#1.base, main_#t~memset~res3#1.offset, main_~#cstats~0#1.base, main_~#cstats~0#1.offset;call main_~#cstats~0#1.base, main_~#cstats~0#1.offset := #Ultimate.allocOnStack(40);assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~#cstats~0#1.base, main_~#cstats~0#1.offset, 10, 40; {148#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#cstats~0#1.base|) 0) (exists ((v_ArrVal_14 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#cstats~0#1.base| v_ArrVal_14) |#valid|)))} is VALID [2022-02-20 23:53:42,426 INFO L290 TraceCheckUtils]: 2: Hoare triple {148#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#cstats~0#1.base|) 0) (exists ((v_ArrVal_14 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#cstats~0#1.base| v_ArrVal_14) |#valid|)))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {148#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#cstats~0#1.base|) 0) (exists ((v_ArrVal_14 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#cstats~0#1.base| v_ArrVal_14) |#valid|)))} is VALID [2022-02-20 23:53:42,427 INFO L290 TraceCheckUtils]: 3: Hoare triple {148#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#cstats~0#1.base|) 0) (exists ((v_ArrVal_14 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#cstats~0#1.base| v_ArrVal_14) |#valid|)))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr5#1;#Ultimate.C_memset_#t~loopctr5#1 := 0; {148#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#cstats~0#1.base|) 0) (exists ((v_ArrVal_14 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#cstats~0#1.base| v_ArrVal_14) |#valid|)))} is VALID [2022-02-20 23:53:42,428 INFO L290 TraceCheckUtils]: 4: Hoare triple {148#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#cstats~0#1.base|) 0) (exists ((v_ArrVal_14 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#cstats~0#1.base| v_ArrVal_14) |#valid|)))} assume #Ultimate.C_memset_#t~loopctr5#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#Ultimate.C_memset_#t~loopctr5#1 := 1 + #Ultimate.C_memset_#t~loopctr5#1; {148#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#cstats~0#1.base|) 0) (exists ((v_ArrVal_14 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#cstats~0#1.base| v_ArrVal_14) |#valid|)))} is VALID [2022-02-20 23:53:42,428 INFO L290 TraceCheckUtils]: 5: Hoare triple {148#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#cstats~0#1.base|) 0) (exists ((v_ArrVal_14 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#cstats~0#1.base| v_ArrVal_14) |#valid|)))} assume !(#Ultimate.C_memset_#t~loopctr5#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {148#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#cstats~0#1.base|) 0) (exists ((v_ArrVal_14 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#cstats~0#1.base| v_ArrVal_14) |#valid|)))} is VALID [2022-02-20 23:53:42,429 INFO L290 TraceCheckUtils]: 6: Hoare triple {148#(and (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#cstats~0#1.base|) 0) (exists ((v_ArrVal_14 Int)) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#cstats~0#1.base| v_ArrVal_14) |#valid|)))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res3#1.base, main_#t~memset~res3#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res3#1.base, main_#t~memset~res3#1.offset;main_#res#1 := 0;call ULTIMATE.dealloc(main_~#cstats~0#1.base, main_~#cstats~0#1.offset);havoc main_~#cstats~0#1.base, main_~#cstats~0#1.offset; {164#(exists ((|v_ULTIMATE.start_main_~#cstats~0#1.base_5| Int)) (and (= (store |ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#cstats~0#1.base_5| 0) |#valid|) (= (select |ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#cstats~0#1.base_5|) 0)))} is VALID [2022-02-20 23:53:42,430 INFO L290 TraceCheckUtils]: 7: Hoare triple {164#(exists ((|v_ULTIMATE.start_main_~#cstats~0#1.base_5| Int)) (and (= (store |ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#cstats~0#1.base_5| 0) |#valid|) (= (select |ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#cstats~0#1.base_5|) 0)))} assume !(#valid == main_old_#valid#1); {138#false} is VALID [2022-02-20 23:53:42,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:53:42,430 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:53:42,430 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717204373] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:53:42,430 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:53:42,430 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2022-02-20 23:53:42,430 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179804287] [2022-02-20 23:53:42,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:53:42,431 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2022-02-20 23:53:42,431 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:53:42,431 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-20 23:53:42,475 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:42,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:53:42,476 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:53:42,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:53:42,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:53:42,476 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-20 23:53:42,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:42,509 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2022-02-20 23:53:42,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:53:42,510 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2022-02-20 23:53:42,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:53:42,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-20 23:53:42,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2022-02-20 23:53:42,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-20 23:53:42,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2022-02-20 23:53:42,511 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 8 transitions. [2022-02-20 23:53:42,518 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:42,518 INFO L225 Difference]: With dead ends: 8 [2022-02-20 23:53:42,518 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 23:53:42,519 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:53:42,519 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:53:42,520 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 6 Unchecked, 0.0s Time] [2022-02-20 23:53:42,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 23:53:42,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 23:53:42,520 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:53:42,520 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-20 23:53:42,520 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-20 23:53:42,520 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-20 23:53:42,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:42,520 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 23:53:42,521 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 23:53:42,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:42,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:42,521 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-20 23:53:42,521 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-20 23:53:42,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:42,521 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 23:53:42,521 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 23:53:42,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:42,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:42,521 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:53:42,521 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:53:42,521 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-20 23:53:42,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 23:53:42,521 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 8 [2022-02-20 23:53:42,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:53:42,521 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 23:53:42,521 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-20 23:53:42,521 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 23:53:42,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:42,530 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (2 of 3 remaining) [2022-02-20 23:53:42,531 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2022-02-20 23:53:42,531 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (0 of 3 remaining) [2022-02-20 23:53:42,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 23:53:42,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:53:42,742 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-02-20 23:53:42,742 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 23:53:42,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 11:53:42 BoogieIcfgContainer [2022-02-20 23:53:42,744 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 23:53:42,745 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 23:53:42,745 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 23:53:42,745 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 23:53:42,745 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:53:41" (3/4) ... [2022-02-20 23:53:42,747 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 23:53:42,753 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2022-02-20 23:53:42,753 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-02-20 23:53:42,753 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-02-20 23:53:42,754 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 23:53:42,771 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 23:53:42,771 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 23:53:42,772 INFO L158 Benchmark]: Toolchain (without parser) took 1830.21ms. Allocated memory is still 100.7MB. Free memory was 72.5MB in the beginning and 57.8MB in the end (delta: 14.7MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2022-02-20 23:53:42,772 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 77.6MB. Free memory was 43.6MB in the beginning and 43.6MB in the end (delta: 44.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:53:42,772 INFO L158 Benchmark]: CACSL2BoogieTranslator took 145.85ms. Allocated memory is still 100.7MB. Free memory was 72.3MB in the beginning and 63.5MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 23:53:42,772 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.70ms. Allocated memory is still 100.7MB. Free memory was 63.4MB in the beginning and 62.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:53:42,772 INFO L158 Benchmark]: Boogie Preprocessor took 11.16ms. Allocated memory is still 100.7MB. Free memory was 62.0MB in the beginning and 60.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:53:42,773 INFO L158 Benchmark]: RCFGBuilder took 167.21ms. Allocated memory is still 100.7MB. Free memory was 60.9MB in the beginning and 51.3MB in the end (delta: 9.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 23:53:42,773 INFO L158 Benchmark]: TraceAbstraction took 1451.03ms. Allocated memory is still 100.7MB. Free memory was 50.8MB in the beginning and 59.8MB in the end (delta: -9.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:53:42,773 INFO L158 Benchmark]: Witness Printer took 25.85ms. Allocated memory is still 100.7MB. Free memory was 59.8MB in the beginning and 57.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:53:42,774 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 77.6MB. Free memory was 43.6MB in the beginning and 43.6MB in the end (delta: 44.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 145.85ms. Allocated memory is still 100.7MB. Free memory was 72.3MB in the beginning and 63.5MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.70ms. Allocated memory is still 100.7MB. Free memory was 63.4MB in the beginning and 62.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 11.16ms. Allocated memory is still 100.7MB. Free memory was 62.0MB in the beginning and 60.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 167.21ms. Allocated memory is still 100.7MB. Free memory was 60.9MB in the beginning and 51.3MB in the end (delta: 9.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1451.03ms. Allocated memory is still 100.7MB. Free memory was 50.8MB in the beginning and 59.8MB in the end (delta: -9.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 25.85ms. Allocated memory is still 100.7MB. Free memory was 59.8MB in the beginning and 57.8MB in the end (delta: 2.0MB). 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: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: 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, 12 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15 mSDsluCounter, 28 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 6 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19 IncrementalHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 19 mSDtfsCounter, 19 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=0, InterpolantAutomatonStates: 14, 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, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 30 NumberOfCodeBlocks, 30 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 25 ConstructedInterpolants, 6 QuantifiedInterpolants, 187 SizeOfPredicates, 1 NumberOfNonLiveVariables, 52 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 1/2 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 3 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-02-20 23:53:42,803 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