./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test18_2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 20ed64ec 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-memsafety/memleaks_test18_2.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 25c50494ad64d3207b5cd57d9b83fbf1aea0c348 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 17:41:27,696 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 17:41:27,698 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 17:41:27,737 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 17:41:27,738 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 17:41:27,741 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 17:41:27,742 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 17:41:27,747 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 17:41:27,749 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 17:41:27,753 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 17:41:27,754 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 17:41:27,757 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 17:41:27,758 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 17:41:27,760 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 17:41:27,761 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 17:41:27,764 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 17:41:27,765 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 17:41:27,766 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 17:41:27,768 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 17:41:27,773 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 17:41:27,774 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 17:41:27,775 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 17:41:27,776 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 17:41:27,777 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 17:41:27,783 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 17:41:27,783 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 17:41:27,783 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 17:41:27,785 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 17:41:27,785 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 17:41:27,786 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 17:41:27,786 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 17:41:27,787 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 17:41:27,788 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 17:41:27,789 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 17:41:27,790 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 17:41:27,790 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 17:41:27,791 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 17:41:27,791 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 17:41:27,791 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 17:41:27,793 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 17:41:27,793 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 17:41:27,794 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-27 17:41:27,831 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 17:41:27,831 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 17:41:27,832 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 17:41:27,833 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 17:41:27,834 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 17:41:27,834 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 17:41:27,835 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 17:41:27,835 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-27 17:41:27,835 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-27 17:41:27,835 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-27 17:41:27,836 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-27 17:41:27,836 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-27 17:41:27,836 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-27 17:41:27,844 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 17:41:27,844 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 17:41:27,844 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 17:41:27,844 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 17:41:27,844 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 17:41:27,845 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 17:41:27,845 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-27 17:41:27,845 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-27 17:41:27,845 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-27 17:41:27,845 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 17:41:27,845 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-27 17:41:27,845 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-27 17:41:27,846 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 17:41:27,846 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-27 17:41:27,846 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 17:41:27,846 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 17:41:27,846 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 17:41:27,846 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 17:41:27,847 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 17:41:27,848 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-27 17:41:27,848 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 -> 25c50494ad64d3207b5cd57d9b83fbf1aea0c348 [2021-08-27 17:41:28,164 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 17:41:28,183 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 17:41:28,185 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 17:41:28,186 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 17:41:28,187 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 17:41:28,188 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test18_2.i [2021-08-27 17:41:28,242 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29f8cc451/628770def7c949ada79e26b292d66030/FLAGcfc593c50 [2021-08-27 17:41:28,825 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 17:41:28,825 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test18_2.i [2021-08-27 17:41:28,842 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29f8cc451/628770def7c949ada79e26b292d66030/FLAGcfc593c50 [2021-08-27 17:41:29,091 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29f8cc451/628770def7c949ada79e26b292d66030 [2021-08-27 17:41:29,093 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 17:41:29,095 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-27 17:41:29,098 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 17:41:29,098 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 17:41:29,101 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 17:41:29,101 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 05:41:29" (1/1) ... [2021-08-27 17:41:29,102 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d281de4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:41:29, skipping insertion in model container [2021-08-27 17:41:29,102 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 05:41:29" (1/1) ... [2021-08-27 17:41:29,108 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 17:41:29,159 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 17:41:29,507 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 17:41:29,537 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 17:41:29,598 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 17:41:29,633 INFO L208 MainTranslator]: Completed translation [2021-08-27 17:41:29,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:41:29 WrapperNode [2021-08-27 17:41:29,634 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 17:41:29,635 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-27 17:41:29,635 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-27 17:41:29,635 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-27 17:41:29,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:41:29" (1/1) ... [2021-08-27 17:41:29,656 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:41:29" (1/1) ... [2021-08-27 17:41:29,672 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-27 17:41:29,675 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 17:41:29,675 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 17:41:29,675 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 17:41:29,682 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:41:29" (1/1) ... [2021-08-27 17:41:29,682 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:41:29" (1/1) ... [2021-08-27 17:41:29,695 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:41:29" (1/1) ... [2021-08-27 17:41:29,696 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:41:29" (1/1) ... [2021-08-27 17:41:29,701 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:41:29" (1/1) ... [2021-08-27 17:41:29,713 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:41:29" (1/1) ... [2021-08-27 17:41:29,716 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:41:29" (1/1) ... [2021-08-27 17:41:29,722 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 17:41:29,723 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 17:41:29,723 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 17:41:29,724 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 17:41:29,725 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:41:29" (1/1) ... [2021-08-27 17:41:29,730 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:41:29,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:41:29,750 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-08-27 17:41:29,765 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-08-27 17:41:29,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-27 17:41:29,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-27 17:41:29,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 17:41:29,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-27 17:41:29,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 17:41:29,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-08-27 17:41:29,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 17:41:29,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 17:41:30,055 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 17:41:30,055 INFO L299 CfgBuilder]: Removed 12 assume(true) statements. [2021-08-27 17:41:30,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:41:30 BoogieIcfgContainer [2021-08-27 17:41:30,057 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 17:41:30,058 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-27 17:41:30,058 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-27 17:41:30,060 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-27 17:41:30,061 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 17:41:30,061 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.08 05:41:29" (1/3) ... [2021-08-27 17:41:30,062 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6e33ebee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 05:41:30, skipping insertion in model container [2021-08-27 17:41:30,062 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 17:41:30,062 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:41:29" (2/3) ... [2021-08-27 17:41:30,062 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6e33ebee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 05:41:30, skipping insertion in model container [2021-08-27 17:41:30,063 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 17:41:30,063 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:41:30" (3/3) ... [2021-08-27 17:41:30,064 INFO L389 chiAutomizerObserver]: Analyzing ICFG memleaks_test18_2.i [2021-08-27 17:41:30,099 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-27 17:41:30,099 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-27 17:41:30,099 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-27 17:41:30,100 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-27 17:41:30,100 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-27 17:41:30,100 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-27 17:41:30,100 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-27 17:41:30,100 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-27 17:41:30,111 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 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-08-27 17:41:30,125 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2021-08-27 17:41:30,125 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:41:30,126 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:41:30,130 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-08-27 17:41:30,130 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-08-27 17:41:30,130 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-27 17:41:30,131 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 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-08-27 17:41:30,132 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2021-08-27 17:41:30,132 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:41:30,132 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:41:30,133 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-08-27 17:41:30,133 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-08-27 17:41:30,136 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 9#L-1true havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 13#L526true assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 6#L529true entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 7#L766true assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 11#L767-3true [2021-08-27 17:41:30,137 INFO L793 eck$LassoCheckResult]: Loop: 11#L767-3true assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 17#L526-1true assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset;havoc ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 18#L529-1true entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 15#L769true assume !(entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0);call write~$Pointer$(entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~0, 4); 12#L767-2true entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 11#L767-3true [2021-08-27 17:41:30,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:41:30,142 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2021-08-27 17:41:30,149 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:41:30,149 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596751650] [2021-08-27 17:41:30,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:41:30,150 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:41:30,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:41:30,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:41:30,384 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:41:30,385 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596751650] [2021-08-27 17:41:30,385 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596751650] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 17:41:30,386 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 17:41:30,386 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 17:41:30,387 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569011431] [2021-08-27 17:41:30,400 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:41:30,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:41:30,401 INFO L82 PathProgramCache]: Analyzing trace with hash 49720347, now seen corresponding path program 1 times [2021-08-27 17:41:30,401 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:41:30,402 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417532525] [2021-08-27 17:41:30,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:41:30,402 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:41:30,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:41:30,420 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:41:30,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:41:30,475 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:41:30,862 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:41:30,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 17:41:30,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 17:41:30,876 INFO L87 Difference]: Start difference. First operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 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, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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-08-27 17:41:30,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:41:30,928 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2021-08-27 17:41:30,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 17:41:30,930 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 37 transitions. [2021-08-27 17:41:30,938 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2021-08-27 17:41:30,942 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 20 states and 23 transitions. [2021-08-27 17:41:30,942 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-08-27 17:41:30,943 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-08-27 17:41:30,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2021-08-27 17:41:30,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:41:30,944 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2021-08-27 17:41:30,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2021-08-27 17:41:30,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 13. [2021-08-27 17:41:30,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 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-08-27 17:41:30,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2021-08-27 17:41:30,965 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2021-08-27 17:41:30,966 INFO L587 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2021-08-27 17:41:30,966 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-27 17:41:30,966 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2021-08-27 17:41:30,967 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2021-08-27 17:41:30,967 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:41:30,968 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:41:30,968 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-08-27 17:41:30,968 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-08-27 17:41:30,969 INFO L791 eck$LassoCheckResult]: Stem: 60#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 61#L-1 havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 68#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset;havoc ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 65#L529 entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 66#L766 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 67#L767-3 [2021-08-27 17:41:30,969 INFO L793 eck$LassoCheckResult]: Loop: 67#L767-3 assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 69#L526-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset;havoc ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 72#L529-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 71#L769 assume !(entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0);call write~$Pointer$(entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~0, 4); 70#L767-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 67#L767-3 [2021-08-27 17:41:30,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:41:30,970 INFO L82 PathProgramCache]: Analyzing trace with hash 28693831, now seen corresponding path program 1 times [2021-08-27 17:41:30,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:41:30,971 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396736985] [2021-08-27 17:41:30,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:41:30,971 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:41:31,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:41:31,002 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:41:31,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:41:31,015 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:41:31,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:41:31,015 INFO L82 PathProgramCache]: Analyzing trace with hash 49720347, now seen corresponding path program 2 times [2021-08-27 17:41:31,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:41:31,016 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404631259] [2021-08-27 17:41:31,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:41:31,016 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:41:31,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:41:31,025 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:41:31,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:41:31,036 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:41:31,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:41:31,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1173278059, now seen corresponding path program 1 times [2021-08-27 17:41:31,037 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:41:31,037 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798431167] [2021-08-27 17:41:31,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:41:31,037 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:41:31,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:41:31,051 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:41:31,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:41:31,068 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:41:31,648 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 17:41:31,648 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 17:41:31,649 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 17:41:31,649 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 17:41:31,649 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 17:41:31,649 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:41:31,649 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 17:41:31,649 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 17:41:31,649 INFO L133 ssoRankerPreferences]: Filename of dumped script: memleaks_test18_2.i_Iteration2_Lasso [2021-08-27 17:41:31,650 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 17:41:31,650 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 17:41:31,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:41:31,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:41:31,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:41:31,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:41:31,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:41:31,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:41:31,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:41:31,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:41:31,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:41:31,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:41:31,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:41:31,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:41:31,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:41:31,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:41:31,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:41:31,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:41:31,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:41:31,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:41:31,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:41:31,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:41:32,430 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 17:41:32,434 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 17:41:32,435 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:41:32,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:41:32,442 INFO L229 MonitoredProcess]: Starting monitored process 2 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-08-27 17:41:32,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-08-27 17:41:32,446 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:41:32,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:41:32,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:41:32,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:41:32,453 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:41:32,457 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:41:32,457 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:41:32,473 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:41:32,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-08-27 17:41:32,504 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:41:32,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:41:32,521 INFO L229 MonitoredProcess]: Starting monitored process 3 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-08-27 17:41:32,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-08-27 17:41:32,525 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:41:32,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:41:32,535 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:41:32,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:41:32,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:41:32,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:41:32,536 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:41:32,537 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:41:32,546 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:41:32,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-08-27 17:41:32,567 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:41:32,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:41:32,568 INFO L229 MonitoredProcess]: Starting monitored process 4 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-08-27 17:41:32,573 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:41:32,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:41:32,580 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:41:32,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:41:32,581 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:41:32,581 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:41:32,581 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:41:32,581 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:41:32,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-08-27 17:41:32,589 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:41:32,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-08-27 17:41:32,606 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:41:32,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:41:32,607 INFO L229 MonitoredProcess]: Starting monitored process 5 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-08-27 17:41:32,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-08-27 17:41:32,609 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:41:32,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:41:32,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:41:32,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:41:32,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:41:32,632 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:41:32,632 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:41:32,652 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 17:41:32,704 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2021-08-27 17:41:32,705 INFO L444 ModelExtractionUtils]: 18 out of 40 variables were initially zero. Simplification set additionally 19 variables to zero. [2021-08-27 17:41:32,706 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:41:32,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:41:32,723 INFO L229 MonitoredProcess]: Starting monitored process 6 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-08-27 17:41:32,763 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 17:41:32,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-08-27 17:41:32,786 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-27 17:41:32,786 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 17:41:32,787 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_entry_point_~len~0, ULTIMATE.start_entry_point_~i~0) = 1*ULTIMATE.start_entry_point_~len~0 - 1*ULTIMATE.start_entry_point_~i~0 Supporting invariants [] [2021-08-27 17:41:32,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-08-27 17:41:32,824 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2021-08-27 17:41:32,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:41:32,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:41:32,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 17:41:32,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:41:32,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:41:32,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 17:41:32,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:41:32,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:41:32,949 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-08-27 17:41:32,950 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:41:32,976 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 4. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 21 states and 26 transitions. Complement of second has 4 states. [2021-08-27 17:41:32,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2021-08-27 17:41:32,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:41:32,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2021-08-27 17:41:32,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 5 letters. Loop has 5 letters. [2021-08-27 17:41:32,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:41:32,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 5 letters. [2021-08-27 17:41:32,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:41:32,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 5 letters. Loop has 10 letters. [2021-08-27 17:41:32,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:41:32,980 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. [2021-08-27 17:41:32,981 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-27 17:41:32,981 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 21 transitions. [2021-08-27 17:41:32,982 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2021-08-27 17:41:32,982 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2021-08-27 17:41:32,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 21 transitions. [2021-08-27 17:41:32,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 17:41:32,982 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2021-08-27 17:41:32,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 21 transitions. [2021-08-27 17:41:32,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-08-27 17:41:32,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 states have internal predecessors, (21), 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-08-27 17:41:32,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2021-08-27 17:41:32,984 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2021-08-27 17:41:32,984 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2021-08-27 17:41:32,984 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-27 17:41:32,988 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2021-08-27 17:41:32,990 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-27 17:41:32,990 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:41:32,990 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:41:32,991 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:41:32,991 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:41:32,991 INFO L791 eck$LassoCheckResult]: Stem: 164#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 165#L-1 havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 172#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset;havoc ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 169#L529 entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 170#L766 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 171#L767-3 assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 174#L526-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 179#L529-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 177#L769 assume entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0; 166#L769-1 entry_point_~j~0 := entry_point_~i~0 - 1; 167#L774-3 [2021-08-27 17:41:32,991 INFO L793 eck$LassoCheckResult]: Loop: 167#L774-3 assume !!(entry_point_~j~0 >= 0);call entry_point_#t~mem42.base, entry_point_#t~mem42.offset := read~$Pointer$(entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~j~0, 4);call ULTIMATE.dealloc(entry_point_#t~mem42.base, entry_point_#t~mem42.offset);havoc entry_point_#t~mem42.base, entry_point_#t~mem42.offset; 168#L774-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 167#L774-3 [2021-08-27 17:41:32,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:41:32,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1173218534, now seen corresponding path program 1 times [2021-08-27 17:41:32,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:41:32,992 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628740456] [2021-08-27 17:41:32,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:41:32,993 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:41:33,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:41:33,019 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:41:33,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:41:33,034 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:41:33,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:41:33,037 INFO L82 PathProgramCache]: Analyzing trace with hash 2531, now seen corresponding path program 1 times [2021-08-27 17:41:33,037 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:41:33,037 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800276399] [2021-08-27 17:41:33,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:41:33,038 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:41:33,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:41:33,054 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:41:33,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:41:33,064 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:41:33,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:41:33,066 INFO L82 PathProgramCache]: Analyzing trace with hash 2113389244, now seen corresponding path program 1 times [2021-08-27 17:41:33,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:41:33,067 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762792144] [2021-08-27 17:41:33,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:41:33,067 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:41:33,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:41:33,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:41:33,112 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:41:33,113 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762792144] [2021-08-27 17:41:33,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762792144] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 17:41:33,114 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 17:41:33,114 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 17:41:33,114 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819014959] [2021-08-27 17:41:33,165 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:41:33,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 17:41:33,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 17:41:33,167 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:41:33,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-08-27 17:41:33,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:41:33,201 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2021-08-27 17:41:33,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 17:41:33,202 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 31 transitions. [2021-08-27 17:41:33,210 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-27 17:41:33,211 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 21 states and 25 transitions. [2021-08-27 17:41:33,211 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2021-08-27 17:41:33,212 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2021-08-27 17:41:33,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 25 transitions. [2021-08-27 17:41:33,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 17:41:33,213 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2021-08-27 17:41:33,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 25 transitions. [2021-08-27 17:41:33,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2021-08-27 17:41:33,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 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-08-27 17:41:33,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2021-08-27 17:41:33,215 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2021-08-27 17:41:33,215 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2021-08-27 17:41:33,215 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-27 17:41:33,216 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2021-08-27 17:41:33,216 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-27 17:41:33,216 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:41:33,216 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:41:33,217 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:41:33,217 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:41:33,217 INFO L791 eck$LassoCheckResult]: Stem: 218#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 219#L-1 havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 226#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset;havoc ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 222#L529 entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 223#L766 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 224#L767-3 assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 227#L526-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 234#L529-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 232#L769 assume !(entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0);call write~$Pointer$(entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~0, 4); 230#L767-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 228#L767-3 assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 229#L526-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 233#L529-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 231#L769 assume entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0; 220#L769-1 entry_point_~j~0 := entry_point_~i~0 - 1; 221#L774-3 [2021-08-27 17:41:33,217 INFO L793 eck$LassoCheckResult]: Loop: 221#L774-3 assume !!(entry_point_~j~0 >= 0);call entry_point_#t~mem42.base, entry_point_#t~mem42.offset := read~$Pointer$(entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~j~0, 4);call ULTIMATE.dealloc(entry_point_#t~mem42.base, entry_point_#t~mem42.offset);havoc entry_point_#t~mem42.base, entry_point_#t~mem42.offset; 225#L774-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 221#L774-3 [2021-08-27 17:41:33,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:41:33,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1659616398, now seen corresponding path program 1 times [2021-08-27 17:41:33,218 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:41:33,222 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070648799] [2021-08-27 17:41:33,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:41:33,222 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:41:33,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:41:33,286 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:41:33,286 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:41:33,286 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070648799] [2021-08-27 17:41:33,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070648799] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 17:41:33,287 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 17:41:33,287 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 17:41:33,287 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431877014] [2021-08-27 17:41:33,287 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:41:33,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:41:33,288 INFO L82 PathProgramCache]: Analyzing trace with hash 2531, now seen corresponding path program 2 times [2021-08-27 17:41:33,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:41:33,288 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044182528] [2021-08-27 17:41:33,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:41:33,289 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:41:33,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:41:33,295 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:41:33,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:41:33,306 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:41:33,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:41:33,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 17:41:33,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 17:41:33,341 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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-08-27 17:41:33,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:41:33,370 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2021-08-27 17:41:33,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 17:41:33,370 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 26 transitions. [2021-08-27 17:41:33,372 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-08-27 17:41:33,372 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 22 states and 24 transitions. [2021-08-27 17:41:33,372 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-08-27 17:41:33,373 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-08-27 17:41:33,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 24 transitions. [2021-08-27 17:41:33,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 17:41:33,374 INFO L681 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2021-08-27 17:41:33,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 24 transitions. [2021-08-27 17:41:33,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2021-08-27 17:41:33,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 16 states have internal predecessors, (19), 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-08-27 17:41:33,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2021-08-27 17:41:33,377 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2021-08-27 17:41:33,377 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2021-08-27 17:41:33,377 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-27 17:41:33,377 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2021-08-27 17:41:33,377 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-27 17:41:33,378 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:41:33,378 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:41:33,378 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:41:33,379 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:41:33,379 INFO L791 eck$LassoCheckResult]: Stem: 268#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 269#L-1 havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 276#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset;havoc ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 273#L529 entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 274#L766 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 275#L767-3 assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 277#L526-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset;havoc ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 284#L529-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 282#L769 assume !(entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0);call write~$Pointer$(entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~0, 4); 280#L767-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 278#L767-3 assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 279#L526-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 283#L529-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 281#L769 assume entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0; 270#L769-1 entry_point_~j~0 := entry_point_~i~0 - 1; 271#L774-3 [2021-08-27 17:41:33,379 INFO L793 eck$LassoCheckResult]: Loop: 271#L774-3 assume !!(entry_point_~j~0 >= 0);call entry_point_#t~mem42.base, entry_point_#t~mem42.offset := read~$Pointer$(entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~j~0, 4);call ULTIMATE.dealloc(entry_point_#t~mem42.base, entry_point_#t~mem42.offset);havoc entry_point_#t~mem42.base, entry_point_#t~mem42.offset; 272#L774-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 271#L774-3 [2021-08-27 17:41:33,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:41:33,379 INFO L82 PathProgramCache]: Analyzing trace with hash 979558028, now seen corresponding path program 1 times [2021-08-27 17:41:33,379 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:41:33,379 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381752275] [2021-08-27 17:41:33,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:41:33,380 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:41:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:41:33,411 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:41:33,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:41:33,428 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:41:33,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:41:33,432 INFO L82 PathProgramCache]: Analyzing trace with hash 2531, now seen corresponding path program 3 times [2021-08-27 17:41:33,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:41:33,432 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006807849] [2021-08-27 17:41:33,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:41:33,433 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:41:33,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:41:33,438 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:41:33,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:41:33,446 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:41:33,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:41:33,446 INFO L82 PathProgramCache]: Analyzing trace with hash 757428654, now seen corresponding path program 1 times [2021-08-27 17:41:33,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:41:33,446 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664645087] [2021-08-27 17:41:33,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:41:33,447 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:41:33,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:41:33,456 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:41:33,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:41:33,469 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:41:34,261 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 17:41:34,261 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 17:41:34,262 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 17:41:34,262 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 17:41:34,262 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 17:41:34,262 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:41:34,262 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 17:41:34,262 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 17:41:34,262 INFO L133 ssoRankerPreferences]: Filename of dumped script: memleaks_test18_2.i_Iteration5_Lasso [2021-08-27 17:41:34,262 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 17:41:34,263 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 17:41:34,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:41:34,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:41:34,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:41:34,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:41:34,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:41:34,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:41:34,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:41:34,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:41:34,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:41:34,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:41:34,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:41:34,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:41:34,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:41:34,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:41:34,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:41:34,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:41:34,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:41:34,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:41:34,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:41:34,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:41:34,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:41:34,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:41:34,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:41:34,923 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 17:41:34,923 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 17:41:34,924 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:41:34,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:41:34,929 INFO L229 MonitoredProcess]: Starting monitored process 7 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-08-27 17:41:34,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-08-27 17:41:34,933 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:41:34,940 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:41:34,940 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:41:34,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:41:34,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:41:34,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:41:34,941 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:41:34,941 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:41:34,956 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:41:34,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-08-27 17:41:34,982 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:41:34,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:41:34,983 INFO L229 MonitoredProcess]: Starting monitored process 8 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-08-27 17:41:34,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-08-27 17:41:34,985 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:41:34,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:41:34,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:41:34,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:41:34,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:41:34,995 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:41:34,995 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:41:35,007 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:41:35,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-08-27 17:41:35,024 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:41:35,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:41:35,025 INFO L229 MonitoredProcess]: Starting monitored process 9 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-08-27 17:41:35,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-08-27 17:41:35,027 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:41:35,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:41:35,033 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:41:35,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:41:35,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:41:35,033 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:41:35,034 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:41:35,034 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:41:35,035 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:41:35,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-08-27 17:41:35,051 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:41:35,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:41:35,052 INFO L229 MonitoredProcess]: Starting monitored process 10 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-08-27 17:41:35,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-08-27 17:41:35,054 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:41:35,059 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:41:35,059 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:41:35,059 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:41:35,059 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:41:35,061 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:41:35,061 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:41:35,092 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:41:35,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-08-27 17:41:35,117 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:41:35,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:41:35,118 INFO L229 MonitoredProcess]: Starting monitored process 11 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-08-27 17:41:35,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-08-27 17:41:35,123 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:41:35,128 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:41:35,129 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:41:35,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:41:35,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:41:35,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:41:35,129 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:41:35,129 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:41:35,132 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:41:35,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2021-08-27 17:41:35,148 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:41:35,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:41:35,149 INFO L229 MonitoredProcess]: Starting monitored process 12 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-08-27 17:41:35,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-08-27 17:41:35,152 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:41:35,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:41:35,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:41:35,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:41:35,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:41:35,165 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:41:35,165 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:41:35,188 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 17:41:35,208 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2021-08-27 17:41:35,208 INFO L444 ModelExtractionUtils]: 3 out of 22 variables were initially zero. Simplification set additionally 16 variables to zero. [2021-08-27 17:41:35,208 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:41:35,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:41:35,212 INFO L229 MonitoredProcess]: Starting monitored process 13 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-08-27 17:41:35,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-08-27 17:41:35,214 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 17:41:35,220 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-27 17:41:35,220 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 17:41:35,220 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_entry_point_~j~0) = 2*ULTIMATE.start_entry_point_~j~0 + 1 Supporting invariants [] [2021-08-27 17:41:35,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-08-27 17:41:35,255 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2021-08-27 17:41:35,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:41:35,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:41:35,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 17:41:35,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:41:35,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:41:35,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 17:41:35,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:41:35,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:41:35,378 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-08-27 17:41:35,379 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-08-27 17:41:35,387 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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) Result 19 states and 22 transitions. Complement of second has 4 states. [2021-08-27 17:41:35,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2021-08-27 17:41:35,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-08-27 17:41:35,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2021-08-27 17:41:35,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 15 letters. Loop has 2 letters. [2021-08-27 17:41:35,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:41:35,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 17 letters. Loop has 2 letters. [2021-08-27 17:41:35,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:41:35,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 15 letters. Loop has 4 letters. [2021-08-27 17:41:35,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:41:35,389 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 22 transitions. [2021-08-27 17:41:35,390 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-27 17:41:35,390 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. [2021-08-27 17:41:35,390 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-08-27 17:41:35,390 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-08-27 17:41:35,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-08-27 17:41:35,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:41:35,390 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 17:41:35,390 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 17:41:35,390 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 17:41:35,391 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-08-27 17:41:35,391 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-08-27 17:41:35,391 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-27 17:41:35,391 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-08-27 17:41:35,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.08 05:41:35 BoogieIcfgContainer [2021-08-27 17:41:35,396 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-08-27 17:41:35,396 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 17:41:35,396 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 17:41:35,396 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 17:41:35,397 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:41:30" (3/4) ... [2021-08-27 17:41:35,399 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-27 17:41:35,399 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 17:41:35,401 INFO L168 Benchmark]: Toolchain (without parser) took 6304.72 ms. Allocated memory was 60.8 MB in the beginning and 151.0 MB in the end (delta: 90.2 MB). Free memory was 39.7 MB in the beginning and 74.2 MB in the end (delta: -34.6 MB). Peak memory consumption was 56.8 MB. Max. memory is 16.1 GB. [2021-08-27 17:41:35,401 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 60.8 MB. Free memory was 42.9 MB in the beginning and 42.9 MB in the end (delta: 43.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 17:41:35,401 INFO L168 Benchmark]: CACSL2BoogieTranslator took 536.56 ms. Allocated memory is still 60.8 MB. Free memory was 39.5 MB in the beginning and 35.2 MB in the end (delta: 4.2 MB). Peak memory consumption was 17.0 MB. Max. memory is 16.1 GB. [2021-08-27 17:41:35,402 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.27 ms. Allocated memory is still 60.8 MB. Free memory was 35.2 MB in the beginning and 33.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 17:41:35,402 INFO L168 Benchmark]: Boogie Preprocessor took 47.71 ms. Allocated memory is still 60.8 MB. Free memory was 33.1 MB in the beginning and 31.6 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 17:41:35,402 INFO L168 Benchmark]: RCFGBuilder took 334.04 ms. Allocated memory is still 60.8 MB. Free memory was 31.6 MB in the beginning and 33.2 MB in the end (delta: -1.6 MB). Peak memory consumption was 11.3 MB. Max. memory is 16.1 GB. [2021-08-27 17:41:35,403 INFO L168 Benchmark]: BuchiAutomizer took 5338.06 ms. Allocated memory was 60.8 MB in the beginning and 151.0 MB in the end (delta: 90.2 MB). Free memory was 33.0 MB in the beginning and 74.2 MB in the end (delta: -41.3 MB). Peak memory consumption was 49.5 MB. Max. memory is 16.1 GB. [2021-08-27 17:41:35,403 INFO L168 Benchmark]: Witness Printer took 3.17 ms. Allocated memory is still 151.0 MB. Free memory is still 74.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 17:41:35,405 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.15 ms. Allocated memory is still 60.8 MB. Free memory was 42.9 MB in the beginning and 42.9 MB in the end (delta: 43.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 536.56 ms. Allocated memory is still 60.8 MB. Free memory was 39.5 MB in the beginning and 35.2 MB in the end (delta: 4.2 MB). Peak memory consumption was 17.0 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 39.27 ms. Allocated memory is still 60.8 MB. Free memory was 35.2 MB in the beginning and 33.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 47.71 ms. Allocated memory is still 60.8 MB. Free memory was 33.1 MB in the beginning and 31.6 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 334.04 ms. Allocated memory is still 60.8 MB. Free memory was 31.6 MB in the beginning and 33.2 MB in the end (delta: -1.6 MB). Peak memory consumption was 11.3 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 5338.06 ms. Allocated memory was 60.8 MB in the beginning and 151.0 MB in the end (delta: 90.2 MB). Free memory was 33.0 MB in the beginning and 74.2 MB in the end (delta: -41.3 MB). Peak memory consumption was 49.5 MB. Max. memory is 16.1 GB. * Witness Printer took 3.17 ms. Allocated memory is still 151.0 MB. Free memory is still 74.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (3 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function len + -1 * i and consists of 3 locations. One deterministic module has affine ranking function 2 * j + 1 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.3s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 4.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 16.7ms AutomataMinimizationTime, 4 MinimizatonAttempts, 16 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 17 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 85 SDtfs, 50 SDslu, 71 SDs, 0 SdLazy, 59 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 53.2ms Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU2 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital250 mio100 ax111 hnf101 lsp82 ukn53 mio100 lsp56 div100 bol100 ite100 ukn100 eq189 hnf91 smp100 dnf117 smp92 tf100 neg96 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 38ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: 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-08-27 17:41:35,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-08-27 17:41:35,645 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...