./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/reducercommutativity/max.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/reducercommutativity/max.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 97795e7b99ddd869ecccb7f865206a167342b52333873684a94abd35acf6650e --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 04:50:31,997 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 04:50:31,999 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 04:50:32,043 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 04:50:32,044 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 04:50:32,045 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 04:50:32,047 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 04:50:32,050 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 04:50:32,052 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 04:50:32,056 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 04:50:32,057 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 04:50:32,059 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 04:50:32,060 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 04:50:32,062 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 04:50:32,063 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 04:50:32,066 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 04:50:32,067 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 04:50:32,069 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 04:50:32,070 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 04:50:32,076 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 04:50:32,078 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 04:50:32,080 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 04:50:32,080 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 04:50:32,081 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 04:50:32,083 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 04:50:32,087 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 04:50:32,088 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 04:50:32,089 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 04:50:32,090 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 04:50:32,090 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 04:50:32,092 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 04:50:32,093 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 04:50:32,094 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 04:50:32,095 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 04:50:32,096 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 04:50:32,097 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 04:50:32,097 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 04:50:32,097 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 04:50:32,098 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 04:50:32,098 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 04:50:32,099 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 04:50:32,100 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 04:50:32,102 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-13 04:50:32,131 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 04:50:32,131 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 04:50:32,132 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 04:50:32,132 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 04:50:32,134 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 04:50:32,134 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 04:50:32,134 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 04:50:32,134 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-13 04:50:32,135 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-13 04:50:32,135 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-13 04:50:32,136 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-13 04:50:32,136 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-13 04:50:32,136 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-13 04:50:32,136 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 04:50:32,136 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 04:50:32,137 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 04:50:32,138 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 04:50:32,138 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 04:50:32,138 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 04:50:32,138 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-13 04:50:32,139 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-13 04:50:32,139 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-13 04:50:32,139 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 04:50:32,139 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 04:50:32,139 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-13 04:50:32,140 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 04:50:32,140 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-13 04:50:32,140 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 04:50:32,140 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 04:50:32,141 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 04:50:32,141 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 04:50:32,142 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-13 04:50:32,142 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 97795e7b99ddd869ecccb7f865206a167342b52333873684a94abd35acf6650e [2022-07-13 04:50:32,361 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 04:50:32,381 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 04:50:32,384 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 04:50:32,385 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 04:50:32,385 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 04:50:32,387 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/max.i [2022-07-13 04:50:32,467 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2751eaae/be11f62c850247d7a6ef0db5150f27cc/FLAGf4d3cf64d [2022-07-13 04:50:32,876 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 04:50:32,877 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max.i [2022-07-13 04:50:32,883 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2751eaae/be11f62c850247d7a6ef0db5150f27cc/FLAGf4d3cf64d [2022-07-13 04:50:33,303 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2751eaae/be11f62c850247d7a6ef0db5150f27cc [2022-07-13 04:50:33,306 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 04:50:33,307 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 04:50:33,309 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 04:50:33,309 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 04:50:33,315 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 04:50:33,316 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 04:50:33" (1/1) ... [2022-07-13 04:50:33,317 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16096e1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:50:33, skipping insertion in model container [2022-07-13 04:50:33,317 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 04:50:33" (1/1) ... [2022-07-13 04:50:33,323 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 04:50:33,339 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 04:50:33,475 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max.i[1295,1308] [2022-07-13 04:50:33,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 04:50:33,483 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 04:50:33,501 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max.i[1295,1308] [2022-07-13 04:50:33,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 04:50:33,514 INFO L208 MainTranslator]: Completed translation [2022-07-13 04:50:33,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:50:33 WrapperNode [2022-07-13 04:50:33,515 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 04:50:33,516 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 04:50:33,516 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 04:50:33,516 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 04:50:33,523 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:50:33" (1/1) ... [2022-07-13 04:50:33,529 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:50:33" (1/1) ... [2022-07-13 04:50:33,553 INFO L137 Inliner]: procedures = 16, calls = 27, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130 [2022-07-13 04:50:33,553 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 04:50:33,554 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 04:50:33,554 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 04:50:33,555 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 04:50:33,561 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:50:33" (1/1) ... [2022-07-13 04:50:33,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:50:33" (1/1) ... [2022-07-13 04:50:33,564 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:50:33" (1/1) ... [2022-07-13 04:50:33,564 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:50:33" (1/1) ... [2022-07-13 04:50:33,570 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:50:33" (1/1) ... [2022-07-13 04:50:33,575 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:50:33" (1/1) ... [2022-07-13 04:50:33,576 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:50:33" (1/1) ... [2022-07-13 04:50:33,578 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 04:50:33,579 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 04:50:33,580 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 04:50:33,580 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 04:50:33,581 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:50:33" (1/1) ... [2022-07-13 04:50:33,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:33,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:33,629 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 04:50:33,636 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 04:50:33,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 04:50:33,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 04:50:33,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 04:50:33,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 04:50:33,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 04:50:33,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 04:50:33,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 04:50:33,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 04:50:33,729 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 04:50:33,731 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 04:50:33,942 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 04:50:33,948 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 04:50:33,948 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-13 04:50:33,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:50:33 BoogieIcfgContainer [2022-07-13 04:50:33,950 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 04:50:33,955 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-13 04:50:33,955 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-13 04:50:33,958 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-13 04:50:33,958 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:50:33,958 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.07 04:50:33" (1/3) ... [2022-07-13 04:50:33,959 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e27ffa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 04:50:33, skipping insertion in model container [2022-07-13 04:50:33,959 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:50:33,959 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:50:33" (2/3) ... [2022-07-13 04:50:33,960 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e27ffa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 04:50:33, skipping insertion in model container [2022-07-13 04:50:33,960 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:50:33,960 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:50:33" (3/3) ... [2022-07-13 04:50:33,961 INFO L354 chiAutomizerObserver]: Analyzing ICFG max.i [2022-07-13 04:50:34,009 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-13 04:50:34,009 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-13 04:50:34,010 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-13 04:50:34,010 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-13 04:50:34,010 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-13 04:50:34,010 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-13 04:50:34,010 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-13 04:50:34,010 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-13 04:50:34,013 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 30 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 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 04:50:34,028 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2022-07-13 04:50:34,028 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:50:34,029 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:50:34,032 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-13 04:50:34,033 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-13 04:50:34,033 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-13 04:50:34,033 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 30 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 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 04:50:34,035 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2022-07-13 04:50:34,035 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:50:34,035 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:50:34,036 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-13 04:50:34,036 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-13 04:50:34,041 INFO L752 eck$LassoCheckResult]: Stem: 18#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int(109, 2, 0, 1);call write~init~int(97, 2, 1, 1);call write~init~int(120, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);~N~0 := 0; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~post11#1, main_~i~1#1, main_#t~ret13#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;~N~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 8#L31true assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 15#L22-3true [2022-07-13 04:50:34,041 INFO L754 eck$LassoCheckResult]: Loop: 15#L22-3true assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 13#L23true assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 27#L23-2true max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 10#L22-2true max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 15#L22-3true [2022-07-13 04:50:34,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:50:34,046 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-13 04:50:34,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:50:34,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918567659] [2022-07-13 04:50:34,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:50:34,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:50:34,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:50:34,163 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:50:34,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:50:34,214 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:50:34,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:50:34,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1326822, now seen corresponding path program 1 times [2022-07-13 04:50:34,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:50:34,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369816165] [2022-07-13 04:50:34,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:50:34,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:50:34,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:50:34,240 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:50:34,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:50:34,255 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:50:34,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:50:34,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1805089543, now seen corresponding path program 1 times [2022-07-13 04:50:34,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:50:34,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812210697] [2022-07-13 04:50:34,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:50:34,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:50:34,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:50:34,303 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:50:34,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:50:34,346 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:50:34,927 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:50:34,928 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:50:34,928 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:50:34,928 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:50:34,929 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 04:50:34,929 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:34,929 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:50:34,929 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:50:34,929 INFO L133 ssoRankerPreferences]: Filename of dumped script: max.i_Iteration1_Lasso [2022-07-13 04:50:34,930 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:50:34,930 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:50:34,947 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 04:50:34,952 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 04:50:34,954 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 04:50:34,957 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 04:50:34,963 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 04:50:34,968 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 04:50:35,324 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 04:50:35,327 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 04:50:35,330 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 04:50:35,333 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 04:50:35,344 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 04:50:35,346 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 04:50:35,348 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 04:50:35,351 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 04:50:35,353 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 04:50:35,357 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 04:50:35,359 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 04:50:35,362 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 04:50:35,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 04:50:35,369 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 04:50:35,371 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 04:50:35,374 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 04:50:35,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 04:50:35,734 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 04:50:35,737 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 04:50:35,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:35,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:35,741 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 04:50:35,744 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 04:50:35,747 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 04:50:35,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:50:35,754 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:50:35,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:50:35,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:50:35,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:50:35,757 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:50:35,757 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:50:35,768 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:50:35,785 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 04:50:35,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:35,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:35,787 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 04:50:35,788 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 04:50:35,791 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 04:50:35,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:50:35,799 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:50:35,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:50:35,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:50:35,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:50:35,800 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:50:35,800 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:50:35,803 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:50:35,830 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 04:50:35,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:35,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:35,831 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 04:50:35,832 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 04:50:35,835 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 04:50:35,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:50:35,841 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:50:35,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:50:35,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:50:35,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:50:35,843 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:50:35,843 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:50:35,845 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:50:35,866 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 04:50:35,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:35,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:35,868 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 04:50:35,870 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 04:50:35,872 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 04:50:35,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:50:35,880 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:50:35,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:50:35,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:50:35,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:50:35,881 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:50:35,881 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:50:35,899 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:50:35,926 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 04:50:35,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:35,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:35,930 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 04:50:35,938 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 04:50:35,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:50:35,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:50:35,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:50:35,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:50:35,950 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:50:35,950 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:50:35,951 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 04:50:35,979 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:50:35,997 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 04:50:35,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:35,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:36,000 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 04:50:36,001 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 04:50:36,003 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 04:50:36,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:50:36,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:50:36,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:50:36,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:50:36,013 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:50:36,013 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:50:36,039 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:50:36,056 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 04:50:36,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:36,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:36,058 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 04:50:36,062 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 04:50:36,063 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 04:50:36,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:50:36,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:50:36,069 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:50:36,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:50:36,074 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:50:36,075 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:50:36,090 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:50:36,112 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 04:50:36,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:36,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:36,114 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 04:50:36,115 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 04:50:36,118 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 04:50:36,126 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:50:36,126 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:50:36,127 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:50:36,127 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:50:36,133 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:50:36,133 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:50:36,143 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 04:50:36,188 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2022-07-13 04:50:36,188 INFO L444 ModelExtractionUtils]: 3 out of 19 variables were initially zero. Simplification set additionally 11 variables to zero. [2022-07-13 04:50:36,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:36,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:36,193 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 04:50:36,242 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 04:50:36,264 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 04:50:36,264 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-13 04:50:36,264 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 04:50:36,265 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_max_~i~0#1, v_rep(select #length ULTIMATE.start_max_~x#1.base)_1) = -2*ULTIMATE.start_max_~i~0#1 + 1*v_rep(select #length ULTIMATE.start_max_~x#1.base)_1 Supporting invariants [-2*~N~0 + 1*v_rep(select #length ULTIMATE.start_max_~x#1.base)_1 >= 0] [2022-07-13 04:50:36,291 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 04:50:36,326 INFO L293 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2022-07-13 04:50:36,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:50:36,409 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 04:50:36,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:50:36,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 04:50:36,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:50:36,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:50:36,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 04:50:36,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:50:36,506 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 04:50:36,536 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 04:50:36,537 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 30 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 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 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 04:50:36,596 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 30 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 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 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 63 states and 87 transitions. Complement of second has 8 states. [2022-07-13 04:50:36,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-13 04:50:36,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 04:50:36,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-07-13 04:50:36,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 46 transitions. Stem has 3 letters. Loop has 4 letters. [2022-07-13 04:50:36,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:50:36,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 46 transitions. Stem has 7 letters. Loop has 4 letters. [2022-07-13 04:50:36,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:50:36,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 46 transitions. Stem has 3 letters. Loop has 8 letters. [2022-07-13 04:50:36,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:50:36,606 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 87 transitions. [2022-07-13 04:50:36,609 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2022-07-13 04:50:36,613 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 23 states and 32 transitions. [2022-07-13 04:50:36,613 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2022-07-13 04:50:36,614 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2022-07-13 04:50:36,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 32 transitions. [2022-07-13 04:50:36,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:50:36,614 INFO L369 hiAutomatonCegarLoop]: Abstraction has 23 states and 32 transitions. [2022-07-13 04:50:36,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 32 transitions. [2022-07-13 04:50:36,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-07-13 04:50:36,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:50:36,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 32 transitions. [2022-07-13 04:50:36,636 INFO L392 hiAutomatonCegarLoop]: Abstraction has 23 states and 32 transitions. [2022-07-13 04:50:36,636 INFO L374 stractBuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2022-07-13 04:50:36,636 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-13 04:50:36,636 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 32 transitions. [2022-07-13 04:50:36,637 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2022-07-13 04:50:36,637 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:50:36,637 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:50:36,638 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-13 04:50:36,638 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-13 04:50:36,638 INFO L752 eck$LassoCheckResult]: Stem: 199#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int(109, 2, 0, 1);call write~init~int(97, 2, 1, 1);call write~init~int(120, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);~N~0 := 0; 200#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~post11#1, main_~i~1#1, main_#t~ret13#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;~N~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 212#L31 assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 213#L22-3 assume !(max_~i~0#1 < ~N~0); 211#L22-4 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 207#L25 main_#t~ret6#1 := max_#res#1;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret6#1;havoc main_#t~ret6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem8#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem8#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 206#L22-8 [2022-07-13 04:50:36,638 INFO L754 eck$LassoCheckResult]: Loop: 206#L22-8 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 210#L23-3 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 195#L23-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 196#L22-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 206#L22-8 [2022-07-13 04:50:36,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:50:36,639 INFO L85 PathProgramCache]: Analyzing trace with hash 889511083, now seen corresponding path program 1 times [2022-07-13 04:50:36,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:50:36,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615914274] [2022-07-13 04:50:36,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:50:36,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:50:36,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:50:36,685 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 04:50:36,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:50:36,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615914274] [2022-07-13 04:50:36,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615914274] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:50:36,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:50:36,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 04:50:36,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781538963] [2022-07-13 04:50:36,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:50:36,689 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 04:50:36,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:50:36,690 INFO L85 PathProgramCache]: Analyzing trace with hash 2034854, now seen corresponding path program 1 times [2022-07-13 04:50:36,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:50:36,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189608617] [2022-07-13 04:50:36,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:50:36,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:50:36,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:50:36,695 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:50:36,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:50:36,701 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:50:36,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:50:36,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 04:50:36,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 04:50:36,757 INFO L87 Difference]: Start difference. First operand 23 states and 32 transitions. cyclomatic complexity: 13 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 04:50:36,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:50:36,800 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2022-07-13 04:50:36,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 04:50:36,801 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2022-07-13 04:50:36,802 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2022-07-13 04:50:36,803 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 33 transitions. [2022-07-13 04:50:36,804 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2022-07-13 04:50:36,804 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2022-07-13 04:50:36,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 33 transitions. [2022-07-13 04:50:36,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:50:36,804 INFO L369 hiAutomatonCegarLoop]: Abstraction has 26 states and 33 transitions. [2022-07-13 04:50:36,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 33 transitions. [2022-07-13 04:50:36,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2022-07-13 04:50:36,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 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 04:50:36,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2022-07-13 04:50:36,808 INFO L392 hiAutomatonCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-07-13 04:50:36,808 INFO L374 stractBuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-07-13 04:50:36,808 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-13 04:50:36,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2022-07-13 04:50:36,811 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2022-07-13 04:50:36,811 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:50:36,811 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:50:36,812 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:50:36,812 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-13 04:50:36,812 INFO L752 eck$LassoCheckResult]: Stem: 254#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int(109, 2, 0, 1);call write~init~int(97, 2, 1, 1);call write~init~int(120, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);~N~0 := 0; 255#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~post11#1, main_~i~1#1, main_#t~ret13#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;~N~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 266#L31 assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 267#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 272#L23 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 271#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 269#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 270#L22-3 assume !(max_~i~0#1 < ~N~0); 268#L22-4 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 261#L25 main_#t~ret6#1 := max_#res#1;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret6#1;havoc main_#t~ret6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem8#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem8#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 262#L22-8 [2022-07-13 04:50:36,813 INFO L754 eck$LassoCheckResult]: Loop: 262#L22-8 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 264#L23-3 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 250#L23-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 251#L22-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 262#L22-8 [2022-07-13 04:50:36,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:50:36,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1805667996, now seen corresponding path program 1 times [2022-07-13 04:50:36,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:50:36,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777125789] [2022-07-13 04:50:36,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:50:36,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:50:36,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:50:36,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:50:36,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:50:36,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777125789] [2022-07-13 04:50:36,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777125789] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 04:50:36,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694079191] [2022-07-13 04:50:36,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:50:36,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 04:50:36,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:36,872 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 04:50:36,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-13 04:50:36,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:50:36,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 04:50:36,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:50:36,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:50:36,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 04:50:37,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:50:37,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694079191] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 04:50:37,011 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 04:50:37,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-07-13 04:50:37,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612867920] [2022-07-13 04:50:37,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 04:50:37,012 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 04:50:37,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:50:37,013 INFO L85 PathProgramCache]: Analyzing trace with hash 2034854, now seen corresponding path program 2 times [2022-07-13 04:50:37,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:50:37,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161023030] [2022-07-13 04:50:37,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:50:37,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:50:37,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:50:37,033 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:50:37,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:50:37,045 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:50:37,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:50:37,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 04:50:37,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-07-13 04:50:37,100 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. cyclomatic complexity: 10 Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 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 04:50:37,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:50:37,161 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-07-13 04:50:37,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 04:50:37,162 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 38 transitions. [2022-07-13 04:50:37,162 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2022-07-13 04:50:37,163 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 38 transitions. [2022-07-13 04:50:37,163 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2022-07-13 04:50:37,163 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2022-07-13 04:50:37,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 38 transitions. [2022-07-13 04:50:37,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:50:37,164 INFO L369 hiAutomatonCegarLoop]: Abstraction has 30 states and 38 transitions. [2022-07-13 04:50:37,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 38 transitions. [2022-07-13 04:50:37,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2022-07-13 04:50:37,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 26 states have internal predecessors, (34), 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 04:50:37,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2022-07-13 04:50:37,166 INFO L392 hiAutomatonCegarLoop]: Abstraction has 27 states and 34 transitions. [2022-07-13 04:50:37,166 INFO L374 stractBuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2022-07-13 04:50:37,166 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-13 04:50:37,166 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions. [2022-07-13 04:50:37,167 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2022-07-13 04:50:37,167 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:50:37,167 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:50:37,167 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-13 04:50:37,167 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-13 04:50:37,168 INFO L752 eck$LassoCheckResult]: Stem: 371#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int(109, 2, 0, 1);call write~init~int(97, 2, 1, 1);call write~init~int(120, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);~N~0 := 0; 372#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~post11#1, main_~i~1#1, main_#t~ret13#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;~N~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 383#L31 assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 384#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 391#L23 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 393#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 386#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 387#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 390#L23 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 388#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 389#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 392#L22-3 assume !(max_~i~0#1 < ~N~0); 385#L22-4 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 378#L25 main_#t~ret6#1 := max_#res#1;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret6#1;havoc main_#t~ret6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem8#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem8#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 379#L22-8 [2022-07-13 04:50:37,168 INFO L754 eck$LassoCheckResult]: Loop: 379#L22-8 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 381#L23-3 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 367#L23-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 368#L22-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 379#L22-8 [2022-07-13 04:50:37,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:50:37,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1818198429, now seen corresponding path program 2 times [2022-07-13 04:50:37,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:50:37,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491863910] [2022-07-13 04:50:37,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:50:37,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:50:37,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:50:37,204 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:50:37,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:50:37,224 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:50:37,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:50:37,225 INFO L85 PathProgramCache]: Analyzing trace with hash 2034854, now seen corresponding path program 3 times [2022-07-13 04:50:37,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:50:37,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429274416] [2022-07-13 04:50:37,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:50:37,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:50:37,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:50:37,231 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:50:37,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:50:37,235 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:50:37,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:50:37,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1198284866, now seen corresponding path program 1 times [2022-07-13 04:50:37,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:50:37,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065027060] [2022-07-13 04:50:37,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:50:37,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:50:37,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:50:37,452 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:50:37,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:50:37,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065027060] [2022-07-13 04:50:37,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065027060] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 04:50:37,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939089717] [2022-07-13 04:50:37,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:50:37,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 04:50:37,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:37,456 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 04:50:37,475 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 04:50:37,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:50:37,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-13 04:50:37,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:50:37,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2022-07-13 04:50:37,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-13 04:50:37,751 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:50:37,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 04:50:37,863 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 04:50:37,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2022-07-13 04:50:38,013 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:50:38,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939089717] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 04:50:38,014 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 04:50:38,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2022-07-13 04:50:38,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30659855] [2022-07-13 04:50:38,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 04:50:38,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:50:38,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-13 04:50:38,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2022-07-13 04:50:38,062 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. cyclomatic complexity: 11 Second operand has 22 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 states have internal predecessors, (42), 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 04:50:39,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:50:39,210 INFO L93 Difference]: Finished difference Result 128 states and 162 transitions. [2022-07-13 04:50:39,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-13 04:50:39,211 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 162 transitions. [2022-07-13 04:50:39,213 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 40 [2022-07-13 04:50:39,215 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 128 states and 162 transitions. [2022-07-13 04:50:39,215 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 108 [2022-07-13 04:50:39,216 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 108 [2022-07-13 04:50:39,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 128 states and 162 transitions. [2022-07-13 04:50:39,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:50:39,216 INFO L369 hiAutomatonCegarLoop]: Abstraction has 128 states and 162 transitions. [2022-07-13 04:50:39,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states and 162 transitions. [2022-07-13 04:50:39,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 39. [2022-07-13 04:50:39,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 38 states have internal predecessors, (50), 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 04:50:39,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2022-07-13 04:50:39,222 INFO L392 hiAutomatonCegarLoop]: Abstraction has 39 states and 50 transitions. [2022-07-13 04:50:39,222 INFO L374 stractBuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2022-07-13 04:50:39,222 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-13 04:50:39,222 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 50 transitions. [2022-07-13 04:50:39,222 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2022-07-13 04:50:39,222 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:50:39,222 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:50:39,223 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:50:39,223 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-13 04:50:39,223 INFO L752 eck$LassoCheckResult]: Stem: 681#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int(109, 2, 0, 1);call write~init~int(97, 2, 1, 1);call write~init~int(120, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);~N~0 := 0; 682#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~post11#1, main_~i~1#1, main_#t~ret13#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;~N~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 693#L31 assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 694#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 703#L23 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 712#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 715#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 714#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 709#L23 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 699#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 700#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 707#L22-3 assume !(max_~i~0#1 < ~N~0); 708#L22-4 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 688#L25 main_#t~ret6#1 := max_#res#1;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret6#1;havoc main_#t~ret6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem8#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem8#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 689#L22-8 [2022-07-13 04:50:39,223 INFO L754 eck$LassoCheckResult]: Loop: 689#L22-8 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 691#L23-3 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 677#L23-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 678#L22-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 689#L22-8 [2022-07-13 04:50:39,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:50:39,223 INFO L85 PathProgramCache]: Analyzing trace with hash -2083741857, now seen corresponding path program 1 times [2022-07-13 04:50:39,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:50:39,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450688928] [2022-07-13 04:50:39,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:50:39,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:50:39,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:50:39,239 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:50:39,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:50:39,253 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:50:39,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:50:39,254 INFO L85 PathProgramCache]: Analyzing trace with hash 2034854, now seen corresponding path program 4 times [2022-07-13 04:50:39,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:50:39,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985846851] [2022-07-13 04:50:39,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:50:39,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:50:39,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:50:39,259 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:50:39,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:50:39,269 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:50:39,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:50:39,270 INFO L85 PathProgramCache]: Analyzing trace with hash -2085565180, now seen corresponding path program 1 times [2022-07-13 04:50:39,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:50:39,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539326692] [2022-07-13 04:50:39,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:50:39,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:50:39,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:50:39,293 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:50:39,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:50:39,309 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:50:40,090 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:50:40,090 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:50:40,090 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:50:40,090 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:50:40,090 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 04:50:40,090 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:40,090 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:50:40,090 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:50:40,090 INFO L133 ssoRankerPreferences]: Filename of dumped script: max.i_Iteration5_Lasso [2022-07-13 04:50:40,090 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:50:40,090 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:50:40,093 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 04:50:40,096 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 04:50:40,097 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 04:50:40,103 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 04:50:40,106 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 04:50:40,108 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 04:50:40,110 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 04:50:40,112 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 04:50:40,113 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 04:50:40,116 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 04:50:40,117 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 04:50:40,119 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 04:50:40,121 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 04:50:40,123 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 04:50:40,124 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 04:50:40,126 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 04:50:40,129 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 04:50:40,131 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 04:50:40,133 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 04:50:40,135 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 04:50:40,809 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 04:50:41,252 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 04:50:41,252 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 04:50:41,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:41,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:41,254 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:50:41,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-13 04:50:41,256 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 04:50:41,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:50:41,262 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:50:41,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:50:41,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:50:41,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:50:41,263 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:50:41,263 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:50:41,264 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:50:41,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-13 04:50:41,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:41,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:41,284 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:50:41,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-13 04:50:41,286 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 04:50:41,292 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:50:41,292 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:50:41,292 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:50:41,292 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:50:41,292 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:50:41,293 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:50:41,293 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:50:41,294 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:50:41,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-13 04:50:41,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:41,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:41,311 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:50:41,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-13 04:50:41,313 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 04:50:41,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:50:41,319 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:50:41,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:50:41,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:50:41,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:50:41,320 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:50:41,320 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:50:41,321 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:50:41,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-07-13 04:50:41,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:41,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:41,338 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 04:50:41,348 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 04:50:41,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:50:41,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:50:41,356 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:50:41,356 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:50:41,357 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:50:41,357 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:50:41,360 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 04:50:41,375 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:50:41,404 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 04:50:41,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:41,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:41,406 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 04:50:41,414 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 04:50:41,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:50:41,422 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:50:41,422 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:50:41,422 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:50:41,422 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:50:41,422 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:50:41,422 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:50:41,424 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 04:50:41,431 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:50:41,457 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 04:50:41,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:41,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:41,459 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 04:50:41,460 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 04:50:41,462 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 04:50:41,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:50:41,470 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:50:41,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:50:41,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:50:41,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:50:41,472 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:50:41,472 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:50:41,485 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:50:41,504 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 04:50:41,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:41,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:41,506 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 04:50:41,507 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 04:50:41,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 04:50:41,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:50:41,515 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:50:41,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:50:41,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:50:41,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:50:41,516 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:50:41,516 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:50:41,517 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:50:41,533 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 04:50:41,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:41,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:41,534 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 04:50:41,535 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 04:50:41,536 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 04:50:41,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:50:41,542 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:50:41,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:50:41,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:50:41,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:50:41,547 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:50:41,547 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:50:41,548 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:50:41,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-13 04:50:41,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:41,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:41,567 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 04:50:41,570 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 04:50:41,571 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 04:50:41,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:50:41,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:50:41,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:50:41,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:50:41,578 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:50:41,578 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:50:41,580 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:50:41,596 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 04:50:41,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:41,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:41,598 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 04:50:41,601 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 04:50:41,602 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 04:50:41,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:50:41,608 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:50:41,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:50:41,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:50:41,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:50:41,609 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:50:41,609 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:50:41,610 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:50:41,625 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 04:50:41,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:41,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:41,627 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 04:50:41,628 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 04:50:41,631 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 04:50:41,637 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:50:41,637 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:50:41,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:50:41,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:50:41,637 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:50:41,637 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:50:41,637 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:50:41,638 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:50:41,654 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 04:50:41,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:41,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:41,656 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 04:50:41,656 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 04:50:41,659 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 04:50:41,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:50:41,665 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:50:41,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:50:41,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:50:41,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:50:41,665 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:50:41,665 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:50:41,671 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:50:41,687 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 04:50:41,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:41,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:41,695 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:50:41,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-13 04:50:41,697 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 04:50:41,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:50:41,704 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:50:41,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:50:41,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:50:41,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:50:41,704 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:50:41,704 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:50:41,705 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:50:41,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-07-13 04:50:41,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:41,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:41,722 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:50:41,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-13 04:50:41,726 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 04:50:41,732 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:50:41,732 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:50:41,732 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:50:41,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:50:41,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:50:41,733 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:50:41,733 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:50:41,733 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:50:41,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-07-13 04:50:41,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:41,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:41,751 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:50:41,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-07-13 04:50:41,753 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 04:50:41,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:50:41,759 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:50:41,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:50:41,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:50:41,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:50:41,759 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:50:41,759 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:50:41,760 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:50:41,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-07-13 04:50:41,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:41,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:41,780 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 04:50:41,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-07-13 04:50:41,782 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 04:50:41,788 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:50:41,788 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:50:41,788 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:50:41,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:50:41,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:50:41,788 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:50:41,789 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:50:41,789 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:50:41,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-07-13 04:50:41,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:41,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:41,809 INFO L229 MonitoredProcess]: Starting monitored process 29 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 04:50:41,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-07-13 04:50:41,811 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 04:50:41,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:50:41,818 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:50:41,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:50:41,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:50:41,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:50:41,818 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:50:41,818 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:50:41,819 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:50:41,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-07-13 04:50:41,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:41,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:41,836 INFO L229 MonitoredProcess]: Starting monitored process 30 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 04:50:41,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-07-13 04:50:41,838 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 04:50:41,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:50:41,845 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:50:41,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:50:41,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:50:41,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:50:41,845 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:50:41,845 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:50:41,846 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:50:41,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-07-13 04:50:41,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:41,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:41,863 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 04:50:41,864 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 04:50:41,866 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 04:50:41,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:50:41,872 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:50:41,872 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:50:41,872 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:50:41,872 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:50:41,873 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:50:41,873 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:50:41,874 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:50:41,889 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 04:50:41,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:41,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:41,891 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 04:50:41,892 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 04:50:41,894 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 04:50:41,900 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:50:41,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:50:41,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:50:41,900 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:50:41,902 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:50:41,902 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:50:41,907 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:50:41,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-07-13 04:50:41,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:41,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:41,925 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 04:50:41,926 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 04:50:41,927 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 04:50:41,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:50:41,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:50:41,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:50:41,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:50:41,934 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:50:41,934 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:50:41,943 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:50:41,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-07-13 04:50:41,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:41,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:41,962 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 04:50:41,963 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 04:50:41,964 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 04:50:41,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:50:41,970 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-07-13 04:50:41,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:50:41,971 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:50:41,976 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-07-13 04:50:41,976 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:50:41,983 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:50:42,001 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 04:50:42,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:42,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:42,003 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 04:50:42,004 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 04:50:42,005 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 04:50:42,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:50:42,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:50:42,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:50:42,012 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:50:42,013 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:50:42,013 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:50:42,015 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:50:42,031 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 04:50:42,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:42,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:42,033 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 04:50:42,034 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 04:50:42,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 04:50:42,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:50:42,042 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:50:42,042 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:50:42,042 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:50:42,043 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:50:42,043 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:50:42,053 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:50:42,069 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 04:50:42,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:42,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:42,071 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 04:50:42,072 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 04:50:42,073 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 04:50:42,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:50:42,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:50:42,080 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:50:42,080 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:50:42,081 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:50:42,081 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:50:42,084 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:50:42,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-07-13 04:50:42,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:42,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:42,101 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 04:50:42,102 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 04:50:42,104 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 04:50:42,110 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:50:42,110 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:50:42,110 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:50:42,110 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:50:42,112 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:50:42,112 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:50:42,119 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:50:42,168 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 04:50:42,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:42,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:42,170 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 04:50:42,170 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 04:50:42,172 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 04:50:42,178 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:50:42,179 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:50:42,179 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:50:42,179 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:50:42,180 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:50:42,181 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:50:42,183 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:50:42,199 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 04:50:42,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:42,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:42,200 INFO L229 MonitoredProcess]: Starting monitored process 40 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 04:50:42,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-07-13 04:50:42,203 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 04:50:42,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:50:42,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:50:42,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:50:42,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:50:42,210 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:50:42,210 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:50:42,213 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:50:42,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2022-07-13 04:50:42,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:42,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:42,230 INFO L229 MonitoredProcess]: Starting monitored process 41 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 04:50:42,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-07-13 04:50:42,232 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 04:50:42,238 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:50:42,238 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:50:42,238 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:50:42,238 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:50:42,241 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:50:42,241 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:50:42,244 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:50:42,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-07-13 04:50:42,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:42,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:42,264 INFO L229 MonitoredProcess]: Starting monitored process 42 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 04:50:42,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-07-13 04:50:42,266 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 04:50:42,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:50:42,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:50:42,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:50:42,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:50:42,274 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:50:42,274 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:50:42,276 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:50:42,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2022-07-13 04:50:42,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:42,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:42,294 INFO L229 MonitoredProcess]: Starting monitored process 43 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 04:50:42,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-07-13 04:50:42,296 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 04:50:42,302 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:50:42,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:50:42,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:50:42,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:50:42,304 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:50:42,304 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:50:42,306 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:50:42,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2022-07-13 04:50:42,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:42,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:42,324 INFO L229 MonitoredProcess]: Starting monitored process 44 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 04:50:42,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-07-13 04:50:42,326 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 04:50:42,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:50:42,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:50:42,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:50:42,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:50:42,333 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:50:42,333 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:50:42,336 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:50:42,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2022-07-13 04:50:42,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:42,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:42,353 INFO L229 MonitoredProcess]: Starting monitored process 45 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 04:50:42,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-07-13 04:50:42,355 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 04:50:42,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:50:42,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:50:42,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:50:42,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:50:42,368 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:50:42,368 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:50:42,375 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:50:42,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2022-07-13 04:50:42,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:42,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:42,392 INFO L229 MonitoredProcess]: Starting monitored process 46 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 04:50:42,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-07-13 04:50:42,397 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 04:50:42,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:50:42,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:50:42,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:50:42,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:50:42,407 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 04:50:42,408 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 04:50:42,431 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 04:50:42,444 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2022-07-13 04:50:42,444 INFO L444 ModelExtractionUtils]: 14 out of 25 variables were initially zero. Simplification set additionally 8 variables to zero. [2022-07-13 04:50:42,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:42,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:42,451 INFO L229 MonitoredProcess]: Starting monitored process 47 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 04:50:42,456 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 04:50:42,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-07-13 04:50:42,463 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-13 04:50:42,463 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 04:50:42,463 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_max_~i~0#1, ~N~0) = -1*ULTIMATE.start_max_~i~0#1 + 1*~N~0 Supporting invariants [] [2022-07-13 04:50:42,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2022-07-13 04:50:42,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2022-07-13 04:50:42,560 INFO L293 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2022-07-13 04:50:42,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:50:42,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:50:42,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 04:50:42,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:50:42,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:50:42,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 04:50:42,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:50:42,635 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 04:50:42,636 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 04:50:42,636 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 50 transitions. cyclomatic complexity: 16 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 04:50:42,655 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 50 transitions. cyclomatic complexity: 16. 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 49 states and 67 transitions. Complement of second has 7 states. [2022-07-13 04:50:42,655 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 04:50:42,656 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 04:50:42,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2022-07-13 04:50:42,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 14 letters. Loop has 4 letters. [2022-07-13 04:50:42,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:50:42,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 18 letters. Loop has 4 letters. [2022-07-13 04:50:42,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:50:42,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 14 letters. Loop has 8 letters. [2022-07-13 04:50:42,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:50:42,657 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 67 transitions. [2022-07-13 04:50:42,658 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-07-13 04:50:42,658 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 40 states and 52 transitions. [2022-07-13 04:50:42,658 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2022-07-13 04:50:42,659 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2022-07-13 04:50:42,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 52 transitions. [2022-07-13 04:50:42,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:50:42,659 INFO L369 hiAutomatonCegarLoop]: Abstraction has 40 states and 52 transitions. [2022-07-13 04:50:42,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 52 transitions. [2022-07-13 04:50:42,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-07-13 04:50:42,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.3) internal successors, (52), 39 states have internal predecessors, (52), 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 04:50:42,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2022-07-13 04:50:42,661 INFO L392 hiAutomatonCegarLoop]: Abstraction has 40 states and 52 transitions. [2022-07-13 04:50:42,661 INFO L374 stractBuchiCegarLoop]: Abstraction has 40 states and 52 transitions. [2022-07-13 04:50:42,661 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-13 04:50:42,661 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 52 transitions. [2022-07-13 04:50:42,662 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-07-13 04:50:42,662 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:50:42,662 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:50:42,663 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:50:42,663 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 04:50:42,663 INFO L752 eck$LassoCheckResult]: Stem: 943#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int(109, 2, 0, 1);call write~init~int(97, 2, 1, 1);call write~init~int(120, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);~N~0 := 0; 944#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~post11#1, main_~i~1#1, main_#t~ret13#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;~N~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 958#L31 assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 959#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 963#L23 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 962#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 960#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 961#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 965#L23 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 971#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 970#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 969#L22-3 assume !(max_~i~0#1 < ~N~0); 968#L22-4 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 967#L25 main_#t~ret6#1 := max_#res#1;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret6#1;havoc main_#t~ret6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem8#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem8#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 966#L22-8 assume !(max_~i~0#1 < ~N~0); 953#L22-9 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 956#L25-1 main_#t~ret9#1 := max_#res#1;assume { :end_inline_max } true;main_~ret2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem10#1;havoc main_#t~mem10#1;main_~i~1#1 := 0; 949#L43-3 [2022-07-13 04:50:42,663 INFO L754 eck$LassoCheckResult]: Loop: 949#L43-3 assume !!(main_~i~1#1 < ~N~0 - 1);call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~1#1), 4);call write~int(main_#t~mem12#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~mem12#1; 948#L43-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 949#L43-3 [2022-07-13 04:50:42,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:50:42,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1591298555, now seen corresponding path program 1 times [2022-07-13 04:50:42,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:50:42,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888283622] [2022-07-13 04:50:42,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:50:42,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:50:42,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:50:42,691 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 04:50:42,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:50:42,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888283622] [2022-07-13 04:50:42,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888283622] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:50:42,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:50:42,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 04:50:42,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763299861] [2022-07-13 04:50:42,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:50:42,692 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 04:50:42,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:50:42,692 INFO L85 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 1 times [2022-07-13 04:50:42,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:50:42,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091371205] [2022-07-13 04:50:42,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:50:42,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:50:42,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:50:42,696 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:50:42,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:50:42,698 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:50:42,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:50:42,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 04:50:42,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 04:50:42,745 INFO L87 Difference]: Start difference. First operand 40 states and 52 transitions. cyclomatic complexity: 17 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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 04:50:42,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:50:42,774 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2022-07-13 04:50:42,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 04:50:42,775 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 59 transitions. [2022-07-13 04:50:42,775 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-07-13 04:50:42,776 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 59 transitions. [2022-07-13 04:50:42,776 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2022-07-13 04:50:42,776 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2022-07-13 04:50:42,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 59 transitions. [2022-07-13 04:50:42,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:50:42,776 INFO L369 hiAutomatonCegarLoop]: Abstraction has 47 states and 59 transitions. [2022-07-13 04:50:42,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 59 transitions. [2022-07-13 04:50:42,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2022-07-13 04:50:42,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.25) internal successors, (50), 39 states have internal predecessors, (50), 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 04:50:42,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2022-07-13 04:50:42,779 INFO L392 hiAutomatonCegarLoop]: Abstraction has 40 states and 50 transitions. [2022-07-13 04:50:42,779 INFO L374 stractBuchiCegarLoop]: Abstraction has 40 states and 50 transitions. [2022-07-13 04:50:42,779 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-13 04:50:42,779 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 50 transitions. [2022-07-13 04:50:42,779 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-07-13 04:50:42,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:50:42,779 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:50:42,780 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:50:42,780 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 04:50:42,780 INFO L752 eck$LassoCheckResult]: Stem: 1037#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int(109, 2, 0, 1);call write~init~int(97, 2, 1, 1);call write~init~int(120, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);~N~0 := 0; 1038#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~post11#1, main_~i~1#1, main_#t~ret13#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;~N~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 1051#L31 assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 1052#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1059#L23 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 1060#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1055#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1056#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1061#L23 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 1070#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1068#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1066#L22-3 assume !(max_~i~0#1 < ~N~0); 1053#L22-4 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 1054#L25 main_#t~ret6#1 := max_#res#1;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret6#1;havoc main_#t~ret6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem8#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem8#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 1047#L22-8 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1048#L23-3 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 1035#L23-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1036#L22-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1046#L22-8 assume !(max_~i~0#1 < ~N~0); 1049#L22-9 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 1050#L25-1 main_#t~ret9#1 := max_#res#1;assume { :end_inline_max } true;main_~ret2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem10#1;havoc main_#t~mem10#1;main_~i~1#1 := 0; 1043#L43-3 [2022-07-13 04:50:42,780 INFO L754 eck$LassoCheckResult]: Loop: 1043#L43-3 assume !!(main_~i~1#1 < ~N~0 - 1);call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~1#1), 4);call write~int(main_#t~mem12#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~mem12#1; 1042#L43-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1043#L43-3 [2022-07-13 04:50:42,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:50:42,781 INFO L85 PathProgramCache]: Analyzing trace with hash -18080898, now seen corresponding path program 1 times [2022-07-13 04:50:42,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:50:42,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576134345] [2022-07-13 04:50:42,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:50:42,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:50:42,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:50:42,825 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 04:50:42,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:50:42,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576134345] [2022-07-13 04:50:42,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576134345] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 04:50:42,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607852801] [2022-07-13 04:50:42,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:50:42,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 04:50:42,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:42,828 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 04:50:42,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-07-13 04:50:42,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:50:42,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 04:50:42,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:50:42,924 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 04:50:42,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 04:50:42,959 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 04:50:42,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607852801] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 04:50:42,960 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 04:50:42,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-07-13 04:50:42,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252911915] [2022-07-13 04:50:42,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 04:50:42,962 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 04:50:42,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:50:42,962 INFO L85 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 2 times [2022-07-13 04:50:42,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:50:42,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635269793] [2022-07-13 04:50:42,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:50:42,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:50:42,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:50:42,968 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:50:42,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:50:42,971 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:50:43,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:50:43,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 04:50:43,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-07-13 04:50:43,018 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. cyclomatic complexity: 15 Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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 04:50:43,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:50:43,087 INFO L93 Difference]: Finished difference Result 60 states and 75 transitions. [2022-07-13 04:50:43,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 04:50:43,090 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 75 transitions. [2022-07-13 04:50:43,090 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-07-13 04:50:43,093 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 60 states and 75 transitions. [2022-07-13 04:50:43,094 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2022-07-13 04:50:43,094 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2022-07-13 04:50:43,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 75 transitions. [2022-07-13 04:50:43,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:50:43,095 INFO L369 hiAutomatonCegarLoop]: Abstraction has 60 states and 75 transitions. [2022-07-13 04:50:43,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 75 transitions. [2022-07-13 04:50:43,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 44. [2022-07-13 04:50:43,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.25) internal successors, (55), 43 states have internal predecessors, (55), 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 04:50:43,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2022-07-13 04:50:43,101 INFO L392 hiAutomatonCegarLoop]: Abstraction has 44 states and 55 transitions. [2022-07-13 04:50:43,102 INFO L374 stractBuchiCegarLoop]: Abstraction has 44 states and 55 transitions. [2022-07-13 04:50:43,102 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-13 04:50:43,102 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 55 transitions. [2022-07-13 04:50:43,102 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-07-13 04:50:43,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:50:43,102 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:50:43,103 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:50:43,103 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 04:50:43,104 INFO L752 eck$LassoCheckResult]: Stem: 1270#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int(109, 2, 0, 1);call write~init~int(97, 2, 1, 1);call write~init~int(120, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);~N~0 := 0; 1271#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~post11#1, main_~i~1#1, main_#t~ret13#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;~N~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 1284#L31 assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 1285#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1293#L23 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 1290#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1287#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1288#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1291#L23 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 1292#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1304#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1302#L22-3 assume !(max_~i~0#1 < ~N~0); 1299#L22-4 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 1298#L25 main_#t~ret6#1 := max_#res#1;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret6#1;havoc main_#t~ret6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem8#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem8#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 1297#L22-8 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1296#L23-3 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 1295#L23-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1294#L22-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1281#L22-8 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1282#L23-3 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 1266#L23-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1267#L22-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1279#L22-8 assume !(max_~i~0#1 < ~N~0); 1289#L22-9 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 1283#L25-1 main_#t~ret9#1 := max_#res#1;assume { :end_inline_max } true;main_~ret2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem10#1;havoc main_#t~mem10#1;main_~i~1#1 := 0; 1276#L43-3 [2022-07-13 04:50:43,104 INFO L754 eck$LassoCheckResult]: Loop: 1276#L43-3 assume !!(main_~i~1#1 < ~N~0 - 1);call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~1#1), 4);call write~int(main_#t~mem12#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~mem12#1; 1275#L43-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1276#L43-3 [2022-07-13 04:50:43,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:50:43,104 INFO L85 PathProgramCache]: Analyzing trace with hash -2011161481, now seen corresponding path program 2 times [2022-07-13 04:50:43,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:50:43,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391187599] [2022-07-13 04:50:43,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:50:43,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:50:43,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:50:43,402 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 04:50:43,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:50:43,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391187599] [2022-07-13 04:50:43,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391187599] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 04:50:43,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229086531] [2022-07-13 04:50:43,403 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 04:50:43,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 04:50:43,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:50:43,404 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 04:50:43,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-07-13 04:50:43,465 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 04:50:43,466 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 04:50:43,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-13 04:50:43,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:50:43,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2022-07-13 04:50:43,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-13 04:50:43,635 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 04:50:43,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 04:50:43,747 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 04:50:43,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-07-13 04:50:43,783 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 04:50:43,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229086531] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 04:50:43,784 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 04:50:43,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 24 [2022-07-13 04:50:43,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531794193] [2022-07-13 04:50:43,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 04:50:43,784 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 04:50:43,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:50:43,785 INFO L85 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 3 times [2022-07-13 04:50:43,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:50:43,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135378603] [2022-07-13 04:50:43,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:50:43,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:50:43,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:50:43,789 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:50:43,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:50:43,791 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:50:43,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:50:43,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-13 04:50:43,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2022-07-13 04:50:43,832 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. cyclomatic complexity: 16 Second operand has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 24 states have internal predecessors, (52), 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 04:50:44,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:50:44,269 INFO L93 Difference]: Finished difference Result 105 states and 129 transitions. [2022-07-13 04:50:44,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-13 04:50:44,269 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 129 transitions. [2022-07-13 04:50:44,270 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 17 [2022-07-13 04:50:44,271 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 105 states and 129 transitions. [2022-07-13 04:50:44,271 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2022-07-13 04:50:44,271 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2022-07-13 04:50:44,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 129 transitions. [2022-07-13 04:50:44,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:50:44,272 INFO L369 hiAutomatonCegarLoop]: Abstraction has 105 states and 129 transitions. [2022-07-13 04:50:44,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 129 transitions. [2022-07-13 04:50:44,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 56. [2022-07-13 04:50:44,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.25) internal successors, (70), 55 states have internal predecessors, (70), 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 04:50:44,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2022-07-13 04:50:44,275 INFO L392 hiAutomatonCegarLoop]: Abstraction has 56 states and 70 transitions. [2022-07-13 04:50:44,275 INFO L374 stractBuchiCegarLoop]: Abstraction has 56 states and 70 transitions. [2022-07-13 04:50:44,275 INFO L287 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-13 04:50:44,275 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 70 transitions. [2022-07-13 04:50:44,276 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-07-13 04:50:44,276 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:50:44,276 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:50:44,276 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:50:44,276 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 04:50:44,277 INFO L752 eck$LassoCheckResult]: Stem: 1608#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int(109, 2, 0, 1);call write~init~int(97, 2, 1, 1);call write~init~int(120, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);~N~0 := 0; 1609#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~post11#1, main_~i~1#1, main_#t~ret13#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;~N~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 1621#L31 assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 1622#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1632#L23 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 1650#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1649#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1633#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1628#L23 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 1629#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1637#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1636#L22-3 assume !(max_~i~0#1 < ~N~0); 1623#L22-4 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 1616#L25 main_#t~ret6#1 := max_#res#1;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret6#1;havoc main_#t~ret6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem8#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem8#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 1617#L22-8 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1618#L23-3 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 1604#L23-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1605#L22-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1615#L22-8 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1619#L23-3 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 1631#L23-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1635#L22-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1634#L22-8 assume !(max_~i~0#1 < ~N~0); 1626#L22-9 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 1620#L25-1 main_#t~ret9#1 := max_#res#1;assume { :end_inline_max } true;main_~ret2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem10#1;havoc main_#t~mem10#1;main_~i~1#1 := 0; 1614#L43-3 [2022-07-13 04:50:44,277 INFO L754 eck$LassoCheckResult]: Loop: 1614#L43-3 assume !!(main_~i~1#1 < ~N~0 - 1);call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~1#1), 4);call write~int(main_#t~mem12#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~mem12#1; 1613#L43-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1614#L43-3 [2022-07-13 04:50:44,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:50:44,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1618134471, now seen corresponding path program 1 times [2022-07-13 04:50:44,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:50:44,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090493477] [2022-07-13 04:50:44,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:50:44,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:50:44,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:50:44,305 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:50:44,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:50:44,345 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:50:44,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:50:44,346 INFO L85 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 4 times [2022-07-13 04:50:44,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:50:44,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163193709] [2022-07-13 04:50:44,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:50:44,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:50:44,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:50:44,350 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:50:44,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:50:44,352 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:50:44,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:50:44,353 INFO L85 PathProgramCache]: Analyzing trace with hash -249063589, now seen corresponding path program 1 times [2022-07-13 04:50:44,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:50:44,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006522473] [2022-07-13 04:50:44,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:50:44,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:50:44,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:50:44,382 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:50:44,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:50:44,419 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:50:46,201 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:50:46,202 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:50:46,202 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:50:46,202 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:50:46,202 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 04:50:46,202 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:50:46,202 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:50:46,202 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:50:46,202 INFO L133 ssoRankerPreferences]: Filename of dumped script: max.i_Iteration9_Lasso [2022-07-13 04:50:46,202 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:50:46,202 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:50:46,207 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 04:50:46,211 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 04:50:48,585 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.IllegalArgumentException at de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) at java.base/java.util.AbstractMap.putAll(AbstractMap.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.PureSubstitution.(PureSubstitution.java:81) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.(Substitution.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.apply(Substitution.java:59) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:518) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:111) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:601) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:914) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:823) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:247) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:310) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:146) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:363) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-13 04:50:48,588 INFO L158 Benchmark]: Toolchain (without parser) took 15281.48ms. Allocated memory was 94.4MB in the beginning and 136.3MB in the end (delta: 41.9MB). Free memory was 62.1MB in the beginning and 88.2MB in the end (delta: -26.2MB). Peak memory consumption was 76.2MB. Max. memory is 16.1GB. [2022-07-13 04:50:48,589 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 94.4MB. Free memory is still 50.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 04:50:48,589 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.66ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 61.7MB in the beginning and 88.9MB in the end (delta: -27.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 04:50:48,589 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.81ms. Allocated memory is still 113.2MB. Free memory was 88.9MB in the beginning and 86.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 04:50:48,590 INFO L158 Benchmark]: Boogie Preprocessor took 24.34ms. Allocated memory is still 113.2MB. Free memory was 86.8MB in the beginning and 85.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 04:50:48,590 INFO L158 Benchmark]: RCFGBuilder took 370.89ms. Allocated memory is still 113.2MB. Free memory was 85.7MB in the beginning and 72.6MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-13 04:50:48,590 INFO L158 Benchmark]: BuchiAutomizer took 14633.37ms. Allocated memory was 113.2MB in the beginning and 136.3MB in the end (delta: 23.1MB). Free memory was 72.6MB in the beginning and 88.2MB in the end (delta: -15.6MB). Peak memory consumption was 68.8MB. Max. memory is 16.1GB. [2022-07-13 04:50:48,592 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.19ms. Allocated memory is still 94.4MB. Free memory is still 50.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 206.66ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 61.7MB in the beginning and 88.9MB in the end (delta: -27.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.81ms. Allocated memory is still 113.2MB. Free memory was 88.9MB in the beginning and 86.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.34ms. Allocated memory is still 113.2MB. Free memory was 86.8MB in the beginning and 85.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 370.89ms. Allocated memory is still 113.2MB. Free memory was 85.7MB in the beginning and 72.6MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 14633.37ms. Allocated memory was 113.2MB in the beginning and 136.3MB in the end (delta: 23.1MB). Free memory was 72.6MB in the beginning and 88.2MB in the end (delta: -15.6MB). Peak memory consumption was 68.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: IllegalArgumentException: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalArgumentException: null: de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-13 04:50:48,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-07-13 04:50:48,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-07-13 04:50:49,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-07-13 04:50:49,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-07-13 04:50:49,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: IllegalArgumentException: null