./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/Urban-2013WST-Fig2-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 791161d1 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/termination-memory-alloca/Urban-2013WST-Fig2-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash 7e4d89645739beae47f9c52ff5003bd634bd856a7fdd28a03c9ca1afb29cead1 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 14:26:12,006 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 14:26:12,008 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 14:26:12,039 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 14:26:12,041 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 14:26:12,043 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 14:26:12,044 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 14:26:12,045 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 14:26:12,047 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 14:26:12,047 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 14:26:12,048 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 14:26:12,049 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 14:26:12,049 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 14:26:12,050 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 14:26:12,051 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 14:26:12,052 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 14:26:12,052 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 14:26:12,053 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 14:26:12,054 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 14:26:12,055 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 14:26:12,056 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 14:26:12,057 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 14:26:12,058 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 14:26:12,059 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 14:26:12,059 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 14:26:12,061 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 14:26:12,062 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 14:26:12,062 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 14:26:12,063 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 14:26:12,063 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 14:26:12,064 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 14:26:12,064 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 14:26:12,064 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 14:26:12,065 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 14:26:12,066 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 14:26:12,066 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 14:26:12,067 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 14:26:12,067 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 14:26:12,067 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 14:26:12,068 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 14:26:12,068 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 14:26:12,069 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 14:26:12,070 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-07-23 14:26:12,090 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 14:26:12,090 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 14:26:12,090 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 14:26:12,090 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 14:26:12,091 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 14:26:12,092 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 14:26:12,092 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 14:26:12,092 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-23 14:26:12,092 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-23 14:26:12,092 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-23 14:26:12,092 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-23 14:26:12,093 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-23 14:26:12,093 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-23 14:26:12,093 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 14:26:12,093 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 14:26:12,093 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 14:26:12,094 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 14:26:12,094 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-23 14:26:12,094 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-23 14:26:12,094 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-23 14:26:12,094 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-23 14:26:12,094 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-23 14:26:12,095 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 14:26:12,095 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-23 14:26:12,095 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 14:26:12,095 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 14:26:12,095 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 14:26:12,095 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 14:26:12,096 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-23 14:26:12,096 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7e4d89645739beae47f9c52ff5003bd634bd856a7fdd28a03c9ca1afb29cead1 [2022-07-23 14:26:12,295 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 14:26:12,315 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 14:26:12,317 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 14:26:12,319 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 14:26:12,319 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 14:26:12,320 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/Urban-2013WST-Fig2-alloca.i [2022-07-23 14:26:12,366 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf7e5255c/ab6769e8e6524fed894cf5565d0a2b5e/FLAGb3a3eb499 [2022-07-23 14:26:12,796 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 14:26:12,796 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/Urban-2013WST-Fig2-alloca.i [2022-07-23 14:26:12,808 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf7e5255c/ab6769e8e6524fed894cf5565d0a2b5e/FLAGb3a3eb499 [2022-07-23 14:26:12,821 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf7e5255c/ab6769e8e6524fed894cf5565d0a2b5e [2022-07-23 14:26:12,823 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 14:26:12,825 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 14:26:12,826 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 14:26:12,826 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 14:26:12,829 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 14:26:12,829 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 02:26:12" (1/1) ... [2022-07-23 14:26:12,830 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4abcf3bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:26:12, skipping insertion in model container [2022-07-23 14:26:12,830 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 02:26:12" (1/1) ... [2022-07-23 14:26:12,835 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 14:26:12,870 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 14:26:13,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 14:26:13,128 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 14:26:13,157 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 14:26:13,187 INFO L208 MainTranslator]: Completed translation [2022-07-23 14:26:13,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:26:13 WrapperNode [2022-07-23 14:26:13,188 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 14:26:13,189 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 14:26:13,189 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 14:26:13,189 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 14:26:13,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:26:13" (1/1) ... [2022-07-23 14:26:13,210 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:26:13" (1/1) ... [2022-07-23 14:26:13,225 INFO L137 Inliner]: procedures = 109, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 34 [2022-07-23 14:26:13,226 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 14:26:13,227 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 14:26:13,227 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 14:26:13,227 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 14:26:13,232 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:26:13" (1/1) ... [2022-07-23 14:26:13,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:26:13" (1/1) ... [2022-07-23 14:26:13,234 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:26:13" (1/1) ... [2022-07-23 14:26:13,234 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:26:13" (1/1) ... [2022-07-23 14:26:13,238 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:26:13" (1/1) ... [2022-07-23 14:26:13,245 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:26:13" (1/1) ... [2022-07-23 14:26:13,246 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:26:13" (1/1) ... [2022-07-23 14:26:13,247 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 14:26:13,248 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 14:26:13,248 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 14:26:13,248 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 14:26:13,256 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:26:13" (1/1) ... [2022-07-23 14:26:13,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:13,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:13,303 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:26:13,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-23 14:26:13,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 14:26:13,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-23 14:26:13,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 14:26:13,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 14:26:13,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 14:26:13,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 14:26:13,423 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 14:26:13,424 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 14:26:13,523 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 14:26:13,527 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 14:26:13,527 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-23 14:26:13,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 02:26:13 BoogieIcfgContainer [2022-07-23 14:26:13,528 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 14:26:13,529 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-23 14:26:13,529 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-23 14:26:13,531 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-23 14:26:13,532 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 14:26:13,532 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.07 02:26:12" (1/3) ... [2022-07-23 14:26:13,533 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@384c9a02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.07 02:26:13, skipping insertion in model container [2022-07-23 14:26:13,533 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 14:26:13,533 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:26:13" (2/3) ... [2022-07-23 14:26:13,533 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@384c9a02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.07 02:26:13, skipping insertion in model container [2022-07-23 14:26:13,533 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 14:26:13,533 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 02:26:13" (3/3) ... [2022-07-23 14:26:13,534 INFO L354 chiAutomizerObserver]: Analyzing ICFG Urban-2013WST-Fig2-alloca.i [2022-07-23 14:26:13,568 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-23 14:26:13,569 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-23 14:26:13,569 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-23 14:26:13,569 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-23 14:26:13,569 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-23 14:26:13,569 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-23 14:26:13,569 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-23 14:26:13,569 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-23 14:26:13,572 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:26:13,583 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-23 14:26:13,583 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:26:13,584 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:26:13,587 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-23 14:26:13,587 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-23 14:26:13,588 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-23 14:26:13,588 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:26:13,589 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-23 14:26:13,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:26:13,589 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:26:13,589 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-23 14:26:13,589 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-23 14:26:13,593 INFO L752 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem6#1, main_#t~mem5#1, main_#t~mem7#1, main_#t~mem4#1, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 6#L549-3true [2022-07-23 14:26:13,594 INFO L754 eck$LassoCheckResult]: Loop: 6#L549-3true call main_#t~mem4#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 2#L549-1true assume !!(main_#t~mem4#1 <= 10);havoc main_#t~mem4#1;call write~int(10, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 7#L551-3true assume !true; 11#L551-4true call main_#t~mem7#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int(1 + main_#t~mem7#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~mem7#1; 6#L549-3true [2022-07-23 14:26:13,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:26:13,598 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-23 14:26:13,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:26:13,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875991046] [2022-07-23 14:26:13,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:26:13,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:26:13,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:13,667 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:26:13,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:13,686 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:26:13,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:26:13,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1144360, now seen corresponding path program 1 times [2022-07-23 14:26:13,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:26:13,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860934771] [2022-07-23 14:26:13,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:26:13,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:26:13,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:26:13,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:26:13,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:26:13,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860934771] [2022-07-23 14:26:13,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860934771] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:26:13,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:26:13,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 14:26:13,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536657372] [2022-07-23 14:26:13,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:26:13,724 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:26:13,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:26:13,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-23 14:26:13,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-23 14:26:13,752 INFO L87 Difference]: Start difference. First operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:26:13,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:26:13,757 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2022-07-23 14:26:13,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-23 14:26:13,761 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2022-07-23 14:26:13,763 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-23 14:26:13,766 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 7 states and 8 transitions. [2022-07-23 14:26:13,766 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-07-23 14:26:13,767 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2022-07-23 14:26:13,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2022-07-23 14:26:13,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:26:13,768 INFO L369 hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions. [2022-07-23 14:26:13,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2022-07-23 14:26:13,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2022-07-23 14:26:13,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:26:13,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2022-07-23 14:26:13,784 INFO L392 hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions. [2022-07-23 14:26:13,785 INFO L374 stractBuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2022-07-23 14:26:13,785 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-23 14:26:13,785 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2022-07-23 14:26:13,786 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-23 14:26:13,786 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:26:13,786 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:26:13,786 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-23 14:26:13,786 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-23 14:26:13,786 INFO L752 eck$LassoCheckResult]: Stem: 32#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 33#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem6#1, main_#t~mem5#1, main_#t~mem7#1, main_#t~mem4#1, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 34#L549-3 [2022-07-23 14:26:13,787 INFO L754 eck$LassoCheckResult]: Loop: 34#L549-3 call main_#t~mem4#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 30#L549-1 assume !!(main_#t~mem4#1 <= 10);havoc main_#t~mem4#1;call write~int(10, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 31#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 35#L551-1 assume !(main_#t~mem5#1 > 1);havoc main_#t~mem5#1; 36#L551-4 call main_#t~mem7#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int(1 + main_#t~mem7#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~mem7#1; 34#L549-3 [2022-07-23 14:26:13,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:26:13,789 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-07-23 14:26:13,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:26:13,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788972858] [2022-07-23 14:26:13,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:26:13,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:26:13,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:13,819 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:26:13,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:13,835 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:26:13,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:26:13,837 INFO L85 PathProgramCache]: Analyzing trace with hash 35468273, now seen corresponding path program 1 times [2022-07-23 14:26:13,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:26:13,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305287738] [2022-07-23 14:26:13,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:26:13,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:26:13,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:26:13,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:26:13,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:26:13,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305287738] [2022-07-23 14:26:13,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305287738] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:26:13,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:26:13,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 14:26:13,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943470052] [2022-07-23 14:26:13,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:26:13,950 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:26:13,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:26:13,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 14:26:13,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 14:26:13,951 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand has 4 states, 4 states have (on average 1.25) 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) [2022-07-23 14:26:14,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:26:14,003 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2022-07-23 14:26:14,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 14:26:14,004 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2022-07-23 14:26:14,004 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-23 14:26:14,005 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions. [2022-07-23 14:26:14,005 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-07-23 14:26:14,005 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-07-23 14:26:14,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2022-07-23 14:26:14,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:26:14,006 INFO L369 hiAutomatonCegarLoop]: Abstraction has 9 states and 10 transitions. [2022-07-23 14:26:14,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2022-07-23 14:26:14,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-07-23 14:26:14,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 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) [2022-07-23 14:26:14,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2022-07-23 14:26:14,008 INFO L392 hiAutomatonCegarLoop]: Abstraction has 9 states and 10 transitions. [2022-07-23 14:26:14,008 INFO L374 stractBuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2022-07-23 14:26:14,008 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-23 14:26:14,008 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2022-07-23 14:26:14,009 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-23 14:26:14,009 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:26:14,010 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:26:14,011 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-23 14:26:14,011 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2022-07-23 14:26:14,011 INFO L752 eck$LassoCheckResult]: Stem: 57#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 58#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem6#1, main_#t~mem5#1, main_#t~mem7#1, main_#t~mem4#1, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 59#L549-3 [2022-07-23 14:26:14,011 INFO L754 eck$LassoCheckResult]: Loop: 59#L549-3 call main_#t~mem4#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 55#L549-1 assume !!(main_#t~mem4#1 <= 10);havoc main_#t~mem4#1;call write~int(10, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 56#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 60#L551-1 assume !!(main_#t~mem5#1 > 1);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(main_#t~mem6#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem6#1; 61#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 63#L551-1 assume !(main_#t~mem5#1 > 1);havoc main_#t~mem5#1; 62#L551-4 call main_#t~mem7#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int(1 + main_#t~mem7#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~mem7#1; 59#L549-3 [2022-07-23 14:26:14,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:26:14,012 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-07-23 14:26:14,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:26:14,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99711351] [2022-07-23 14:26:14,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:26:14,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:26:14,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:14,033 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:26:14,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:14,042 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:26:14,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:26:14,043 INFO L85 PathProgramCache]: Analyzing trace with hash -274676436, now seen corresponding path program 1 times [2022-07-23 14:26:14,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:26:14,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742038863] [2022-07-23 14:26:14,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:26:14,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:26:14,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:26:14,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:26:14,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:26:14,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742038863] [2022-07-23 14:26:14,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742038863] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 14:26:14,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193005894] [2022-07-23 14:26:14,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:26:14,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 14:26:14,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:14,124 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 14:26:14,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-23 14:26:14,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:26:14,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-23 14:26:14,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:26:14,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 14:26:14,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:26:14,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 14:26:14,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:26:14,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 14:26:14,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:26:14,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193005894] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 14:26:14,356 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 14:26:14,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-07-23 14:26:14,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281082830] [2022-07-23 14:26:14,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 14:26:14,357 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:26:14,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:26:14,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-23 14:26:14,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-07-23 14:26:14,358 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand has 10 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:26:14,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:26:14,405 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-07-23 14:26:14,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 14:26:14,407 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 16 transitions. [2022-07-23 14:26:14,409 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2022-07-23 14:26:14,410 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 16 transitions. [2022-07-23 14:26:14,410 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-07-23 14:26:14,411 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-07-23 14:26:14,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 16 transitions. [2022-07-23 14:26:14,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:26:14,411 INFO L369 hiAutomatonCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-07-23 14:26:14,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 16 transitions. [2022-07-23 14:26:14,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-07-23 14:26:14,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:26:14,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-07-23 14:26:14,414 INFO L392 hiAutomatonCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-07-23 14:26:14,414 INFO L374 stractBuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-07-23 14:26:14,414 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-23 14:26:14,414 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2022-07-23 14:26:14,415 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2022-07-23 14:26:14,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:26:14,416 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:26:14,416 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-23 14:26:14,416 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 4, 1, 1, 1, 1] [2022-07-23 14:26:14,416 INFO L752 eck$LassoCheckResult]: Stem: 136#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 137#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem6#1, main_#t~mem5#1, main_#t~mem7#1, main_#t~mem4#1, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 138#L549-3 [2022-07-23 14:26:14,417 INFO L754 eck$LassoCheckResult]: Loop: 138#L549-3 call main_#t~mem4#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 134#L549-1 assume !!(main_#t~mem4#1 <= 10);havoc main_#t~mem4#1;call write~int(10, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 135#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 139#L551-1 assume !!(main_#t~mem5#1 > 1);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(main_#t~mem6#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem6#1; 140#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 141#L551-1 assume !!(main_#t~mem5#1 > 1);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(main_#t~mem6#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem6#1; 148#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 147#L551-1 assume !!(main_#t~mem5#1 > 1);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(main_#t~mem6#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem6#1; 146#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 145#L551-1 assume !!(main_#t~mem5#1 > 1);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(main_#t~mem6#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem6#1; 144#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 143#L551-1 assume !(main_#t~mem5#1 > 1);havoc main_#t~mem5#1; 142#L551-4 call main_#t~mem7#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int(1 + main_#t~mem7#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~mem7#1; 138#L549-3 [2022-07-23 14:26:14,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:26:14,417 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-07-23 14:26:14,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:26:14,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759350842] [2022-07-23 14:26:14,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:26:14,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:26:14,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:14,439 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:26:14,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:14,448 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:26:14,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:26:14,449 INFO L85 PathProgramCache]: Analyzing trace with hash 351922269, now seen corresponding path program 2 times [2022-07-23 14:26:14,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:26:14,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141012555] [2022-07-23 14:26:14,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:26:14,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:26:14,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:26:14,607 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:26:14,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:26:14,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141012555] [2022-07-23 14:26:14,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141012555] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 14:26:14,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291469463] [2022-07-23 14:26:14,609 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 14:26:14,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 14:26:14,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:14,610 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 14:26:14,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-23 14:26:14,688 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 14:26:14,688 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 14:26:14,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-23 14:26:14,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:26:14,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 14:26:14,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:26:14,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:26:14,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:26:14,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 14:26:14,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 14:26:14,745 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:26:14,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 14:26:14,808 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:26:14,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291469463] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 14:26:14,808 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 14:26:14,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 17 [2022-07-23 14:26:14,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830356805] [2022-07-23 14:26:14,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 14:26:14,809 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:26:14,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:26:14,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-23 14:26:14,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=160, Unknown=0, NotChecked=0, Total=272 [2022-07-23 14:26:14,810 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. cyclomatic complexity: 2 Second operand has 17 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:26:14,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:26:14,906 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-07-23 14:26:14,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-23 14:26:14,906 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 26 transitions. [2022-07-23 14:26:14,907 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2022-07-23 14:26:14,907 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 26 transitions. [2022-07-23 14:26:14,908 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2022-07-23 14:26:14,908 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2022-07-23 14:26:14,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 26 transitions. [2022-07-23 14:26:14,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:26:14,908 INFO L369 hiAutomatonCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-07-23 14:26:14,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 26 transitions. [2022-07-23 14:26:14,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-07-23 14:26:14,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.04) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:26:14,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2022-07-23 14:26:14,910 INFO L392 hiAutomatonCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-07-23 14:26:14,910 INFO L374 stractBuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-07-23 14:26:14,910 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-23 14:26:14,910 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 26 transitions. [2022-07-23 14:26:14,911 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2022-07-23 14:26:14,911 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:26:14,911 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:26:14,911 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-23 14:26:14,911 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 9, 1, 1, 1, 1] [2022-07-23 14:26:14,911 INFO L752 eck$LassoCheckResult]: Stem: 278#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 279#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem6#1, main_#t~mem5#1, main_#t~mem7#1, main_#t~mem4#1, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 280#L549-3 [2022-07-23 14:26:14,912 INFO L754 eck$LassoCheckResult]: Loop: 280#L549-3 call main_#t~mem4#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 276#L549-1 assume !!(main_#t~mem4#1 <= 10);havoc main_#t~mem4#1;call write~int(10, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 277#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 281#L551-1 assume !!(main_#t~mem5#1 > 1);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(main_#t~mem6#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem6#1; 282#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 283#L551-1 assume !!(main_#t~mem5#1 > 1);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(main_#t~mem6#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem6#1; 300#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 299#L551-1 assume !!(main_#t~mem5#1 > 1);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(main_#t~mem6#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem6#1; 298#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 297#L551-1 assume !!(main_#t~mem5#1 > 1);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(main_#t~mem6#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem6#1; 296#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 295#L551-1 assume !!(main_#t~mem5#1 > 1);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(main_#t~mem6#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem6#1; 294#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 293#L551-1 assume !!(main_#t~mem5#1 > 1);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(main_#t~mem6#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem6#1; 292#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 291#L551-1 assume !!(main_#t~mem5#1 > 1);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(main_#t~mem6#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem6#1; 290#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 289#L551-1 assume !!(main_#t~mem5#1 > 1);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(main_#t~mem6#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem6#1; 288#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 287#L551-1 assume !!(main_#t~mem5#1 > 1);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(main_#t~mem6#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem6#1; 286#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 285#L551-1 assume !(main_#t~mem5#1 > 1);havoc main_#t~mem5#1; 284#L551-4 call main_#t~mem7#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int(1 + main_#t~mem7#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~mem7#1; 280#L549-3 [2022-07-23 14:26:14,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:26:14,912 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2022-07-23 14:26:14,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:26:14,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445214034] [2022-07-23 14:26:14,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:26:14,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:26:14,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:14,918 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:26:14,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:14,922 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:26:14,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:26:14,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1943458812, now seen corresponding path program 3 times [2022-07-23 14:26:14,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:26:14,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011767886] [2022-07-23 14:26:14,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:26:14,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:26:14,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:14,960 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:26:14,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:14,981 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:26:14,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:26:14,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1979445758, now seen corresponding path program 1 times [2022-07-23 14:26:14,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:26:14,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709315461] [2022-07-23 14:26:14,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:26:14,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:26:15,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:15,016 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:26:15,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:15,052 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:26:18,431 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 14:26:18,433 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 14:26:18,433 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 14:26:18,433 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 14:26:18,433 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 14:26:18,433 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:18,433 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 14:26:18,433 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 14:26:18,434 INFO L133 ssoRankerPreferences]: Filename of dumped script: Urban-2013WST-Fig2-alloca.i_Iteration5_Lasso [2022-07-23 14:26:18,434 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 14:26:18,434 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 14:26:18,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:18,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:18,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:18,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:18,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:18,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:18,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:18,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:18,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:18,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:18,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:18,854 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 14:26:18,857 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 14:26:18,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:18,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:18,873 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) [2022-07-23 14:26:18,874 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 [2022-07-23 14:26:18,875 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 [2022-07-23 14:26:18,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:18,881 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:26:18,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:18,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:18,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:18,883 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:26:18,883 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:26:18,899 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-23 14:26:18,904 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-23 14:26:18,904 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-23 14:26:18,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:18,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:18,908 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) [2022-07-23 14:26:18,910 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 [2022-07-23 14:26:18,911 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-23 14:26:18,911 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-23 14:26:18,912 INFO L513 LassoAnalysis]: Proved termination. [2022-07-23 14:26:18,912 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0#1.base) ULTIMATE.start_main_~x1~0#1.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0#1.base) ULTIMATE.start_main_~x1~0#1.offset)_1 + 21 Supporting invariants [] [2022-07-23 14:26:18,944 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 [2022-07-23 14:26:18,976 INFO L293 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2022-07-23 14:26:18,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:26:19,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:26:19,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-23 14:26:19,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:26:19,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:26:19,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-23 14:26:19,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:26:19,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-07-23 14:26:19,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-07-23 14:26:19,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-07-23 14:26:19,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-07-23 14:26:19,160 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-07-23 14:26:19,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-07-23 14:26:19,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-07-23 14:26:19,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-07-23 14:26:19,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-07-23 14:26:19,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-07-23 14:26:19,275 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-07-23 14:26:19,293 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-07-23 14:26:19,294 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 26 transitions. cyclomatic complexity: 2 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:26:19,346 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 26 transitions. cyclomatic complexity: 2. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 48 states and 51 transitions. Complement of second has 6 states. [2022-07-23 14:26:19,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-23 14:26:19,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:26:19,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2022-07-23 14:26:19,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 23 letters. [2022-07-23 14:26:19,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:26:19,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 25 letters. Loop has 23 letters. [2022-07-23 14:26:19,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:26:19,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 46 letters. [2022-07-23 14:26:19,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:26:19,355 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 51 transitions. [2022-07-23 14:26:19,358 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 14:26:19,360 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 47 states and 50 transitions. [2022-07-23 14:26:19,360 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2022-07-23 14:26:19,360 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2022-07-23 14:26:19,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 50 transitions. [2022-07-23 14:26:19,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 14:26:19,361 INFO L369 hiAutomatonCegarLoop]: Abstraction has 47 states and 50 transitions. [2022-07-23 14:26:19,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 50 transitions. [2022-07-23 14:26:19,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 29. [2022-07-23 14:26:19,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:26:19,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-07-23 14:26:19,365 INFO L392 hiAutomatonCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-07-23 14:26:19,365 INFO L374 stractBuchiCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-07-23 14:26:19,365 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-23 14:26:19,365 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 32 transitions. [2022-07-23 14:26:19,366 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 14:26:19,367 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:26:19,367 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:26:19,367 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-23 14:26:19,367 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 14:26:19,367 INFO L752 eck$LassoCheckResult]: Stem: 501#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 502#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem6#1, main_#t~mem5#1, main_#t~mem7#1, main_#t~mem4#1, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 503#L549-3 call main_#t~mem4#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 497#L549-1 assume !!(main_#t~mem4#1 <= 10);havoc main_#t~mem4#1;call write~int(10, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 498#L551-3 [2022-07-23 14:26:19,368 INFO L754 eck$LassoCheckResult]: Loop: 498#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 505#L551-1 assume !!(main_#t~mem5#1 > 1);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(main_#t~mem6#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem6#1; 498#L551-3 [2022-07-23 14:26:19,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:26:19,368 INFO L85 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2022-07-23 14:26:19,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:26:19,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998800755] [2022-07-23 14:26:19,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:26:19,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:26:19,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:19,382 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:26:19,421 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 [2022-07-23 14:26:19,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:19,429 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:26:19,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:26:19,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1510, now seen corresponding path program 1 times [2022-07-23 14:26:19,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:26:19,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322906599] [2022-07-23 14:26:19,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:26:19,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:26:19,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:19,435 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:26:19,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:19,438 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:26:19,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:26:19,439 INFO L85 PathProgramCache]: Analyzing trace with hash 889571341, now seen corresponding path program 1 times [2022-07-23 14:26:19,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:26:19,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273061719] [2022-07-23 14:26:19,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:26:19,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:26:19,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:19,446 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:26:19,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:19,453 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:26:19,669 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 14:26:19,669 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 14:26:19,669 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 14:26:19,669 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 14:26:19,669 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 14:26:19,669 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:19,670 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 14:26:19,670 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 14:26:19,670 INFO L133 ssoRankerPreferences]: Filename of dumped script: Urban-2013WST-Fig2-alloca.i_Iteration6_Lasso [2022-07-23 14:26:19,670 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 14:26:19,670 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 14:26:19,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:19,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:19,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:19,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:19,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:19,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:19,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:19,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:19,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:19,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:19,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:19,972 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 14:26:19,972 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 14:26:19,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:19,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:19,973 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) [2022-07-23 14:26:19,990 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 [2022-07-23 14:26:19,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:19,996 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:26:19,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:19,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:19,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:19,997 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:26:19,997 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:26:20,003 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 [2022-07-23 14:26:20,010 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:20,032 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 [2022-07-23 14:26:20,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:20,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:20,048 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) [2022-07-23 14:26:20,049 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 [2022-07-23 14:26:20,051 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 [2022-07-23 14:26:20,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:20,057 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:20,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:20,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:20,060 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:26:20,060 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:26:20,075 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:20,113 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 [2022-07-23 14:26:20,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:20,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:20,115 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) [2022-07-23 14:26:20,144 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 [2022-07-23 14:26:20,145 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 [2022-07-23 14:26:20,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:20,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:20,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:20,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:20,153 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:26:20,153 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:26:20,169 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:20,192 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 [2022-07-23 14:26:20,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:20,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:20,208 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) [2022-07-23 14:26:20,209 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 [2022-07-23 14:26:20,211 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 [2022-07-23 14:26:20,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:20,217 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:26:20,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:20,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:20,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:20,217 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:26:20,217 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:26:20,232 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:20,260 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 [2022-07-23 14:26:20,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:20,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:20,262 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) [2022-07-23 14:26:20,263 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 [2022-07-23 14:26:20,265 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 [2022-07-23 14:26:20,270 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:20,271 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:20,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:20,271 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:20,273 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:26:20,273 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:26:20,288 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:20,309 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 [2022-07-23 14:26:20,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:20,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:20,311 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) [2022-07-23 14:26:20,312 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 [2022-07-23 14:26:20,314 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 [2022-07-23 14:26:20,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:20,319 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:26:20,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:20,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:20,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:20,326 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:26:20,327 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:26:20,327 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:20,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-23 14:26:20,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:20,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:20,344 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) [2022-07-23 14:26:20,345 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 [2022-07-23 14:26:20,347 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 [2022-07-23 14:26:20,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:20,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:20,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:20,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:20,355 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:26:20,355 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:26:20,370 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:20,385 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 [2022-07-23 14:26:20,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:20,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:20,387 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) [2022-07-23 14:26:20,389 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 [2022-07-23 14:26:20,390 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 [2022-07-23 14:26:20,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:20,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:20,396 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:20,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:20,407 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:26:20,407 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:26:20,416 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:20,433 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 [2022-07-23 14:26:20,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:20,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:20,434 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:26:20,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-23 14:26:20,437 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 [2022-07-23 14:26:20,455 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:20,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:20,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:20,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:20,459 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:26:20,459 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:26:20,462 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:20,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-23 14:26:20,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:20,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:20,492 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:26:20,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-23 14:26:20,494 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 [2022-07-23 14:26:20,499 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:20,500 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:26:20,500 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:20,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:20,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:20,500 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:26:20,500 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:26:20,523 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:20,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2022-07-23 14:26:20,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:20,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:20,572 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:26:20,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-23 14:26:20,574 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 [2022-07-23 14:26:20,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:20,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:20,579 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:20,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:20,582 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:26:20,582 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:26:20,599 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-23 14:26:20,608 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-07-23 14:26:20,608 INFO L444 ModelExtractionUtils]: 0 out of 7 variables were initially zero. Simplification set additionally 5 variables to zero. [2022-07-23 14:26:20,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:20,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:20,609 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:26:20,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-23 14:26:20,611 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-23 14:26:20,643 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-23 14:26:20,644 INFO L513 LassoAnalysis]: Proved termination. [2022-07-23 14:26:20,644 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x2~0#1.base) ULTIMATE.start_main_~x2~0#1.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x2~0#1.base) ULTIMATE.start_main_~x2~0#1.offset)_2 Supporting invariants [] [2022-07-23 14:26:20,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-23 14:26:20,689 INFO L293 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2022-07-23 14:26:20,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:26:20,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:26:20,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 14:26:20,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:26:20,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:26:20,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 14:26:20,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:26:20,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:26:20,730 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 [2022-07-23 14:26:20,730 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 32 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:26:20,743 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 32 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 67 states and 72 transitions. Complement of second has 7 states. [2022-07-23 14:26:20,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-23 14:26:20,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:26:20,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2022-07-23 14:26:20,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 4 letters. Loop has 2 letters. [2022-07-23 14:26:20,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:26:20,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 6 letters. Loop has 2 letters. [2022-07-23 14:26:20,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:26:20,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 4 letters. Loop has 4 letters. [2022-07-23 14:26:20,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:26:20,746 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 72 transitions. [2022-07-23 14:26:20,749 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 14:26:20,750 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 52 states and 55 transitions. [2022-07-23 14:26:20,750 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-07-23 14:26:20,750 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-07-23 14:26:20,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 55 transitions. [2022-07-23 14:26:20,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 14:26:20,750 INFO L369 hiAutomatonCegarLoop]: Abstraction has 52 states and 55 transitions. [2022-07-23 14:26:20,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 55 transitions. [2022-07-23 14:26:20,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2022-07-23 14:26:20,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:26:20,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2022-07-23 14:26:20,756 INFO L392 hiAutomatonCegarLoop]: Abstraction has 50 states and 53 transitions. [2022-07-23 14:26:20,781 INFO L374 stractBuchiCegarLoop]: Abstraction has 50 states and 53 transitions. [2022-07-23 14:26:20,781 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-23 14:26:20,781 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 53 transitions. [2022-07-23 14:26:20,783 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 14:26:20,783 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:26:20,783 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:26:20,784 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 9, 2, 2, 1, 1, 1, 1] [2022-07-23 14:26:20,784 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 14:26:20,784 INFO L752 eck$LassoCheckResult]: Stem: 671#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 672#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem6#1, main_#t~mem5#1, main_#t~mem7#1, main_#t~mem4#1, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 673#L549-3 call main_#t~mem4#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 669#L549-1 assume !!(main_#t~mem4#1 <= 10);havoc main_#t~mem4#1;call write~int(10, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 670#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 679#L551-1 assume !!(main_#t~mem5#1 > 1);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(main_#t~mem6#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem6#1; 677#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 678#L551-1 assume !!(main_#t~mem5#1 > 1);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(main_#t~mem6#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem6#1; 716#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 715#L551-1 assume !!(main_#t~mem5#1 > 1);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(main_#t~mem6#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem6#1; 714#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 713#L551-1 assume !!(main_#t~mem5#1 > 1);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(main_#t~mem6#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem6#1; 712#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 711#L551-1 assume !!(main_#t~mem5#1 > 1);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(main_#t~mem6#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem6#1; 710#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 709#L551-1 assume !!(main_#t~mem5#1 > 1);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(main_#t~mem6#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem6#1; 708#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 707#L551-1 assume !!(main_#t~mem5#1 > 1);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(main_#t~mem6#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem6#1; 706#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 705#L551-1 assume !!(main_#t~mem5#1 > 1);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(main_#t~mem6#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem6#1; 704#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 684#L551-1 assume !!(main_#t~mem5#1 > 1);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(main_#t~mem6#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem6#1; 685#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 681#L551-1 assume !(main_#t~mem5#1 > 1);havoc main_#t~mem5#1; 680#L551-4 call main_#t~mem7#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int(1 + main_#t~mem7#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~mem7#1; 674#L549-3 call main_#t~mem4#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 667#L549-1 assume !!(main_#t~mem4#1 <= 10);havoc main_#t~mem4#1;call write~int(10, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 668#L551-3 [2022-07-23 14:26:20,784 INFO L754 eck$LassoCheckResult]: Loop: 668#L551-3 call main_#t~mem5#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 676#L551-1 assume !!(main_#t~mem5#1 > 1);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(main_#t~mem6#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem6#1; 668#L551-3 [2022-07-23 14:26:20,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:26:20,785 INFO L85 PathProgramCache]: Analyzing trace with hash 423138919, now seen corresponding path program 2 times [2022-07-23 14:26:20,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:26:20,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767998600] [2022-07-23 14:26:20,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:26:20,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:26:20,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-23 14:26:20,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:20,835 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:26:20,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:20,861 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:26:20,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:26:20,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1510, now seen corresponding path program 2 times [2022-07-23 14:26:20,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:26:20,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373193291] [2022-07-23 14:26:20,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:26:20,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:26:20,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:20,869 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:26:20,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:20,873 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:26:20,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:26:20,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1385391412, now seen corresponding path program 3 times [2022-07-23 14:26:20,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:26:20,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128215683] [2022-07-23 14:26:20,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:26:20,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:26:20,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:20,915 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:26:20,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:26:20,944 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:26:26,567 WARN L233 SmtUtils]: Spent 5.60s on a formula simplification. DAG size of input: 184 DAG size of output: 156 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-07-23 14:26:26,678 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 14:26:26,678 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 14:26:26,678 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 14:26:26,678 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 14:26:26,678 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 14:26:26,678 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:26,678 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 14:26:26,678 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 14:26:26,678 INFO L133 ssoRankerPreferences]: Filename of dumped script: Urban-2013WST-Fig2-alloca.i_Iteration7_Lasso [2022-07-23 14:26:26,678 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 14:26:26,678 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 14:26:26,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:26,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:26,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:26,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:26,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:26,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:26,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:26,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:26,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:26,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:26,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:26:26,948 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 14:26:26,948 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 14:26:26,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:26,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:26,950 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:26:26,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-23 14:26:26,953 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 [2022-07-23 14:26:26,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:26,960 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:26:26,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:26,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:26,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:26,960 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:26:26,961 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:26:26,975 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:26,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-23 14:26:26,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:26,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:26,999 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:26:27,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-23 14:26:27,001 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 [2022-07-23 14:26:27,008 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:27,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:27,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:27,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:27,010 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:26:27,010 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:26:27,024 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:27,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-23 14:26:27,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:27,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:27,049 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:26:27,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-23 14:26:27,052 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 [2022-07-23 14:26:27,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:27,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:27,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:27,058 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:27,061 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:26:27,061 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:26:27,095 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:27,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-23 14:26:27,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:27,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:27,148 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:26:27,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-23 14:26:27,150 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 [2022-07-23 14:26:27,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:27,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:27,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:27,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:27,160 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:26:27,161 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:26:27,174 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:27,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-23 14:26:27,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:27,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:27,199 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:26:27,206 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 [2022-07-23 14:26:27,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-23 14:26:27,212 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:27,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:27,213 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:27,213 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:27,214 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:26:27,214 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:26:27,239 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:27,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-23 14:26:27,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:27,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:27,263 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:26:27,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-23 14:26:27,265 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 [2022-07-23 14:26:27,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:27,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:27,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:27,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:27,276 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:26:27,277 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:26:27,283 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:27,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-07-23 14:26:27,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:27,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:27,307 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:26:27,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-23 14:26:27,310 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 [2022-07-23 14:26:27,316 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:27,316 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:27,316 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:27,316 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:27,318 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:26:27,318 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:26:27,323 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:27,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-23 14:26:27,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:27,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:27,347 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:26:27,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-23 14:26:27,350 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 [2022-07-23 14:26:27,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:27,356 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:27,356 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:27,356 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:27,357 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:26:27,357 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:26:27,361 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:27,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-07-23 14:26:27,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:27,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:27,382 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:26:27,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-23 14:26:27,384 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 [2022-07-23 14:26:27,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:27,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:27,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:27,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:27,392 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:26:27,392 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:26:27,406 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:26:27,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-07-23 14:26:27,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:27,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:27,431 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:26:27,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-07-23 14:26:27,433 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 [2022-07-23 14:26:27,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:26:27,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:26:27,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:26:27,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:26:27,441 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:26:27,441 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:26:27,451 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-23 14:26:27,457 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2022-07-23 14:26:27,457 INFO L444 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 4 variables to zero. [2022-07-23 14:26:27,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:26:27,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:26:27,477 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:26:27,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-07-23 14:26:27,479 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-23 14:26:27,486 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-23 14:26:27,486 INFO L513 LassoAnalysis]: Proved termination. [2022-07-23 14:26:27,486 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x2~0#1.base) ULTIMATE.start_main_~x2~0#1.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x2~0#1.base) ULTIMATE.start_main_~x2~0#1.offset)_3 Supporting invariants [] [2022-07-23 14:26:27,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-07-23 14:26:27,530 INFO L293 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2022-07-23 14:26:27,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:26:27,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:26:27,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 14:26:27,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:26:27,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:26:27,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 14:26:27,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:26:27,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:26:27,611 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 [2022-07-23 14:26:27,612 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 53 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:26:27,623 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 53 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 62 states and 66 transitions. Complement of second has 7 states. [2022-07-23 14:26:27,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-23 14:26:27,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:26:27,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2022-07-23 14:26:27,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 27 letters. Loop has 2 letters. [2022-07-23 14:26:27,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:26:27,624 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-23 14:26:27,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:26:27,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:26:27,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 14:26:27,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:26:27,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:26:27,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 14:26:27,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:26:27,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:26:27,705 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-23 14:26:27,706 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 53 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:26:27,717 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 53 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 62 states and 66 transitions. Complement of second has 7 states. [2022-07-23 14:26:27,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-23 14:26:27,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:26:27,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2022-07-23 14:26:27,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 27 letters. Loop has 2 letters. [2022-07-23 14:26:27,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:26:27,718 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-23 14:26:27,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:26:27,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:26:27,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 14:26:27,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:26:27,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:26:27,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 14:26:27,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:26:27,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:26:27,802 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-23 14:26:27,802 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 53 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:26:27,815 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 53 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 73 states and 79 transitions. Complement of second has 6 states. [2022-07-23 14:26:27,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-23 14:26:27,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:26:27,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2022-07-23 14:26:27,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 27 letters. Loop has 2 letters. [2022-07-23 14:26:27,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:26:27,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 29 letters. Loop has 2 letters. [2022-07-23 14:26:27,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:26:27,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 27 letters. Loop has 4 letters. [2022-07-23 14:26:27,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:26:27,817 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 79 transitions. [2022-07-23 14:26:27,818 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-23 14:26:27,818 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 0 states and 0 transitions. [2022-07-23 14:26:27,818 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-23 14:26:27,819 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-23 14:26:27,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-23 14:26:27,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:26:27,819 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-23 14:26:27,819 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-23 14:26:27,819 INFO L374 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-23 14:26:27,819 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-23 14:26:27,819 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-23 14:26:27,820 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-23 14:26:27,820 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-23 14:26:27,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.07 02:26:27 BoogieIcfgContainer [2022-07-23 14:26:27,824 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-23 14:26:27,825 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-23 14:26:27,825 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-23 14:26:27,825 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-23 14:26:27,826 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 02:26:13" (3/4) ... [2022-07-23 14:26:27,828 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-23 14:26:27,828 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-23 14:26:27,828 INFO L158 Benchmark]: Toolchain (without parser) took 15003.63ms. Allocated memory was 109.1MB in the beginning and 167.8MB in the end (delta: 58.7MB). Free memory was 66.8MB in the beginning and 76.6MB in the end (delta: -9.7MB). Peak memory consumption was 48.7MB. Max. memory is 16.1GB. [2022-07-23 14:26:27,829 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 109.1MB. Free memory is still 83.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 14:26:27,829 INFO L158 Benchmark]: CACSL2BoogieTranslator took 362.66ms. Allocated memory is still 109.1MB. Free memory was 66.6MB in the beginning and 77.1MB in the end (delta: -10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-23 14:26:27,829 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.11ms. Allocated memory is still 109.1MB. Free memory was 77.1MB in the beginning and 75.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-23 14:26:27,829 INFO L158 Benchmark]: Boogie Preprocessor took 20.27ms. Allocated memory is still 109.1MB. Free memory was 75.5MB in the beginning and 74.2MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-23 14:26:27,830 INFO L158 Benchmark]: RCFGBuilder took 280.79ms. Allocated memory is still 109.1MB. Free memory was 74.2MB in the beginning and 64.5MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-23 14:26:27,830 INFO L158 Benchmark]: BuchiAutomizer took 14295.49ms. Allocated memory was 109.1MB in the beginning and 167.8MB in the end (delta: 58.7MB). Free memory was 64.5MB in the beginning and 76.6MB in the end (delta: -12.0MB). Peak memory consumption was 48.4MB. Max. memory is 16.1GB. [2022-07-23 14:26:27,830 INFO L158 Benchmark]: Witness Printer took 2.98ms. Allocated memory is still 167.8MB. Free memory is still 76.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 14:26:27,831 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 109.1MB. Free memory is still 83.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 362.66ms. Allocated memory is still 109.1MB. Free memory was 66.6MB in the beginning and 77.1MB in the end (delta: -10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.11ms. Allocated memory is still 109.1MB. Free memory was 77.1MB in the beginning and 75.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.27ms. Allocated memory is still 109.1MB. Free memory was 75.5MB in the beginning and 74.2MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 280.79ms. Allocated memory is still 109.1MB. Free memory was 74.2MB in the beginning and 64.5MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 14295.49ms. Allocated memory was 109.1MB in the beginning and 167.8MB in the end (delta: 58.7MB). Free memory was 64.5MB in the beginning and 76.6MB in the end (delta: -12.0MB). Peak memory consumption was 48.4MB. Max. memory is 16.1GB. * Witness Printer took 2.98ms. Allocated memory is still 167.8MB. Free memory is still 76.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[x1][x1] + 21 and consists of 4 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x2][x2] and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x2][x2] and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 14.2s and 8 iterations. TraceHistogramMax:10. Analysis of lassos took 13.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 20 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 90/90 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 42 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 38 mSDsluCounter, 86 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 33 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 133 IncrementalHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 53 mSDtfsCounter, 133 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI4 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital163 mio100 ax111 hnf100 lsp86 ukn65 mio100 lsp38 div100 bol100 ite100 ukn100 eq192 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 42ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-07-23 14:26:27,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-07-23 14:26:28,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-23 14:26:28,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-23 14:26:28,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE