./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/array03-alloca-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 6c24879c 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/array03-alloca-1.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 d63463173b27a3cdf96cbee1d161c9afc7e48dc9addc6b012fc924aa2db5e8d7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 03:19:02,808 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 03:19:02,810 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 03:19:02,857 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 03:19:02,858 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 03:19:02,859 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 03:19:02,860 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 03:19:02,862 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 03:19:02,863 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 03:19:02,866 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 03:19:02,867 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 03:19:02,869 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 03:19:02,869 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 03:19:02,870 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 03:19:02,871 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 03:19:02,874 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 03:19:02,874 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 03:19:02,875 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 03:19:02,876 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 03:19:02,880 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 03:19:02,881 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 03:19:02,882 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 03:19:02,883 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 03:19:02,883 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 03:19:02,884 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 03:19:02,888 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 03:19:02,888 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 03:19:02,888 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 03:19:02,889 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 03:19:02,890 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 03:19:02,890 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 03:19:02,890 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 03:19:02,892 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 03:19:02,892 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 03:19:02,893 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 03:19:02,894 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 03:19:02,894 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 03:19:02,894 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 03:19:02,894 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 03:19:02,895 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 03:19:02,895 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 03:19:02,896 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 03:19:02,898 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-07-13 03:19:02,920 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 03:19:02,920 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 03:19:02,921 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 03:19:02,921 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 03:19:02,922 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 03:19:02,922 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 03:19:02,922 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 03:19:02,923 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-13 03:19:02,923 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-13 03:19:02,923 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-13 03:19:02,923 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-13 03:19:02,924 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-13 03:19:02,924 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-13 03:19:02,924 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 03:19:02,924 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 03:19:02,924 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 03:19:02,924 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 03:19:02,925 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-13 03:19:02,925 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-13 03:19:02,925 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-13 03:19:02,925 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 03:19:02,925 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-13 03:19:02,925 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 03:19:02,925 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-13 03:19:02,926 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 03:19:02,926 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 03:19:02,926 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 03:19:02,926 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 03:19:02,927 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-13 03:19:02,927 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 -> d63463173b27a3cdf96cbee1d161c9afc7e48dc9addc6b012fc924aa2db5e8d7 [2022-07-13 03:19:03,106 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 03:19:03,121 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 03:19:03,123 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 03:19:03,124 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 03:19:03,124 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 03:19:03,125 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/array03-alloca-1.i [2022-07-13 03:19:03,182 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91dc01c91/d0c614baac6e46e5b52dc6e628df245d/FLAG9026aff7b [2022-07-13 03:19:03,507 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 03:19:03,508 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/array03-alloca-1.i [2022-07-13 03:19:03,514 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91dc01c91/d0c614baac6e46e5b52dc6e628df245d/FLAG9026aff7b [2022-07-13 03:19:03,913 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91dc01c91/d0c614baac6e46e5b52dc6e628df245d [2022-07-13 03:19:03,915 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 03:19:03,916 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 03:19:03,917 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 03:19:03,917 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 03:19:03,919 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 03:19:03,919 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:19:03" (1/1) ... [2022-07-13 03:19:03,920 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72a6f21a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:19:03, skipping insertion in model container [2022-07-13 03:19:03,920 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:19:03" (1/1) ... [2022-07-13 03:19:03,924 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 03:19:03,950 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 03:19:04,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 03:19:04,132 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 03:19:04,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 03:19:04,173 INFO L208 MainTranslator]: Completed translation [2022-07-13 03:19:04,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:19:04 WrapperNode [2022-07-13 03:19:04,174 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 03:19:04,175 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 03:19:04,175 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 03:19:04,175 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 03:19:04,180 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:19:04" (1/1) ... [2022-07-13 03:19:04,195 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:19:04" (1/1) ... [2022-07-13 03:19:04,210 INFO L137 Inliner]: procedures = 111, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 53 [2022-07-13 03:19:04,211 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 03:19:04,212 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 03:19:04,212 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 03:19:04,212 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 03:19:04,216 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:19:04" (1/1) ... [2022-07-13 03:19:04,217 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:19:04" (1/1) ... [2022-07-13 03:19:04,230 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:19:04" (1/1) ... [2022-07-13 03:19:04,230 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:19:04" (1/1) ... [2022-07-13 03:19:04,234 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:19:04" (1/1) ... [2022-07-13 03:19:04,242 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:19:04" (1/1) ... [2022-07-13 03:19:04,243 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:19:04" (1/1) ... [2022-07-13 03:19:04,248 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 03:19:04,251 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 03:19:04,251 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 03:19:04,252 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 03:19:04,253 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:19:04" (1/1) ... [2022-07-13 03:19:04,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:04,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:04,309 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-13 03:19:04,329 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-13 03:19:04,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 03:19:04,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 03:19:04,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 03:19:04,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 03:19:04,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 03:19:04,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 03:19:04,434 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 03:19:04,435 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 03:19:04,564 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 03:19:04,568 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 03:19:04,569 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-13 03:19:04,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:19:04 BoogieIcfgContainer [2022-07-13 03:19:04,570 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 03:19:04,571 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-13 03:19:04,571 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-13 03:19:04,589 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-13 03:19:04,589 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:19:04,590 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.07 03:19:03" (1/3) ... [2022-07-13 03:19:04,590 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3c531a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 03:19:04, skipping insertion in model container [2022-07-13 03:19:04,591 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:19:04,591 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:19:04" (2/3) ... [2022-07-13 03:19:04,591 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3c531a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 03:19:04, skipping insertion in model container [2022-07-13 03:19:04,591 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:19:04,591 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:19:04" (3/3) ... [2022-07-13 03:19:04,592 INFO L354 chiAutomizerObserver]: Analyzing ICFG array03-alloca-1.i [2022-07-13 03:19:04,635 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-13 03:19:04,635 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-13 03:19:04,635 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-13 03:19:04,637 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-13 03:19:04,638 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-13 03:19:04,638 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-13 03:19:04,638 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-13 03:19:04,638 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-13 03:19:04,642 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:19:04,662 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-13 03:19:04,662 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:19:04,662 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:19:04,667 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-13 03:19:04,667 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-13 03:19:04,667 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-13 03:19:04,667 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:19:04,670 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-13 03:19:04,671 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:19:04,671 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:19:04,671 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-13 03:19:04,671 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-13 03:19:04,676 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; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 14#L567true assume !(main_~array_size~0#1 < 1); 15#L567-2true call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem3#1, test_fun_#t~mem4#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~mem5#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;havoc test_fun_~res~0#1;test_fun_~i~0#1 := 0; 7#L551-3true [2022-07-13 03:19:04,681 INFO L754 eck$LassoCheckResult]: Loop: 7#L551-3true assume !!(test_fun_~i~0#1 < test_fun_~N#1);test_fun_~res~0#1 := 1;call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 10#L553true assume 0 == test_fun_#t~mem3#1;havoc test_fun_#t~mem3#1;test_fun_~res~0#1 := 1; 8#L558-2true assume !true; 6#L558-3true call write~int(test_fun_~res~0#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 12#L551-2true test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 7#L551-3true [2022-07-13 03:19:04,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:19:04,690 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2022-07-13 03:19:04,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:19:04,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794195099] [2022-07-13 03:19:04,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:19:04,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:19:04,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:19:04,787 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:19:04,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:19:04,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:19:04,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:19:04,830 INFO L85 PathProgramCache]: Analyzing trace with hash 44963621, now seen corresponding path program 1 times [2022-07-13 03:19:04,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:19:04,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483578193] [2022-07-13 03:19:04,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:19:04,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:19:04,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:19:04,876 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-13 03:19:04,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:19:04,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483578193] [2022-07-13 03:19:04,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483578193] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:19:04,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:19:04,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 03:19:04,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540152029] [2022-07-13 03:19:04,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:19:04,882 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:19:04,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:19:04,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 03:19:04,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 03:19:04,909 INFO L87 Difference]: Start difference. First operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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-13 03:19:04,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:19:04,913 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2022-07-13 03:19:04,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 03:19:04,918 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2022-07-13 03:19:04,921 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-13 03:19:04,923 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 11 states and 15 transitions. [2022-07-13 03:19:04,924 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-07-13 03:19:04,924 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-07-13 03:19:04,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 15 transitions. [2022-07-13 03:19:04,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:19:04,925 INFO L369 hiAutomatonCegarLoop]: Abstraction has 11 states and 15 transitions. [2022-07-13 03:19:04,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 15 transitions. [2022-07-13 03:19:04,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-07-13 03:19:04,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.3636363636363635) 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-13 03:19:04,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2022-07-13 03:19:04,942 INFO L392 hiAutomatonCegarLoop]: Abstraction has 11 states and 15 transitions. [2022-07-13 03:19:04,942 INFO L374 stractBuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2022-07-13 03:19:04,942 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-13 03:19:04,942 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2022-07-13 03:19:04,943 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-13 03:19:04,943 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:19:04,944 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:19:04,944 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-13 03:19:04,944 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-13 03:19:04,944 INFO L752 eck$LassoCheckResult]: Stem: 41#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 42#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 47#L567 assume !(main_~array_size~0#1 < 1); 48#L567-2 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem3#1, test_fun_#t~mem4#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~mem5#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;havoc test_fun_~res~0#1;test_fun_~i~0#1 := 0; 44#L551-3 [2022-07-13 03:19:04,944 INFO L754 eck$LassoCheckResult]: Loop: 44#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1);test_fun_~res~0#1 := 1;call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 38#L553 assume 0 == test_fun_#t~mem3#1;havoc test_fun_#t~mem3#1;test_fun_~res~0#1 := 1; 39#L558-2 call test_fun_#t~mem5#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 45#L558 assume !(test_fun_#t~mem5#1 > 0);havoc test_fun_#t~mem5#1; 46#L558-3 call write~int(test_fun_~res~0#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 43#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 44#L551-3 [2022-07-13 03:19:04,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:19:04,946 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2022-07-13 03:19:04,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:19:04,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039564947] [2022-07-13 03:19:04,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:19:04,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:19:04,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:19:04,957 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:19:04,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:19:04,973 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:19:04,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:19:04,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1393657929, now seen corresponding path program 1 times [2022-07-13 03:19:04,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:19:04,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377793387] [2022-07-13 03:19:04,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:19:04,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:19:04,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:19:04,991 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:19:05,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:19:05,006 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:19:05,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:19:05,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1898369747, now seen corresponding path program 1 times [2022-07-13 03:19:05,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:19:05,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210151684] [2022-07-13 03:19:05,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:19:05,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:19:05,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:19:05,036 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:19:05,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:19:05,052 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:19:05,348 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:19:05,349 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:19:05,350 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:19:05,350 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:19:05,350 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 03:19:05,350 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:05,350 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:19:05,350 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:19:05,350 INFO L133 ssoRankerPreferences]: Filename of dumped script: array03-alloca-1.i_Iteration2_Lasso [2022-07-13 03:19:05,350 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:19:05,351 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:19:05,363 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-13 03:19:05,368 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-13 03:19:05,372 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-13 03:19:05,373 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-13 03:19:05,375 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-13 03:19:05,376 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-13 03:19:05,378 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-13 03:19:05,380 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-13 03:19:05,514 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-13 03:19:05,517 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-13 03:19:05,519 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-13 03:19:05,521 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-13 03:19:05,522 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-13 03:19:05,524 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-13 03:19:05,526 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-13 03:19:05,727 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:19:05,731 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 03:19:05,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:05,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:05,744 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:19:05,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-13 03:19:05,764 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-13 03:19:05,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:19:05,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:19:05,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:19:05,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:19:05,776 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:19:05,776 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:19:05,792 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:19:05,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-13 03:19:05,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:05,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:05,837 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:19:05,854 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-13 03:19:05,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:19:05,862 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:19:05,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:19:05,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:19:05,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:19:05,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-13 03:19:05,864 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:19:05,864 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:19:05,879 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:19:05,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-13 03:19:05,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:05,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:05,913 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-13 03:19:05,914 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-13 03:19:05,915 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-13 03:19:05,920 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:19:05,921 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:19:05,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:19:05,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:19:05,921 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:19:05,921 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:19:05,921 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:19:05,937 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:19:05,954 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-13 03:19:05,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:05,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:05,955 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-13 03:19:05,958 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-13 03:19:05,959 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-13 03:19:05,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:19:05,964 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:19:05,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:19:05,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:19:05,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:19:05,965 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:19:05,965 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:19:05,967 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:19:05,982 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-13 03:19:05,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:05,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:05,983 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-13 03:19:05,983 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-13 03:19:05,984 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-13 03:19:05,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:19:05,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:19:05,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:19:05,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:19:05,994 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:19:05,994 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:19:06,010 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:19:06,025 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-13 03:19:06,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:06,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:06,026 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-13 03:19:06,035 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-13 03:19:06,037 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-13 03:19:06,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:19:06,041 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:19:06,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:19:06,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:19:06,042 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:19:06,044 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:19:06,044 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:19:06,056 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:19:06,072 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-13 03:19:06,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:06,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:06,073 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-13 03:19:06,073 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-13 03:19:06,075 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-13 03:19:06,080 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:19:06,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:19:06,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:19:06,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:19:06,082 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:19:06,083 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:19:06,090 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:19:06,105 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-13 03:19:06,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:06,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:06,106 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-13 03:19:06,112 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-13 03:19:06,112 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-13 03:19:06,117 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:19:06,118 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:19:06,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:19:06,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:19:06,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:19:06,119 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:19:06,119 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:19:06,135 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:19:06,152 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-13 03:19:06,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:06,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:06,153 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-13 03:19:06,154 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-13 03:19:06,155 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-13 03:19:06,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:19:06,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:19:06,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:19:06,162 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:19:06,172 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:19:06,172 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:19:06,187 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 03:19:06,213 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2022-07-13 03:19:06,214 INFO L444 ModelExtractionUtils]: 11 out of 34 variables were initially zero. Simplification set additionally 19 variables to zero. [2022-07-13 03:19:06,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:06,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:06,228 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-13 03:19:06,229 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-13 03:19:06,255 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 03:19:06,277 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-13 03:19:06,277 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 03:19:06,277 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_~i~0#1, v_rep(select #length ULTIMATE.start_test_fun_~a#1.base)_1) = -4*ULTIMATE.start_test_fun_~i~0#1 + 1*v_rep(select #length ULTIMATE.start_test_fun_~a#1.base)_1 Supporting invariants [1*ULTIMATE.start_test_fun_~a#1.offset >= 0] [2022-07-13 03:19:06,324 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-13 03:19:06,332 INFO L293 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2022-07-13 03:19:06,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:19:06,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:19:06,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 03:19:06,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:19:06,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:19:06,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 03:19:06,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:19:06,428 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-13 03:19:06,430 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-13 03:19:06,431 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:19:06,470 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 18 states and 26 transitions. Complement of second has 4 states. [2022-07-13 03:19:06,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-13 03:19:06,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:19:06,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2022-07-13 03:19:06,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 4 letters. Loop has 6 letters. [2022-07-13 03:19:06,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:19:06,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 6 letters. [2022-07-13 03:19:06,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:19:06,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 4 letters. Loop has 12 letters. [2022-07-13 03:19:06,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:19:06,474 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 26 transitions. [2022-07-13 03:19:06,475 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-13 03:19:06,475 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 16 states and 24 transitions. [2022-07-13 03:19:06,475 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-07-13 03:19:06,475 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-07-13 03:19:06,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 24 transitions. [2022-07-13 03:19:06,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:19:06,476 INFO L369 hiAutomatonCegarLoop]: Abstraction has 16 states and 24 transitions. [2022-07-13 03:19:06,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 24 transitions. [2022-07-13 03:19:06,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-07-13 03:19:06,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 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-13 03:19:06,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 24 transitions. [2022-07-13 03:19:06,477 INFO L392 hiAutomatonCegarLoop]: Abstraction has 16 states and 24 transitions. [2022-07-13 03:19:06,477 INFO L374 stractBuchiCegarLoop]: Abstraction has 16 states and 24 transitions. [2022-07-13 03:19:06,477 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-13 03:19:06,477 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 24 transitions. [2022-07-13 03:19:06,478 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-13 03:19:06,478 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:19:06,478 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:19:06,478 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-13 03:19:06,478 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 03:19:06,479 INFO L752 eck$LassoCheckResult]: Stem: 144#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 145#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 151#L567 assume !(main_~array_size~0#1 < 1); 152#L567-2 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem3#1, test_fun_#t~mem4#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~mem5#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;havoc test_fun_~res~0#1;test_fun_~i~0#1 := 0; 153#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1);test_fun_~res~0#1 := 1;call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 142#L553 assume 0 == test_fun_#t~mem3#1;havoc test_fun_#t~mem3#1;test_fun_~res~0#1 := 1; 139#L558-2 [2022-07-13 03:19:06,479 INFO L754 eck$LassoCheckResult]: Loop: 139#L558-2 call test_fun_#t~mem5#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 148#L558 assume !!(test_fun_#t~mem5#1 > 0);havoc test_fun_#t~mem5#1;call test_fun_#t~mem6#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_~res~0#1 := test_fun_~res~0#1 * test_fun_#t~mem6#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem7#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post8#1 := test_fun_#t~mem7#1;call write~int(test_fun_#t~post8#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem7#1;havoc test_fun_#t~post8#1; 139#L558-2 [2022-07-13 03:19:06,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:19:06,479 INFO L85 PathProgramCache]: Analyzing trace with hash 889568456, now seen corresponding path program 1 times [2022-07-13 03:19:06,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:19:06,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769192200] [2022-07-13 03:19:06,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:19:06,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:19:06,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:19:06,516 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:19:06,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:19:06,522 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:19:06,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:19:06,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 1 times [2022-07-13 03:19:06,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:19:06,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646223861] [2022-07-13 03:19:06,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:19:06,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:19:06,527 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 03:19:06,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [746117681] [2022-07-13 03:19:06,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:19:06,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:19:06,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:06,533 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-13 03:19:06,533 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:19:06,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-13 03:19:06,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:19:06,570 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:19:06,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:19:06,578 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:19:06,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:19:06,578 INFO L85 PathProgramCache]: Analyzing trace with hash 176795341, now seen corresponding path program 1 times [2022-07-13 03:19:06,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:19:06,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016310875] [2022-07-13 03:19:06,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:19:06,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:19:06,596 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 03:19:06,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1301585351] [2022-07-13 03:19:06,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:19:06,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:19:06,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:06,598 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:19:06,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-13 03:19:06,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:19:06,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 03:19:06,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:19:06,693 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 23 treesize of output 7 [2022-07-13 03:19:06,698 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-13 03:19:06,698 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 03:19:06,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:19:06,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016310875] [2022-07-13 03:19:06,699 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 03:19:06,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301585351] [2022-07-13 03:19:06,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301585351] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:19:06,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:19:06,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 03:19:06,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160939530] [2022-07-13 03:19:06,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:19:06,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:19:06,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 03:19:06,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 03:19:06,734 INFO L87 Difference]: Start difference. First operand 16 states and 24 transitions. cyclomatic complexity: 10 Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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-13 03:19:06,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:19:06,759 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2022-07-13 03:19:06,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 03:19:06,760 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2022-07-13 03:19:06,760 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-13 03:19:06,761 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 26 transitions. [2022-07-13 03:19:06,761 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-07-13 03:19:06,761 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-07-13 03:19:06,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2022-07-13 03:19:06,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:19:06,761 INFO L369 hiAutomatonCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-07-13 03:19:06,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2022-07-13 03:19:06,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-07-13 03:19:06,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 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-13 03:19:06,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2022-07-13 03:19:06,763 INFO L392 hiAutomatonCegarLoop]: Abstraction has 18 states and 25 transitions. [2022-07-13 03:19:06,763 INFO L374 stractBuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2022-07-13 03:19:06,763 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-13 03:19:06,763 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2022-07-13 03:19:06,763 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-13 03:19:06,763 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:19:06,763 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:19:06,764 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:19:06,764 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 03:19:06,764 INFO L752 eck$LassoCheckResult]: Stem: 215#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 216#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 222#L567 assume !(main_~array_size~0#1 < 1); 223#L567-2 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem3#1, test_fun_#t~mem4#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~mem5#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;havoc test_fun_~res~0#1;test_fun_~i~0#1 := 0; 224#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1);test_fun_~res~0#1 := 1;call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 212#L553 assume !(0 == test_fun_#t~mem3#1);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 208#L555 assume !(test_fun_#t~mem4#1 < 0);havoc test_fun_#t~mem4#1; 209#L558-2 [2022-07-13 03:19:06,764 INFO L754 eck$LassoCheckResult]: Loop: 209#L558-2 call test_fun_#t~mem5#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 219#L558 assume !!(test_fun_#t~mem5#1 > 0);havoc test_fun_#t~mem5#1;call test_fun_#t~mem6#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_~res~0#1 := test_fun_~res~0#1 * test_fun_#t~mem6#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem7#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post8#1 := test_fun_#t~mem7#1;call write~int(test_fun_#t~post8#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem7#1;havoc test_fun_#t~post8#1; 209#L558-2 [2022-07-13 03:19:06,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:19:06,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1806818449, now seen corresponding path program 1 times [2022-07-13 03:19:06,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:19:06,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141293925] [2022-07-13 03:19:06,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:19:06,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:19:06,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:19:06,790 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:19:06,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:19:06,797 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:19:06,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:19:06,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 2 times [2022-07-13 03:19:06,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:19:06,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371454347] [2022-07-13 03:19:06,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:19:06,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:19:06,800 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 03:19:06,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1573826171] [2022-07-13 03:19:06,801 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 03:19:06,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:19:06,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:06,802 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:19:06,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-13 03:19:06,829 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-13 03:19:06,829 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-07-13 03:19:06,830 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:19:06,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:19:06,834 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:19:06,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:19:06,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1185742934, now seen corresponding path program 1 times [2022-07-13 03:19:06,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:19:06,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805788416] [2022-07-13 03:19:06,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:19:06,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:19:06,842 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 03:19:06,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1128855592] [2022-07-13 03:19:06,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:19:06,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:19:06,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:06,845 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:19:06,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-13 03:19:06,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:19:06,883 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:19:06,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:19:06,893 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:19:07,134 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:19:07,134 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:19:07,134 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:19:07,134 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:19:07,134 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 03:19:07,135 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:07,135 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:19:07,135 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:19:07,135 INFO L133 ssoRankerPreferences]: Filename of dumped script: array03-alloca-1.i_Iteration4_Lasso [2022-07-13 03:19:07,137 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:19:07,137 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:19:07,141 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-13 03:19:07,143 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-13 03:19:07,145 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-13 03:19:07,147 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-13 03:19:07,284 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-13 03:19:07,286 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-13 03:19:07,288 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-13 03:19:07,291 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-13 03:19:07,292 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-13 03:19:07,294 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-13 03:19:07,296 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-13 03:19:07,305 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-13 03:19:07,307 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-13 03:19:07,309 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-13 03:19:07,311 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-13 03:19:07,498 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:19:07,498 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 03:19:07,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:07,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:07,514 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-13 03:19:07,516 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-13 03:19:07,517 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-13 03:19:07,523 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:19:07,523 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:19:07,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:19:07,523 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:19:07,523 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:19:07,523 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:19:07,523 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:19:07,539 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:19:07,553 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-13 03:19:07,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:07,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:07,555 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-13 03:19:07,555 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-13 03:19:07,556 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-13 03:19:07,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:19:07,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:19:07,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:19:07,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:19:07,567 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:19:07,567 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:19:07,572 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:19:07,589 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-13 03:19:07,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:07,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:07,592 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-13 03:19:07,593 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-13 03:19:07,593 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-13 03:19:07,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:19:07,598 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:19:07,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:19:07,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:19:07,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:19:07,599 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:19:07,599 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:19:07,600 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:19:07,617 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-13 03:19:07,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:07,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:07,618 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-13 03:19:07,618 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-13 03:19:07,620 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-13 03:19:07,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:19:07,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:19:07,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:19:07,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:19:07,629 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:19:07,629 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:19:07,655 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:19:07,672 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-13 03:19:07,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:07,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:07,673 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-13 03:19:07,676 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-13 03:19:07,677 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-13 03:19:07,682 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:19:07,682 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:19:07,682 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:19:07,682 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:19:07,684 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:19:07,684 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:19:07,687 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:19:07,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2022-07-13 03:19:07,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:07,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:07,705 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-13 03:19:07,706 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-13 03:19:07,707 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-13 03:19:07,713 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:19:07,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:19:07,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:19:07,713 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:19:07,722 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:19:07,722 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:19:07,743 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:19:07,760 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-13 03:19:07,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:07,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:07,762 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-13 03:19:07,763 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-13 03:19:07,765 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-13 03:19:07,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:19:07,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:19:07,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:19:07,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:19:07,772 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:19:07,772 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:19:07,774 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:19:07,788 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-13 03:19:07,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:07,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:07,790 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-13 03:19:07,790 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-13 03:19:07,792 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-13 03:19:07,797 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:19:07,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:19:07,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:19:07,797 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:19:07,799 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:19:07,799 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:19:07,815 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 03:19:07,820 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2022-07-13 03:19:07,820 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2022-07-13 03:19:07,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:07,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:07,822 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-13 03:19:07,823 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-13 03:19:07,824 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 03:19:07,840 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-13 03:19:07,840 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 03:19:07,840 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a#1.base) (+ (* ULTIMATE.start_test_fun_~i~0#1 4) ULTIMATE.start_test_fun_~a#1.offset))_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a#1.base) (+ (* ULTIMATE.start_test_fun_~i~0#1 4) ULTIMATE.start_test_fun_~a#1.offset))_2 Supporting invariants [] [2022-07-13 03:19:07,855 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-13 03:19:07,860 INFO L293 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2022-07-13 03:19:07,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:19:07,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:19:07,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 03:19:07,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:19:07,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:19:07,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 03:19:07,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:19:07,902 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-13 03:19:07,902 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-13 03:19:07,902 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:19:07,914 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 40 states and 54 transitions. Complement of second has 7 states. [2022-07-13 03:19:07,914 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-13 03:19:07,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:19:07,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-07-13 03:19:07,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-13 03:19:07,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:19:07,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 9 letters. Loop has 2 letters. [2022-07-13 03:19:07,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:19:07,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 4 letters. [2022-07-13 03:19:07,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:19:07,916 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 54 transitions. [2022-07-13 03:19:07,916 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-07-13 03:19:07,917 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 35 states and 47 transitions. [2022-07-13 03:19:07,917 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-07-13 03:19:07,917 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2022-07-13 03:19:07,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 47 transitions. [2022-07-13 03:19:07,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:19:07,917 INFO L369 hiAutomatonCegarLoop]: Abstraction has 35 states and 47 transitions. [2022-07-13 03:19:07,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 47 transitions. [2022-07-13 03:19:07,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2022-07-13 03:19:07,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 30 states have internal predecessors, (43), 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-13 03:19:07,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2022-07-13 03:19:07,919 INFO L392 hiAutomatonCegarLoop]: Abstraction has 31 states and 43 transitions. [2022-07-13 03:19:07,919 INFO L374 stractBuchiCegarLoop]: Abstraction has 31 states and 43 transitions. [2022-07-13 03:19:07,919 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-13 03:19:07,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 43 transitions. [2022-07-13 03:19:07,919 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-13 03:19:07,919 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:19:07,919 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:19:07,920 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:19:07,920 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 03:19:07,920 INFO L752 eck$LassoCheckResult]: Stem: 338#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 339#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 347#L567 assume !(main_~array_size~0#1 < 1); 348#L567-2 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem3#1, test_fun_#t~mem4#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~mem5#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;havoc test_fun_~res~0#1;test_fun_~i~0#1 := 0; 349#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1);test_fun_~res~0#1 := 1;call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 350#L553 assume !(0 == test_fun_#t~mem3#1);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 329#L555 assume test_fun_#t~mem4#1 < 0;havoc test_fun_#t~mem4#1;test_fun_~res~0#1 := 0; 330#L558-2 [2022-07-13 03:19:07,920 INFO L754 eck$LassoCheckResult]: Loop: 330#L558-2 call test_fun_#t~mem5#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 342#L558 assume !!(test_fun_#t~mem5#1 > 0);havoc test_fun_#t~mem5#1;call test_fun_#t~mem6#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_~res~0#1 := test_fun_~res~0#1 * test_fun_#t~mem6#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem7#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post8#1 := test_fun_#t~mem7#1;call write~int(test_fun_#t~post8#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem7#1;havoc test_fun_#t~post8#1; 330#L558-2 [2022-07-13 03:19:07,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:19:07,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1806818447, now seen corresponding path program 1 times [2022-07-13 03:19:07,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:19:07,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107878135] [2022-07-13 03:19:07,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:19:07,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:19:07,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:19:07,938 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:19:07,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:19:07,945 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:19:07,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:19:07,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 3 times [2022-07-13 03:19:07,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:19:07,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482658407] [2022-07-13 03:19:07,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:19:07,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:19:07,950 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 03:19:07,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [258836643] [2022-07-13 03:19:07,952 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 03:19:07,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:19:07,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:07,963 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:19:07,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-07-13 03:19:07,988 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-07-13 03:19:07,989 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-07-13 03:19:07,989 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:19:07,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:19:07,993 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:19:07,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:19:07,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1185741012, now seen corresponding path program 1 times [2022-07-13 03:19:07,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:19:07,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691351868] [2022-07-13 03:19:07,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:19:07,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:19:08,010 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 03:19:08,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [4500637] [2022-07-13 03:19:08,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:19:08,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:19:08,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:08,012 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:19:08,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-07-13 03:19:08,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:19:08,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 03:19:08,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:19:08,073 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 23 treesize of output 7 [2022-07-13 03:19:08,077 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-13 03:19:08,078 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 03:19:08,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:19:08,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691351868] [2022-07-13 03:19:08,078 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 03:19:08,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4500637] [2022-07-13 03:19:08,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4500637] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:19:08,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:19:08,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 03:19:08,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210069169] [2022-07-13 03:19:08,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:19:08,131 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-13 03:19:08,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:19:08,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 03:19:08,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 03:19:08,144 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. cyclomatic complexity: 16 Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:19:08,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:19:08,179 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2022-07-13 03:19:08,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 03:19:08,181 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 47 transitions. [2022-07-13 03:19:08,183 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-13 03:19:08,183 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 33 states and 41 transitions. [2022-07-13 03:19:08,184 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-07-13 03:19:08,184 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-07-13 03:19:08,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 41 transitions. [2022-07-13 03:19:08,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:19:08,184 INFO L369 hiAutomatonCegarLoop]: Abstraction has 33 states and 41 transitions. [2022-07-13 03:19:08,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 41 transitions. [2022-07-13 03:19:08,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2022-07-13 03:19:08,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 26 states have internal predecessors, (35), 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-13 03:19:08,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2022-07-13 03:19:08,188 INFO L392 hiAutomatonCegarLoop]: Abstraction has 27 states and 35 transitions. [2022-07-13 03:19:08,188 INFO L374 stractBuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2022-07-13 03:19:08,188 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-13 03:19:08,188 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 35 transitions. [2022-07-13 03:19:08,190 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-13 03:19:08,190 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:19:08,190 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:19:08,190 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:19:08,190 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 03:19:08,191 INFO L752 eck$LassoCheckResult]: Stem: 442#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 443#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 450#L567 assume !(main_~array_size~0#1 < 1); 451#L567-2 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem3#1, test_fun_#t~mem4#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~mem5#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;havoc test_fun_~res~0#1;test_fun_~i~0#1 := 0; 452#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1);test_fun_~res~0#1 := 1;call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 435#L553 assume !(0 == test_fun_#t~mem3#1);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 437#L555 assume !(test_fun_#t~mem4#1 < 0);havoc test_fun_#t~mem4#1; 448#L558-2 call test_fun_#t~mem5#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 453#L558 assume !(test_fun_#t~mem5#1 > 0);havoc test_fun_#t~mem5#1; 457#L558-3 call write~int(test_fun_~res~0#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 456#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 454#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1);test_fun_~res~0#1 := 1;call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 433#L553 assume !(0 == test_fun_#t~mem3#1);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 434#L555 assume !(test_fun_#t~mem4#1 < 0);havoc test_fun_#t~mem4#1; 438#L558-2 [2022-07-13 03:19:08,191 INFO L754 eck$LassoCheckResult]: Loop: 438#L558-2 call test_fun_#t~mem5#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 446#L558 assume !!(test_fun_#t~mem5#1 > 0);havoc test_fun_#t~mem5#1;call test_fun_#t~mem6#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_~res~0#1 := test_fun_~res~0#1 * test_fun_#t~mem6#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem7#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post8#1 := test_fun_#t~mem7#1;call write~int(test_fun_#t~post8#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem7#1;havoc test_fun_#t~post8#1; 438#L558-2 [2022-07-13 03:19:08,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:19:08,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1864345184, now seen corresponding path program 1 times [2022-07-13 03:19:08,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:19:08,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080689666] [2022-07-13 03:19:08,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:19:08,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:19:08,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:19:08,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:19:08,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:19:08,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080689666] [2022-07-13 03:19:08,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080689666] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:19:08,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:19:08,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 03:19:08,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353831931] [2022-07-13 03:19:08,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:19:08,255 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 03:19:08,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:19:08,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 4 times [2022-07-13 03:19:08,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:19:08,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686812478] [2022-07-13 03:19:08,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:19:08,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:19:08,260 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 03:19:08,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1277165905] [2022-07-13 03:19:08,260 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 03:19:08,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:19:08,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:08,261 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:19:08,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-07-13 03:19:08,289 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 03:19:08,289 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-07-13 03:19:08,289 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:19:08,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:19:08,294 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:19:08,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:19:08,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 03:19:08,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 03:19:08,328 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. cyclomatic complexity: 12 Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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-13 03:19:08,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:19:08,367 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-07-13 03:19:08,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 03:19:08,368 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 42 transitions. [2022-07-13 03:19:08,368 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-13 03:19:08,369 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 33 states and 41 transitions. [2022-07-13 03:19:08,369 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-07-13 03:19:08,369 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-07-13 03:19:08,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 41 transitions. [2022-07-13 03:19:08,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:19:08,369 INFO L369 hiAutomatonCegarLoop]: Abstraction has 33 states and 41 transitions. [2022-07-13 03:19:08,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 41 transitions. [2022-07-13 03:19:08,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2022-07-13 03:19:08,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 29 states have internal predecessors, (38), 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-13 03:19:08,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2022-07-13 03:19:08,370 INFO L392 hiAutomatonCegarLoop]: Abstraction has 30 states and 38 transitions. [2022-07-13 03:19:08,370 INFO L374 stractBuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2022-07-13 03:19:08,371 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-13 03:19:08,371 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 38 transitions. [2022-07-13 03:19:08,371 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-13 03:19:08,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:19:08,371 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:19:08,371 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:19:08,371 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 03:19:08,371 INFO L752 eck$LassoCheckResult]: Stem: 512#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 513#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 520#L567 assume !(main_~array_size~0#1 < 1); 521#L567-2 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem3#1, test_fun_#t~mem4#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~mem5#1, test_fun_#t~post2#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;havoc test_fun_~res~0#1;test_fun_~i~0#1 := 0; 522#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1);test_fun_~res~0#1 := 1;call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 523#L553 assume !(0 == test_fun_#t~mem3#1);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 532#L555 assume !(test_fun_#t~mem4#1 < 0);havoc test_fun_#t~mem4#1; 524#L558-2 call test_fun_#t~mem5#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 525#L558 assume !!(test_fun_#t~mem5#1 > 0);havoc test_fun_#t~mem5#1;call test_fun_#t~mem6#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_~res~0#1 := test_fun_~res~0#1 * test_fun_#t~mem6#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem7#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post8#1 := test_fun_#t~mem7#1;call write~int(test_fun_#t~post8#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem7#1;havoc test_fun_#t~post8#1; 534#L558-2 call test_fun_#t~mem5#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 529#L558 assume !(test_fun_#t~mem5#1 > 0);havoc test_fun_#t~mem5#1; 528#L558-3 call write~int(test_fun_~res~0#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 527#L551-2 test_fun_#t~post2#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post2#1;havoc test_fun_#t~post2#1; 526#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1);test_fun_~res~0#1 := 1;call test_fun_#t~mem3#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 505#L553 assume !(0 == test_fun_#t~mem3#1);havoc test_fun_#t~mem3#1;call test_fun_#t~mem4#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 506#L555 assume !(test_fun_#t~mem4#1 < 0);havoc test_fun_#t~mem4#1; 510#L558-2 [2022-07-13 03:19:08,371 INFO L754 eck$LassoCheckResult]: Loop: 510#L558-2 call test_fun_#t~mem5#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 516#L558 assume !!(test_fun_#t~mem5#1 > 0);havoc test_fun_#t~mem5#1;call test_fun_#t~mem6#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_~res~0#1 := test_fun_~res~0#1 * test_fun_#t~mem6#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem7#1 := read~int(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post8#1 := test_fun_#t~mem7#1;call write~int(test_fun_#t~post8#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem7#1;havoc test_fun_#t~post8#1; 510#L558-2 [2022-07-13 03:19:08,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:19:08,372 INFO L85 PathProgramCache]: Analyzing trace with hash 221162235, now seen corresponding path program 1 times [2022-07-13 03:19:08,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:19:08,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59249831] [2022-07-13 03:19:08,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:19:08,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:19:08,377 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 03:19:08,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1723481476] [2022-07-13 03:19:08,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:19:08,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:19:08,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:08,379 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:19:08,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-07-13 03:19:08,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:19:08,433 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:19:08,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:19:08,445 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:19:08,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:19:08,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 5 times [2022-07-13 03:19:08,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:19:08,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138638823] [2022-07-13 03:19:08,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:19:08,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:19:08,448 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 03:19:08,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1122172964] [2022-07-13 03:19:08,448 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 03:19:08,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:19:08,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:08,449 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:19:08,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-07-13 03:19:08,476 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-13 03:19:08,477 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-07-13 03:19:08,477 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:19:08,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:19:08,481 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:19:08,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:19:08,481 INFO L85 PathProgramCache]: Analyzing trace with hash 2083511360, now seen corresponding path program 2 times [2022-07-13 03:19:08,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:19:08,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866137567] [2022-07-13 03:19:08,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:19:08,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:19:08,486 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 03:19:08,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1794583951] [2022-07-13 03:19:08,486 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 03:19:08,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:19:08,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:08,500 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:19:08,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-07-13 03:19:08,541 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 03:19:08,541 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-07-13 03:19:08,541 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:19:08,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:19:08,556 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:19:08,912 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:19:08,912 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:19:08,912 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:19:08,912 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:19:08,912 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 03:19:08,912 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:08,912 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:19:08,912 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:19:08,912 INFO L133 ssoRankerPreferences]: Filename of dumped script: array03-alloca-1.i_Iteration7_Lasso [2022-07-13 03:19:08,912 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:19:08,912 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:19:08,914 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-13 03:19:08,920 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-13 03:19:08,921 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-13 03:19:08,923 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-13 03:19:08,924 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-13 03:19:08,925 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-13 03:19:08,926 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-13 03:19:08,928 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-13 03:19:09,074 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-13 03:19:09,076 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-13 03:19:09,078 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-13 03:19:09,079 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-13 03:19:09,082 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-13 03:19:09,084 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-13 03:19:09,085 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-13 03:19:09,277 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:19:09,278 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 03:19:09,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:09,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:09,279 INFO L229 MonitoredProcess]: Starting monitored process 31 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-13 03:19:09,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-07-13 03:19:09,281 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-13 03:19:09,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:19:09,288 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:19:09,288 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:19:09,288 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:19:09,288 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:19:09,288 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:19:09,288 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:19:09,289 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:19:09,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-07-13 03:19:09,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:09,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:09,307 INFO L229 MonitoredProcess]: Starting monitored process 32 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-13 03:19:09,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-07-13 03:19:09,309 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-13 03:19:09,316 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:19:09,317 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:19:09,317 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:19:09,317 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:19:09,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:19:09,317 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:19:09,317 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:19:09,318 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:19:09,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-07-13 03:19:09,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:09,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:09,335 INFO L229 MonitoredProcess]: Starting monitored process 33 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-13 03:19:09,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-07-13 03:19:09,337 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-13 03:19:09,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:19:09,342 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:19:09,342 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:19:09,342 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:19:09,343 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:19:09,343 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:19:09,345 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:19:09,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2022-07-13 03:19:09,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:09,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:09,364 INFO L229 MonitoredProcess]: Starting monitored process 34 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-13 03:19:09,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-07-13 03:19:09,366 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-13 03:19:09,372 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:19:09,372 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:19:09,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:19:09,372 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:19:09,372 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:19:09,372 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:19:09,372 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:19:09,377 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:19:09,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-07-13 03:19:09,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:09,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:09,396 INFO L229 MonitoredProcess]: Starting monitored process 35 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-13 03:19:09,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-07-13 03:19:09,399 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-13 03:19:09,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:19:09,406 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:19:09,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:19:09,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:19:09,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:19:09,406 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:19:09,407 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:19:09,416 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:19:09,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2022-07-13 03:19:09,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:09,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:09,432 INFO L229 MonitoredProcess]: Starting monitored process 36 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-13 03:19:09,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-07-13 03:19:09,434 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-13 03:19:09,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:19:09,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:19:09,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:19:09,440 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:19:09,441 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:19:09,441 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:19:09,443 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:19:09,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-07-13 03:19:09,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:09,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:09,460 INFO L229 MonitoredProcess]: Starting monitored process 37 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-13 03:19:09,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-07-13 03:19:09,472 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-13 03:19:09,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:19:09,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:19:09,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:19:09,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:19:09,479 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:19:09,479 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:19:09,482 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:19:09,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2022-07-13 03:19:09,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:09,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:09,507 INFO L229 MonitoredProcess]: Starting monitored process 38 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-13 03:19:09,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-07-13 03:19:09,509 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-13 03:19:09,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:19:09,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:19:09,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:19:09,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:19:09,517 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:19:09,517 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:19:09,532 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 03:19:09,537 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2022-07-13 03:19:09,537 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2022-07-13 03:19:09,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:19:09,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:19:09,579 INFO L229 MonitoredProcess]: Starting monitored process 39 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-13 03:19:09,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-07-13 03:19:09,581 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 03:19:09,602 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-13 03:19:09,602 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 03:19:09,602 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a#1.base) (+ (* ULTIMATE.start_test_fun_~i~0#1 4) ULTIMATE.start_test_fun_~a#1.offset))_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a#1.base) (+ (* ULTIMATE.start_test_fun_~i~0#1 4) ULTIMATE.start_test_fun_~a#1.offset))_3 Supporting invariants [] [2022-07-13 03:19:09,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2022-07-13 03:19:09,625 INFO L293 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2022-07-13 03:19:09,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:19:09,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:19:09,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 03:19:09,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:19:09,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:19:09,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 03:19:09,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:19:09,707 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-13 03:19:09,708 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-13 03:19:09,708 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:19:09,726 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 44 transitions. Complement of second has 7 states. [2022-07-13 03:19:09,726 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-13 03:19:09,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:19:09,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2022-07-13 03:19:09,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 16 letters. Loop has 2 letters. [2022-07-13 03:19:09,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:19:09,728 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-13 03:19:09,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:19:09,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:19:09,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 03:19:09,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:19:09,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:19:09,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 03:19:09,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:19:09,787 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-13 03:19:09,788 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-13 03:19:09,788 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:19:09,800 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 44 transitions. Complement of second has 7 states. [2022-07-13 03:19:09,801 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-13 03:19:09,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:19:09,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2022-07-13 03:19:09,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 16 letters. Loop has 2 letters. [2022-07-13 03:19:09,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:19:09,802 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-13 03:19:09,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:19:09,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:19:09,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 03:19:09,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:19:09,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:19:09,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 03:19:09,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:19:09,864 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-13 03:19:09,865 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-13 03:19:09,865 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:19:09,877 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 39 states and 50 transitions. Complement of second has 6 states. [2022-07-13 03:19:09,879 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-13 03:19:09,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:19:09,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2022-07-13 03:19:09,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 16 letters. Loop has 2 letters. [2022-07-13 03:19:09,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:19:09,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 18 letters. Loop has 2 letters. [2022-07-13 03:19:09,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:19:09,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 16 letters. Loop has 4 letters. [2022-07-13 03:19:09,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:19:09,881 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 50 transitions. [2022-07-13 03:19:09,882 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-13 03:19:09,882 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 0 states and 0 transitions. [2022-07-13 03:19:09,882 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-13 03:19:09,882 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-13 03:19:09,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-13 03:19:09,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:19:09,883 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 03:19:09,883 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 03:19:09,883 INFO L374 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 03:19:09,883 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-13 03:19:09,883 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-13 03:19:09,883 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-13 03:19:09,883 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-13 03:19:09,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.07 03:19:09 BoogieIcfgContainer [2022-07-13 03:19:09,889 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-13 03:19:09,889 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 03:19:09,890 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 03:19:09,890 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 03:19:09,890 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:19:04" (3/4) ... [2022-07-13 03:19:09,892 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-13 03:19:09,892 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 03:19:09,893 INFO L158 Benchmark]: Toolchain (without parser) took 5977.06ms. Allocated memory was 92.3MB in the beginning and 151.0MB in the end (delta: 58.7MB). Free memory was 60.8MB in the beginning and 44.0MB in the end (delta: 16.8MB). Peak memory consumption was 74.9MB. Max. memory is 16.1GB. [2022-07-13 03:19:09,893 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 92.3MB. Free memory was 49.2MB in the beginning and 49.1MB in the end (delta: 45.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 03:19:09,894 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.47ms. Allocated memory was 92.3MB in the beginning and 125.8MB in the end (delta: 33.6MB). Free memory was 60.6MB in the beginning and 95.6MB in the end (delta: -35.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-13 03:19:09,894 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.33ms. Allocated memory is still 125.8MB. Free memory was 95.6MB in the beginning and 93.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 03:19:09,894 INFO L158 Benchmark]: Boogie Preprocessor took 39.05ms. Allocated memory is still 125.8MB. Free memory was 93.9MB in the beginning and 92.6MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 03:19:09,894 INFO L158 Benchmark]: RCFGBuilder took 318.94ms. Allocated memory is still 125.8MB. Free memory was 92.6MB in the beginning and 82.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 03:19:09,895 INFO L158 Benchmark]: BuchiAutomizer took 5318.13ms. Allocated memory was 125.8MB in the beginning and 151.0MB in the end (delta: 25.2MB). Free memory was 82.1MB in the beginning and 44.0MB in the end (delta: 38.2MB). Peak memory consumption was 65.2MB. Max. memory is 16.1GB. [2022-07-13 03:19:09,895 INFO L158 Benchmark]: Witness Printer took 3.03ms. Allocated memory is still 151.0MB. Free memory is still 44.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 03:19:09,896 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.17ms. Allocated memory is still 92.3MB. Free memory was 49.2MB in the beginning and 49.1MB in the end (delta: 45.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 257.47ms. Allocated memory was 92.3MB in the beginning and 125.8MB in the end (delta: 33.6MB). Free memory was 60.6MB in the beginning and 95.6MB in the end (delta: -35.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.33ms. Allocated memory is still 125.8MB. Free memory was 95.6MB in the beginning and 93.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.05ms. Allocated memory is still 125.8MB. Free memory was 93.9MB in the beginning and 92.6MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 318.94ms. Allocated memory is still 125.8MB. Free memory was 92.6MB in the beginning and 82.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 5318.13ms. Allocated memory was 125.8MB in the beginning and 151.0MB in the end (delta: 25.2MB). Free memory was 82.1MB in the beginning and 44.0MB in the end (delta: 38.2MB). Peak memory consumption was 65.2MB. Max. memory is 16.1GB. * Witness Printer took 3.03ms. Allocated memory is still 151.0MB. Free memory is still 44.0MB. 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 -4 * i + unknown-#length-unknown[a] and consists of 3 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[a][i * 4 + a] and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[a][i * 4 + a] and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.2s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 4.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 14 StatesRemovedByMinimization, 4 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: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 86 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 82 mSDsluCounter, 187 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 68 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 148 IncrementalHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 119 mSDtfsCounter, 148 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital172 mio100 ax110 hnf100 lsp86 ukn70 mio100 lsp49 div100 bol100 ite100 ukn100 eq178 hnf89 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 60ms 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-13 03:19:09,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-07-13 03:19:10,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-07-13 03:19:10,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-07-13 03:19:10,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-07-13 03:19:10,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-07-13 03:19:10,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-07-13 03:19:11,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-07-13 03:19:11,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-13 03:19:11,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-07-13 03:19:11,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-07-13 03:19:11,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-13 03:19:12,142 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