./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 3a877d22 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-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 17:09:47,536 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 17:09:47,538 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 17:09:47,571 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 17:09:47,572 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 17:09:47,574 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 17:09:47,575 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 17:09:47,578 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 17:09:47,579 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 17:09:47,583 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 17:09:47,584 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 17:09:47,585 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 17:09:47,585 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 17:09:47,587 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 17:09:47,588 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 17:09:47,591 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 17:09:47,592 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 17:09:47,593 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 17:09:47,594 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 17:09:47,598 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 17:09:47,599 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 17:09:47,600 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 17:09:47,601 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 17:09:47,602 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 17:09:47,603 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 17:09:47,603 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 17:09:47,604 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 17:09:47,605 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 17:09:47,605 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 17:09:47,606 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 17:09:47,606 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 17:09:47,606 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 17:09:47,607 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 17:09:47,608 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 17:09:47,609 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 17:09:47,609 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 17:09:47,610 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 17:09:47,610 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 17:09:47,610 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 17:09:47,610 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 17:09:47,611 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 17:09:47,612 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-15 17:09:47,635 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 17:09:47,636 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 17:09:47,636 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 17:09:47,636 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 17:09:47,637 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 17:09:47,637 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 17:09:47,637 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 17:09:47,638 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-15 17:09:47,638 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-15 17:09:47,638 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-15 17:09:47,638 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-15 17:09:47,639 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-15 17:09:47,639 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-15 17:09:47,639 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 17:09:47,639 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 17:09:47,639 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 17:09:47,639 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 17:09:47,639 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 17:09:47,640 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 17:09:47,640 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-15 17:09:47,640 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-15 17:09:47,640 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-15 17:09:47,640 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 17:09:47,640 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 17:09:47,640 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-15 17:09:47,640 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 17:09:47,641 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-15 17:09:47,641 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 17:09:47,641 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 17:09:47,641 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 17:09:47,641 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 17:09:47,641 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 17:09:47,642 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-15 17:09:47,642 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 [2021-12-15 17:09:47,848 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 17:09:47,864 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 17:09:47,866 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 17:09:47,867 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 17:09:47,867 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 17:09:47,868 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 [2021-12-15 17:09:47,915 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e8456491/d18f5baacdc444348bf84abf25c87580/FLAGfb11eb382 [2021-12-15 17:09:48,267 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 17:09:48,268 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_add-1.i [2021-12-15 17:09:48,277 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e8456491/d18f5baacdc444348bf84abf25c87580/FLAGfb11eb382 [2021-12-15 17:09:48,631 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e8456491/d18f5baacdc444348bf84abf25c87580 [2021-12-15 17:09:48,633 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 17:09:48,634 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 17:09:48,635 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 17:09:48,635 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 17:09:48,638 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 17:09:48,638 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:09:48" (1/1) ... [2021-12-15 17:09:48,639 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@566dd187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:09:48, skipping insertion in model container [2021-12-15 17:09:48,639 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:09:48" (1/1) ... [2021-12-15 17:09:48,644 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 17:09:48,669 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 17:09:48,896 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] [2021-12-15 17:09:48,897 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:09:48,903 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 17:09:48,943 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] [2021-12-15 17:09:48,943 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:09:48,963 INFO L208 MainTranslator]: Completed translation [2021-12-15 17:09:48,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:09:48 WrapperNode [2021-12-15 17:09:48,964 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 17:09:48,965 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 17:09:48,965 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 17:09:48,965 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 17:09:48,970 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:09:48" (1/1) ... [2021-12-15 17:09:48,997 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:09:48" (1/1) ... [2021-12-15 17:09:49,013 INFO L137 Inliner]: procedures = 135, calls = 46, calls flagged for inlining = 15, calls inlined = 10, statements flattened = 105 [2021-12-15 17:09:49,014 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 17:09:49,014 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 17:09:49,014 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 17:09:49,015 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 17:09:49,020 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:09:48" (1/1) ... [2021-12-15 17:09:49,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:09:48" (1/1) ... [2021-12-15 17:09:49,025 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:09:48" (1/1) ... [2021-12-15 17:09:49,026 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:09:48" (1/1) ... [2021-12-15 17:09:49,033 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:09:48" (1/1) ... [2021-12-15 17:09:49,037 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:09:48" (1/1) ... [2021-12-15 17:09:49,038 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:09:48" (1/1) ... [2021-12-15 17:09:49,040 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 17:09:49,041 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 17:09:49,041 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 17:09:49,041 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 17:09:49,047 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:09:48" (1/1) ... [2021-12-15 17:09:49,052 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:09:49,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:09:49,070 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) [2021-12-15 17:09:49,079 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 [2021-12-15 17:09:49,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-15 17:09:49,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-15 17:09:49,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-15 17:09:49,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 17:09:49,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-15 17:09:49,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-15 17:09:49,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-15 17:09:49,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 17:09:49,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 17:09:49,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 17:09:49,208 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 17:09:49,214 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 17:09:49,394 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 17:09:49,399 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 17:09:49,399 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-15 17:09:49,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:09:49 BoogieIcfgContainer [2021-12-15 17:09:49,400 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 17:09:49,401 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-15 17:09:49,401 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-15 17:09:49,403 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-15 17:09:49,404 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:09:49,404 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.12 05:09:48" (1/3) ... [2021-12-15 17:09:49,405 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@420df186 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:09:49, skipping insertion in model container [2021-12-15 17:09:49,405 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:09:49,405 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:09:48" (2/3) ... [2021-12-15 17:09:49,405 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@420df186 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:09:49, skipping insertion in model container [2021-12-15 17:09:49,405 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:09:49,405 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:09:49" (3/3) ... [2021-12-15 17:09:49,406 INFO L388 chiAutomizerObserver]: Analyzing ICFG test_add-1.i [2021-12-15 17:09:49,445 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-15 17:09:49,445 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-15 17:09:49,445 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-15 17:09:49,445 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-15 17:09:49,445 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-15 17:09:49,446 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-15 17:09:49,446 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-15 17:09:49,446 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-15 17:09:49,458 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) [2021-12-15 17:09:49,475 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-12-15 17:09:49,475 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:09:49,475 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:09:49,481 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:09:49,481 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:09:49,482 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-15 17:09:49,482 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) [2021-12-15 17:09:49,485 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-12-15 17:09:49,486 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:09:49,486 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:09:49,486 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:09:49,486 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:09:49,491 INFO L791 eck$LassoCheckResult]: Stem: 5#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); 9#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; 7#L652-3true [2021-12-15 17:09:49,491 INFO L793 eck$LassoCheckResult]: Loop: 7#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); 20#L653true assume !(ldv_is_in_set_#t~mem25#1 == ldv_is_in_set_~e#1);havoc ldv_is_in_set_#t~mem25#1; 16#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; 7#L652-3true [2021-12-15 17:09:49,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:09:49,502 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-12-15 17:09:49,507 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:09:49,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939816833] [2021-12-15 17:09:49,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:09:49,509 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:09:49,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:09:49,596 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:09:49,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:09:49,633 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:09:49,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:09:49,635 INFO L85 PathProgramCache]: Analyzing trace with hash 39883, now seen corresponding path program 1 times [2021-12-15 17:09:49,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:09:49,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513366543] [2021-12-15 17:09:49,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:09:49,636 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:09:49,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:09:49,647 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:09:49,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:09:49,655 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:09:49,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:09:49,659 INFO L85 PathProgramCache]: Analyzing trace with hash 28698825, now seen corresponding path program 1 times [2021-12-15 17:09:49,659 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:09:49,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524047632] [2021-12-15 17:09:49,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:09:49,659 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:09:49,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:09:49,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:09:49,728 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:09:49,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524047632] [2021-12-15 17:09:49,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524047632] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:09:49,729 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:09:49,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:09:49,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791989376] [2021-12-15 17:09:49,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:09:49,890 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:09:49,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 17:09:49,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 17:09:49,914 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) [2021-12-15 17:09:49,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:09:49,985 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2021-12-15 17:09:49,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 17:09:49,989 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 32 transitions. [2021-12-15 17:09:49,990 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:09:49,995 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 15 states and 15 transitions. [2021-12-15 17:09:49,996 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2021-12-15 17:09:49,996 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2021-12-15 17:09:49,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 15 transitions. [2021-12-15 17:09:49,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:09:49,997 INFO L681 BuchiCegarLoop]: Abstraction has 15 states and 15 transitions. [2021-12-15 17:09:50,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 15 transitions. [2021-12-15 17:09:50,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2021-12-15 17:09:50,013 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) [2021-12-15 17:09:50,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2021-12-15 17:09:50,014 INFO L704 BuchiCegarLoop]: Abstraction has 15 states and 15 transitions. [2021-12-15 17:09:50,014 INFO L587 BuchiCegarLoop]: Abstraction has 15 states and 15 transitions. [2021-12-15 17:09:50,014 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-15 17:09:50,015 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 15 transitions. [2021-12-15 17:09:50,017 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:09:50,017 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:09:50,017 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:09:50,017 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:09:50,017 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:09:50,018 INFO L791 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 [2021-12-15 17:09:50,019 INFO L793 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 [2021-12-15 17:09:50,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:09:50,022 INFO L85 PathProgramCache]: Analyzing trace with hash -812001189, now seen corresponding path program 1 times [2021-12-15 17:09:50,022 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:09:50,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968082178] [2021-12-15 17:09:50,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:09:50,023 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:09:50,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:09:50,105 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:09:50,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:09:50,158 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:09:50,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:09:50,158 INFO L85 PathProgramCache]: Analyzing trace with hash 80596, now seen corresponding path program 1 times [2021-12-15 17:09:50,159 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:09:50,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378719730] [2021-12-15 17:09:50,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:09:50,159 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:09:50,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:09:50,177 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:09:50,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:09:50,184 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:09:50,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:09:50,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1071559622, now seen corresponding path program 1 times [2021-12-15 17:09:50,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:09:50,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226863241] [2021-12-15 17:09:50,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:09:50,186 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:09:50,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:09:50,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:09:50,562 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:09:50,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226863241] [2021-12-15 17:09:50,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226863241] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:09:50,563 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:09:50,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-15 17:09:50,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255093250] [2021-12-15 17:09:50,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:09:50,661 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:09:50,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-15 17:09:50,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-15 17:09:50,662 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) [2021-12-15 17:09:50,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:09:50,872 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2021-12-15 17:09:50,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 17:09:50,873 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 13 transitions. [2021-12-15 17:09:50,873 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-15 17:09:50,874 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 0 states and 0 transitions. [2021-12-15 17:09:50,874 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-12-15 17:09:50,874 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-12-15 17:09:50,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-12-15 17:09:50,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:09:50,874 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-15 17:09:50,874 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-15 17:09:50,874 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-15 17:09:50,874 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-15 17:09:50,874 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-12-15 17:09:50,874 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-15 17:09:50,874 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-12-15 17:09:50,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.12 05:09:50 BoogieIcfgContainer [2021-12-15 17:09:50,879 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-12-15 17:09:50,880 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-15 17:09:50,880 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-15 17:09:50,880 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-15 17:09:50,880 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:09:49" (3/4) ... [2021-12-15 17:09:50,883 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-15 17:09:50,883 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-15 17:09:50,884 INFO L158 Benchmark]: Toolchain (without parser) took 2249.06ms. Allocated memory is still 107.0MB. Free memory was 66.6MB in the beginning and 48.7MB in the end (delta: 17.9MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2021-12-15 17:09:50,884 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 107.0MB. Free memory is still 84.8MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:09:50,885 INFO L158 Benchmark]: CACSL2BoogieTranslator took 329.27ms. Allocated memory is still 107.0MB. Free memory was 66.4MB in the beginning and 78.2MB in the end (delta: -11.9MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. [2021-12-15 17:09:50,888 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.03ms. Allocated memory is still 107.0MB. Free memory was 78.2MB in the beginning and 76.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:09:50,889 INFO L158 Benchmark]: Boogie Preprocessor took 25.94ms. Allocated memory is still 107.0MB. Free memory was 76.1MB in the beginning and 74.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:09:50,889 INFO L158 Benchmark]: RCFGBuilder took 359.29ms. Allocated memory is still 107.0MB. Free memory was 74.0MB in the beginning and 58.3MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2021-12-15 17:09:50,890 INFO L158 Benchmark]: BuchiAutomizer took 1478.33ms. Allocated memory is still 107.0MB. Free memory was 58.3MB in the beginning and 48.7MB in the end (delta: 9.6MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. [2021-12-15 17:09:50,890 INFO L158 Benchmark]: Witness Printer took 3.14ms. Allocated memory is still 107.0MB. Free memory is still 48.7MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:09:50,895 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.15ms. Allocated memory is still 107.0MB. Free memory is still 84.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 329.27ms. Allocated memory is still 107.0MB. Free memory was 66.4MB in the beginning and 78.2MB in the end (delta: -11.9MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.03ms. Allocated memory is still 107.0MB. Free memory was 78.2MB in the beginning and 76.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.94ms. Allocated memory is still 107.0MB. Free memory was 76.1MB in the beginning and 74.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 359.29ms. Allocated memory is still 107.0MB. Free memory was 74.0MB in the beginning and 58.3MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 1478.33ms. Allocated memory is still 107.0MB. Free memory was 58.3MB in the beginning and 48.7MB in the end (delta: 9.6MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. * Witness Printer took 3.14ms. Allocated memory is still 107.0MB. Free memory is still 48.7MB. 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.4s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.0s. 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 15 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.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 43 mSDsluCounter, 76 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 50 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 48 IncrementalHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 26 mSDtfsCounter, 48 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 - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2021-12-15 17:09:50,927 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