./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/ldv-sets/test_add-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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/AutomizerTermination.xml -i ../sv-benchmarks/c/ldv-sets/test_add-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-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(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ed7fc1ee8e8624c54bbfaff1033820d20aa5fb88ac8eae06fb8e7107f72c3762 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 15:38:00,214 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 15:38:00,249 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 15:38:00,289 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 15:38:00,292 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 15:38:00,293 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 15:38:00,298 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 15:38:00,300 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 15:38:00,301 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 15:38:00,307 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 15:38:00,308 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 15:38:00,311 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 15:38:00,311 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 15:38:00,313 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 15:38:00,314 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 15:38:00,316 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 15:38:00,317 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 15:38:00,319 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 15:38:00,322 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 15:38:00,327 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 15:38:00,330 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 15:38:00,331 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 15:38:00,332 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 15:38:00,333 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 15:38:00,335 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 15:38:00,338 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 15:38:00,339 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 15:38:00,339 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 15:38:00,340 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 15:38:00,340 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 15:38:00,341 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 15:38:00,342 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 15:38:00,343 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 15:38:00,344 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 15:38:00,344 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 15:38:00,345 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 15:38:00,345 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 15:38:00,346 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 15:38:00,346 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 15:38:00,346 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 15:38:00,347 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 15:38:00,349 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 15:38:00,350 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-14 15:38:00,378 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 15:38:00,379 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 15:38:00,379 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 15:38:00,379 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 15:38:00,381 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 15:38:00,381 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 15:38:00,381 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 15:38:00,382 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-14 15:38:00,382 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-14 15:38:00,383 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-14 15:38:00,383 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-14 15:38:00,383 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-14 15:38:00,383 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-14 15:38:00,384 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 15:38:00,384 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 15:38:00,384 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 15:38:00,384 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 15:38:00,385 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 15:38:00,385 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 15:38:00,386 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-14 15:38:00,386 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-14 15:38:00,386 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-14 15:38:00,386 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 15:38:00,387 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 15:38:00,387 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-14 15:38:00,387 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 15:38:00,387 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-14 15:38:00,387 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 15:38:00,388 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 15:38:00,388 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 15:38:00,388 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 15:38:00,389 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-14 15:38:00,389 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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(F end) ) 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 -> ed7fc1ee8e8624c54bbfaff1033820d20aa5fb88ac8eae06fb8e7107f72c3762 [2022-07-14 15:38:00,628 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 15:38:00,655 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 15:38:00,657 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 15:38:00,658 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 15:38:00,659 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 15:38:00,661 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-sets/test_add-1.i [2022-07-14 15:38:00,716 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b07bc635c/112f38457ec64cb98a09358a4b6d3da6/FLAG3c02cd28b [2022-07-14 15:38:01,231 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 15:38:01,231 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_add-1.i [2022-07-14 15:38:01,244 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b07bc635c/112f38457ec64cb98a09358a4b6d3da6/FLAG3c02cd28b [2022-07-14 15:38:01,717 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b07bc635c/112f38457ec64cb98a09358a4b6d3da6 [2022-07-14 15:38:01,719 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 15:38:01,725 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 15:38:01,727 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 15:38:01,727 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 15:38:01,733 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 15:38:01,734 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 03:38:01" (1/1) ... [2022-07-14 15:38:01,735 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f47ff31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:38:01, skipping insertion in model container [2022-07-14 15:38:01,735 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 03:38:01" (1/1) ... [2022-07-14 15:38:01,741 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 15:38:01,788 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 15:38:02,056 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_add-1.i[25792,25805] [2022-07-14 15:38:02,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 15:38:02,068 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 15:38:02,122 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_add-1.i[25792,25805] [2022-07-14 15:38:02,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 15:38:02,150 INFO L208 MainTranslator]: Completed translation [2022-07-14 15:38:02,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:38:02 WrapperNode [2022-07-14 15:38:02,151 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 15:38:02,152 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 15:38:02,153 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 15:38:02,153 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 15:38:02,159 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:38:02" (1/1) ... [2022-07-14 15:38:02,177 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:38:02" (1/1) ... [2022-07-14 15:38:02,204 INFO L137 Inliner]: procedures = 135, calls = 46, calls flagged for inlining = 15, calls inlined = 10, statements flattened = 105 [2022-07-14 15:38:02,205 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 15:38:02,206 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 15:38:02,206 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 15:38:02,206 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 15:38:02,212 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:38:02" (1/1) ... [2022-07-14 15:38:02,212 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:38:02" (1/1) ... [2022-07-14 15:38:02,216 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:38:02" (1/1) ... [2022-07-14 15:38:02,216 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:38:02" (1/1) ... [2022-07-14 15:38:02,224 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:38:02" (1/1) ... [2022-07-14 15:38:02,237 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:38:02" (1/1) ... [2022-07-14 15:38:02,238 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:38:02" (1/1) ... [2022-07-14 15:38:02,241 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 15:38:02,242 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 15:38:02,242 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 15:38:02,242 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 15:38:02,249 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:38:02" (1/1) ... [2022-07-14 15:38:02,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:38:02,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:38:02,275 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:38:02,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-14 15:38:02,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 15:38:02,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 15:38:02,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 15:38:02,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 15:38:02,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 15:38:02,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 15:38:02,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-14 15:38:02,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 15:38:02,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 15:38:02,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 15:38:02,467 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 15:38:02,469 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 15:38:02,701 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 15:38:02,706 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 15:38:02,707 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-14 15:38:02,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:38:02 BoogieIcfgContainer [2022-07-14 15:38:02,708 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 15:38:02,727 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-14 15:38:02,727 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-14 15:38:02,730 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-14 15:38:02,731 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:38:02,731 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.07 03:38:01" (1/3) ... [2022-07-14 15:38:02,732 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5d9eb1e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 03:38:02, skipping insertion in model container [2022-07-14 15:38:02,732 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:38:02,733 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:38:02" (2/3) ... [2022-07-14 15:38:02,733 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5d9eb1e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 03:38:02, skipping insertion in model container [2022-07-14 15:38:02,733 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:38:02,733 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:38:02" (3/3) ... [2022-07-14 15:38:02,735 INFO L354 chiAutomizerObserver]: Analyzing ICFG test_add-1.i [2022-07-14 15:38:02,786 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-14 15:38:02,786 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-14 15:38:02,786 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-14 15:38:02,787 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-14 15:38:02,787 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-14 15:38:02,787 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-14 15:38:02,787 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-14 15:38:02,787 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-14 15:38:02,791 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 states have internal predecessors, (32), 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-07-14 15:38:02,815 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-07-14 15:38:02,816 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:38:02,816 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:38:02,823 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 15:38:02,824 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 15:38:02,824 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-14 15:38:02,824 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 states have internal predecessors, (32), 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-07-14 15:38:02,828 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-07-14 15:38:02,828 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:38:02,828 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:38:02,828 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 15:38:02,828 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 15:38:02,834 INFO L752 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);~#s1~0.base, ~#s1~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(~#s1~0.base, ~#s1~0.offset, ~#s1~0.base, ~#s1~0.offset, 4);call write~init~$Pointer$(~#s1~0.base, ~#s1~0.offset, ~#s1~0.base, 4 + ~#s1~0.offset, 4); 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_foo } true;havoc foo_#t~nondet27#1, foo_#t~ret28#1, foo_~j~0#1;foo_~j~0#1 := foo_#t~nondet27#1;havoc foo_#t~nondet27#1;assume { :begin_inline_ldv_set_add } true;ldv_set_add_#in~new#1, ldv_set_add_#in~s#1.base, ldv_set_add_#in~s#1.offset := foo_~j~0#1, ~#s1~0.base, ~#s1~0.offset;havoc ldv_set_add_#t~ret17#1, ldv_set_add_#t~ret18#1.base, ldv_set_add_#t~ret18#1.offset, ldv_set_add_~le~0#1.base, ldv_set_add_~le~0#1.offset, ldv_set_add_~new#1, ldv_set_add_~s#1.base, ldv_set_add_~s#1.offset;ldv_set_add_~new#1 := ldv_set_add_#in~new#1;ldv_set_add_~s#1.base, ldv_set_add_~s#1.offset := ldv_set_add_#in~s#1.base, ldv_set_add_#in~s#1.offset;assume { :begin_inline_ldv_is_in_set } true;ldv_is_in_set_#in~e#1, ldv_is_in_set_#in~s#1.base, ldv_is_in_set_#in~s#1.offset := ldv_set_add_~new#1, ldv_set_add_~s#1.base, ldv_set_add_~s#1.offset;havoc ldv_is_in_set_#res#1;havoc ldv_is_in_set_#t~mem23#1.base, ldv_is_in_set_#t~mem23#1.offset, ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset, ldv_is_in_set_#t~mem25#1, ldv_is_in_set_#t~mem24#1.base, ldv_is_in_set_#t~mem24#1.offset, ldv_is_in_set_~__mptr~4#1.base, ldv_is_in_set_~__mptr~4#1.offset, ldv_is_in_set_~e#1, ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset, ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset;ldv_is_in_set_~e#1 := ldv_is_in_set_#in~e#1;ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset := ldv_is_in_set_#in~s#1.base, ldv_is_in_set_#in~s#1.offset;havoc ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset;call ldv_is_in_set_#t~mem23#1.base, ldv_is_in_set_#t~mem23#1.offset := read~$Pointer$(ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset, 4);ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset := ldv_is_in_set_#t~mem23#1.base, ldv_is_in_set_#t~mem23#1.offset;havoc ldv_is_in_set_#t~mem23#1.base, ldv_is_in_set_#t~mem23#1.offset;ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset := ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset - 4; 6#L652-3true [2022-07-14 15:38:02,834 INFO L754 eck$LassoCheckResult]: Loop: 6#L652-3true assume !!(ldv_is_in_set_~m~1#1.base != ldv_is_in_set_~s#1.base || 4 + ldv_is_in_set_~m~1#1.offset != ldv_is_in_set_~s#1.offset);call ldv_is_in_set_#t~mem25#1 := read~int(ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset, 4); 19#L653true assume !(ldv_is_in_set_#t~mem25#1 == ldv_is_in_set_~e#1);havoc ldv_is_in_set_#t~mem25#1; 15#L652-2true call ldv_is_in_set_#t~mem24#1.base, ldv_is_in_set_#t~mem24#1.offset := read~$Pointer$(ldv_is_in_set_~m~1#1.base, 4 + ldv_is_in_set_~m~1#1.offset, 4);ldv_is_in_set_~__mptr~4#1.base, ldv_is_in_set_~__mptr~4#1.offset := ldv_is_in_set_#t~mem24#1.base, ldv_is_in_set_#t~mem24#1.offset;havoc ldv_is_in_set_#t~mem24#1.base, ldv_is_in_set_#t~mem24#1.offset;ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset := ldv_is_in_set_~__mptr~4#1.base, ldv_is_in_set_~__mptr~4#1.offset - 4; 6#L652-3true [2022-07-14 15:38:02,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:38:02,841 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-14 15:38:02,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:38:02,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630823098] [2022-07-14 15:38:02,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:38:02,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:38:02,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:38:02,957 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:38:02,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:38:03,008 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:38:03,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:38:03,011 INFO L85 PathProgramCache]: Analyzing trace with hash 39883, now seen corresponding path program 1 times [2022-07-14 15:38:03,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:38:03,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301987227] [2022-07-14 15:38:03,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:38:03,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:38:03,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:38:03,025 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:38:03,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:38:03,042 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:38:03,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:38:03,050 INFO L85 PathProgramCache]: Analyzing trace with hash 28698825, now seen corresponding path program 1 times [2022-07-14 15:38:03,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:38:03,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404962159] [2022-07-14 15:38:03,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:38:03,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:38:03,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:38:03,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:38:03,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:38:03,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404962159] [2022-07-14 15:38:03,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404962159] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:38:03,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:38:03,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 15:38:03,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579456106] [2022-07-14 15:38:03,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:38:03,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:38:03,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 15:38:03,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 15:38:03,352 INFO L87 Difference]: Start difference. First operand has 24 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 states have internal predecessors, (32), 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 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 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-07-14 15:38:03,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:38:03,430 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2022-07-14 15:38:03,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 15:38:03,436 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 32 transitions. [2022-07-14 15:38:03,439 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 15:38:03,442 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 15 states and 15 transitions. [2022-07-14 15:38:03,443 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-07-14 15:38:03,444 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-07-14 15:38:03,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 15 transitions. [2022-07-14 15:38:03,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:38:03,445 INFO L369 hiAutomatonCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-07-14 15:38:03,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 15 transitions. [2022-07-14 15:38:03,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-07-14 15:38:03,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.0) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:38:03,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-07-14 15:38:03,466 INFO L392 hiAutomatonCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-07-14 15:38:03,466 INFO L374 stractBuchiCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-07-14 15:38:03,467 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-14 15:38:03,467 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 15 transitions. [2022-07-14 15:38:03,467 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 15:38:03,467 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:38:03,468 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:38:03,468 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:38:03,468 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 15:38:03,469 INFO L752 eck$LassoCheckResult]: Stem: 71#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);~#s1~0.base, ~#s1~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(~#s1~0.base, ~#s1~0.offset, ~#s1~0.base, ~#s1~0.offset, 4);call write~init~$Pointer$(~#s1~0.base, ~#s1~0.offset, ~#s1~0.base, 4 + ~#s1~0.offset, 4); 72#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_foo } true;havoc foo_#t~nondet27#1, foo_#t~ret28#1, foo_~j~0#1;foo_~j~0#1 := foo_#t~nondet27#1;havoc foo_#t~nondet27#1;assume { :begin_inline_ldv_set_add } true;ldv_set_add_#in~new#1, ldv_set_add_#in~s#1.base, ldv_set_add_#in~s#1.offset := foo_~j~0#1, ~#s1~0.base, ~#s1~0.offset;havoc ldv_set_add_#t~ret17#1, ldv_set_add_#t~ret18#1.base, ldv_set_add_#t~ret18#1.offset, ldv_set_add_~le~0#1.base, ldv_set_add_~le~0#1.offset, ldv_set_add_~new#1, ldv_set_add_~s#1.base, ldv_set_add_~s#1.offset;ldv_set_add_~new#1 := ldv_set_add_#in~new#1;ldv_set_add_~s#1.base, ldv_set_add_~s#1.offset := ldv_set_add_#in~s#1.base, ldv_set_add_#in~s#1.offset;assume { :begin_inline_ldv_is_in_set } true;ldv_is_in_set_#in~e#1, ldv_is_in_set_#in~s#1.base, ldv_is_in_set_#in~s#1.offset := ldv_set_add_~new#1, ldv_set_add_~s#1.base, ldv_set_add_~s#1.offset;havoc ldv_is_in_set_#res#1;havoc ldv_is_in_set_#t~mem23#1.base, ldv_is_in_set_#t~mem23#1.offset, ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset, ldv_is_in_set_#t~mem25#1, ldv_is_in_set_#t~mem24#1.base, ldv_is_in_set_#t~mem24#1.offset, ldv_is_in_set_~__mptr~4#1.base, ldv_is_in_set_~__mptr~4#1.offset, ldv_is_in_set_~e#1, ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset, ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset;ldv_is_in_set_~e#1 := ldv_is_in_set_#in~e#1;ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset := ldv_is_in_set_#in~s#1.base, ldv_is_in_set_#in~s#1.offset;havoc ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset;call ldv_is_in_set_#t~mem23#1.base, ldv_is_in_set_#t~mem23#1.offset := read~$Pointer$(ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset, 4);ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset := ldv_is_in_set_#t~mem23#1.base, ldv_is_in_set_#t~mem23#1.offset;havoc ldv_is_in_set_#t~mem23#1.base, ldv_is_in_set_#t~mem23#1.offset;ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset := ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset - 4; 75#L652-3 assume !(ldv_is_in_set_~m~1#1.base != ldv_is_in_set_~s#1.base || 4 + ldv_is_in_set_~m~1#1.offset != ldv_is_in_set_~s#1.offset); 76#L652-4 ldv_is_in_set_#res#1 := 0; 78#L657 ldv_set_add_#t~ret17#1 := ldv_is_in_set_#res#1;assume { :end_inline_ldv_is_in_set } true; 79#L633 assume 0 == ldv_set_add_#t~ret17#1;havoc ldv_set_add_#t~ret17#1;havoc ldv_set_add_~le~0#1.base, ldv_set_add_~le~0#1.offset;assume { :begin_inline_ldv_successful_malloc } true;ldv_successful_malloc_#in~size#1 := 12;havoc ldv_successful_malloc_#res#1.base, ldv_successful_malloc_#res#1.offset;havoc ldv_successful_malloc_#t~malloc5#1.base, ldv_successful_malloc_#t~malloc5#1.offset, ldv_successful_malloc_~size#1, ldv_successful_malloc_~ptr~0#1.base, ldv_successful_malloc_~ptr~0#1.offset;ldv_successful_malloc_~size#1 := ldv_successful_malloc_#in~size#1;call ldv_successful_malloc_#t~malloc5#1.base, ldv_successful_malloc_#t~malloc5#1.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size#1);ldv_successful_malloc_~ptr~0#1.base, ldv_successful_malloc_~ptr~0#1.offset := ldv_successful_malloc_#t~malloc5#1.base, ldv_successful_malloc_#t~malloc5#1.offset;havoc ldv_successful_malloc_#t~malloc5#1.base, ldv_successful_malloc_#t~malloc5#1.offset;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ldv_successful_malloc_~ptr~0#1.base != 0 || ldv_successful_malloc_~ptr~0#1.offset != 0 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 69#L565 assume !(0 == assume_abort_if_not_~cond#1); 70#L564 assume { :end_inline_assume_abort_if_not } true;ldv_successful_malloc_#res#1.base, ldv_successful_malloc_#res#1.offset := ldv_successful_malloc_~ptr~0#1.base, ldv_successful_malloc_~ptr~0#1.offset; 83#L578 ldv_set_add_#t~ret18#1.base, ldv_set_add_#t~ret18#1.offset := ldv_successful_malloc_#res#1.base, ldv_successful_malloc_#res#1.offset;assume { :end_inline_ldv_successful_malloc } true;ldv_set_add_~le~0#1.base, ldv_set_add_~le~0#1.offset := ldv_set_add_#t~ret18#1.base, ldv_set_add_#t~ret18#1.offset;havoc ldv_set_add_#t~ret18#1.base, ldv_set_add_#t~ret18#1.offset;call write~int(ldv_set_add_~new#1, ldv_set_add_~le~0#1.base, ldv_set_add_~le~0#1.offset, 4);assume { :begin_inline_ldv_list_add } true;ldv_list_add_#in~new#1.base, ldv_list_add_#in~new#1.offset, ldv_list_add_#in~head#1.base, ldv_list_add_#in~head#1.offset := ldv_set_add_~le~0#1.base, 4 + ldv_set_add_~le~0#1.offset, ldv_set_add_~s#1.base, ldv_set_add_~s#1.offset;havoc ldv_list_add_#t~mem6#1.base, ldv_list_add_#t~mem6#1.offset, ldv_list_add_~new#1.base, ldv_list_add_~new#1.offset, ldv_list_add_~head#1.base, ldv_list_add_~head#1.offset;ldv_list_add_~new#1.base, ldv_list_add_~new#1.offset := ldv_list_add_#in~new#1.base, ldv_list_add_#in~new#1.offset;ldv_list_add_~head#1.base, ldv_list_add_~head#1.offset := ldv_list_add_#in~head#1.base, ldv_list_add_#in~head#1.offset;call ldv_list_add_#t~mem6#1.base, ldv_list_add_#t~mem6#1.offset := read~$Pointer$(ldv_list_add_~head#1.base, ldv_list_add_~head#1.offset, 4);assume { :begin_inline___ldv_list_add } true;__ldv_list_add_#in~new#1.base, __ldv_list_add_#in~new#1.offset, __ldv_list_add_#in~prev#1.base, __ldv_list_add_#in~prev#1.offset, __ldv_list_add_#in~next#1.base, __ldv_list_add_#in~next#1.offset := ldv_list_add_~new#1.base, ldv_list_add_~new#1.offset, ldv_list_add_~head#1.base, ldv_list_add_~head#1.offset, ldv_list_add_#t~mem6#1.base, ldv_list_add_#t~mem6#1.offset;havoc __ldv_list_add_~new#1.base, __ldv_list_add_~new#1.offset, __ldv_list_add_~prev#1.base, __ldv_list_add_~prev#1.offset, __ldv_list_add_~next#1.base, __ldv_list_add_~next#1.offset;__ldv_list_add_~new#1.base, __ldv_list_add_~new#1.offset := __ldv_list_add_#in~new#1.base, __ldv_list_add_#in~new#1.offset;__ldv_list_add_~prev#1.base, __ldv_list_add_~prev#1.offset := __ldv_list_add_#in~prev#1.base, __ldv_list_add_#in~prev#1.offset;__ldv_list_add_~next#1.base, __ldv_list_add_~next#1.offset := __ldv_list_add_#in~next#1.base, __ldv_list_add_#in~next#1.offset;call write~$Pointer$(__ldv_list_add_~new#1.base, __ldv_list_add_~new#1.offset, __ldv_list_add_~next#1.base, 4 + __ldv_list_add_~next#1.offset, 4);call write~$Pointer$(__ldv_list_add_~next#1.base, __ldv_list_add_~next#1.offset, __ldv_list_add_~new#1.base, __ldv_list_add_~new#1.offset, 4);call write~$Pointer$(__ldv_list_add_~prev#1.base, __ldv_list_add_~prev#1.offset, __ldv_list_add_~new#1.base, 4 + __ldv_list_add_~new#1.offset, 4);call write~$Pointer$(__ldv_list_add_~new#1.base, __ldv_list_add_~new#1.offset, __ldv_list_add_~prev#1.base, __ldv_list_add_~prev#1.offset, 4); 81#L589 assume { :end_inline___ldv_list_add } true;havoc ldv_list_add_#t~mem6#1.base, ldv_list_add_#t~mem6#1.offset; 82#L603 assume { :end_inline_ldv_list_add } true; 80#L632 assume { :end_inline_ldv_set_add } true;assume { :begin_inline_ldv_is_in_set } true;ldv_is_in_set_#in~e#1, ldv_is_in_set_#in~s#1.base, ldv_is_in_set_#in~s#1.offset := foo_~j~0#1, ~#s1~0.base, ~#s1~0.offset;havoc ldv_is_in_set_#res#1;havoc ldv_is_in_set_#t~mem23#1.base, ldv_is_in_set_#t~mem23#1.offset, ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset, ldv_is_in_set_#t~mem25#1, ldv_is_in_set_#t~mem24#1.base, ldv_is_in_set_#t~mem24#1.offset, ldv_is_in_set_~__mptr~4#1.base, ldv_is_in_set_~__mptr~4#1.offset, ldv_is_in_set_~e#1, ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset, ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset;ldv_is_in_set_~e#1 := ldv_is_in_set_#in~e#1;ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset := ldv_is_in_set_#in~s#1.base, ldv_is_in_set_#in~s#1.offset;havoc ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset;call ldv_is_in_set_#t~mem23#1.base, ldv_is_in_set_#t~mem23#1.offset := read~$Pointer$(ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset, 4);ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset := ldv_is_in_set_#t~mem23#1.base, ldv_is_in_set_#t~mem23#1.offset;havoc ldv_is_in_set_#t~mem23#1.base, ldv_is_in_set_#t~mem23#1.offset;ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset := ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset - 4; 77#L652-8 [2022-07-14 15:38:03,470 INFO L754 eck$LassoCheckResult]: Loop: 77#L652-8 assume !!(ldv_is_in_set_~m~1#1.base != ldv_is_in_set_~s#1.base || 4 + ldv_is_in_set_~m~1#1.offset != ldv_is_in_set_~s#1.offset);call ldv_is_in_set_#t~mem25#1 := read~int(ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset, 4); 73#L653-1 assume !(ldv_is_in_set_#t~mem25#1 == ldv_is_in_set_~e#1);havoc ldv_is_in_set_#t~mem25#1; 74#L652-7 call ldv_is_in_set_#t~mem24#1.base, ldv_is_in_set_#t~mem24#1.offset := read~$Pointer$(ldv_is_in_set_~m~1#1.base, 4 + ldv_is_in_set_~m~1#1.offset, 4);ldv_is_in_set_~__mptr~4#1.base, ldv_is_in_set_~__mptr~4#1.offset := ldv_is_in_set_#t~mem24#1.base, ldv_is_in_set_#t~mem24#1.offset;havoc ldv_is_in_set_#t~mem24#1.base, ldv_is_in_set_#t~mem24#1.offset;ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset := ldv_is_in_set_~__mptr~4#1.base, ldv_is_in_set_~__mptr~4#1.offset - 4; 77#L652-8 [2022-07-14 15:38:03,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:38:03,471 INFO L85 PathProgramCache]: Analyzing trace with hash -812001189, now seen corresponding path program 1 times [2022-07-14 15:38:03,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:38:03,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490229809] [2022-07-14 15:38:03,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:38:03,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:38:03,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:38:03,565 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:38:03,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:38:03,620 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:38:03,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:38:03,621 INFO L85 PathProgramCache]: Analyzing trace with hash 80596, now seen corresponding path program 1 times [2022-07-14 15:38:03,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:38:03,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121539439] [2022-07-14 15:38:03,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:38:03,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:38:03,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:38:03,627 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:38:03,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:38:03,637 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:38:03,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:38:03,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1071559622, now seen corresponding path program 1 times [2022-07-14 15:38:03,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:38:03,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451199025] [2022-07-14 15:38:03,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:38:03,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:38:03,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:38:04,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:38:04,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:38:04,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451199025] [2022-07-14 15:38:04,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451199025] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:38:04,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:38:04,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 15:38:04,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115058848] [2022-07-14 15:38:04,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:38:04,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:38:04,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 15:38:04,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-14 15:38:04,146 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. cyclomatic complexity: 1 Second operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:38:04,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:38:04,357 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2022-07-14 15:38:04,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 15:38:04,358 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 13 transitions. [2022-07-14 15:38:04,358 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-14 15:38:04,358 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 0 states and 0 transitions. [2022-07-14 15:38:04,359 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-14 15:38:04,359 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-14 15:38:04,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-14 15:38:04,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:38:04,359 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 15:38:04,359 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 15:38:04,359 INFO L374 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 15:38:04,359 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-14 15:38:04,360 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-14 15:38:04,360 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-14 15:38:04,360 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-14 15:38:04,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.07 03:38:04 BoogieIcfgContainer [2022-07-14 15:38:04,366 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-14 15:38:04,366 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-14 15:38:04,366 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-14 15:38:04,366 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-14 15:38:04,367 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:38:02" (3/4) ... [2022-07-14 15:38:04,370 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-14 15:38:04,370 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-14 15:38:04,371 INFO L158 Benchmark]: Toolchain (without parser) took 2645.17ms. Allocated memory was 102.8MB in the beginning and 127.9MB in the end (delta: 25.2MB). Free memory was 70.6MB in the beginning and 46.9MB in the end (delta: 23.8MB). Peak memory consumption was 48.9MB. Max. memory is 16.1GB. [2022-07-14 15:38:04,372 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 102.8MB. Free memory was 59.3MB in the beginning and 59.3MB in the end (delta: 48.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 15:38:04,377 INFO L158 Benchmark]: CACSL2BoogieTranslator took 424.67ms. Allocated memory was 102.8MB in the beginning and 127.9MB in the end (delta: 25.2MB). Free memory was 70.4MB in the beginning and 92.5MB in the end (delta: -22.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-14 15:38:04,378 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.82ms. Allocated memory is still 127.9MB. Free memory was 92.1MB in the beginning and 90.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 15:38:04,379 INFO L158 Benchmark]: Boogie Preprocessor took 35.19ms. Allocated memory is still 127.9MB. Free memory was 90.0MB in the beginning and 88.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 15:38:04,380 INFO L158 Benchmark]: RCFGBuilder took 466.73ms. Allocated memory is still 127.9MB. Free memory was 88.3MB in the beginning and 72.3MB in the end (delta: 16.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-14 15:38:04,380 INFO L158 Benchmark]: BuchiAutomizer took 1638.47ms. Allocated memory is still 127.9MB. Free memory was 103.1MB in the beginning and 46.9MB in the end (delta: 56.2MB). Peak memory consumption was 55.4MB. Max. memory is 16.1GB. [2022-07-14 15:38:04,381 INFO L158 Benchmark]: Witness Printer took 3.74ms. Allocated memory is still 127.9MB. Free memory is still 46.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 15:38:04,390 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 102.8MB. Free memory was 59.3MB in the beginning and 59.3MB in the end (delta: 48.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 424.67ms. Allocated memory was 102.8MB in the beginning and 127.9MB in the end (delta: 25.2MB). Free memory was 70.4MB in the beginning and 92.5MB in the end (delta: -22.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.82ms. Allocated memory is still 127.9MB. Free memory was 92.1MB in the beginning and 90.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.19ms. Allocated memory is still 127.9MB. Free memory was 90.0MB in the beginning and 88.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 466.73ms. Allocated memory is still 127.9MB. Free memory was 88.3MB in the beginning and 72.3MB in the end (delta: 16.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 1638.47ms. Allocated memory is still 127.9MB. Free memory was 103.1MB in the beginning and 46.9MB in the end (delta: 56.2MB). Peak memory consumption was 55.4MB. Max. memory is 16.1GB. * Witness Printer took 3.74ms. Allocated memory is still 127.9MB. Free memory is still 46.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (2 trivial, 0 deterministic, 0 nondeterministic). 2 modules have a trivial ranking function, the largest among these consists of 9 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.5s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 43 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 43 mSDsluCounter, 75 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 49 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 49 IncrementalHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 26 mSDtfsCounter, 49 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-07-14 15:38:04,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (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