./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loops/invert_string-3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 839c364b 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/loops/invert_string-3.c -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 ca98535e808a51f7cfa7d21c9d33f259821212a6554e27f29c2bddd9197c0249 --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 23:25:23,200 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 23:25:23,230 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 23:25:23,249 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 23:25:23,249 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 23:25:23,250 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 23:25:23,251 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 23:25:23,252 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 23:25:23,253 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 23:25:23,254 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 23:25:23,254 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 23:25:23,255 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 23:25:23,255 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 23:25:23,256 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 23:25:23,257 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 23:25:23,258 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 23:25:23,259 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 23:25:23,259 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 23:25:23,261 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 23:25:23,263 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 23:25:23,264 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 23:25:23,269 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 23:25:23,270 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 23:25:23,270 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 23:25:23,272 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 23:25:23,278 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 23:25:23,279 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 23:25:23,279 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 23:25:23,280 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 23:25:23,280 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 23:25:23,281 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 23:25:23,281 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 23:25:23,282 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 23:25:23,282 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 23:25:23,286 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 23:25:23,287 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 23:25:23,287 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 23:25:23,287 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 23:25:23,287 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 23:25:23,288 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 23:25:23,289 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 23:25:23,290 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-14 23:25:23,309 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 23:25:23,312 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 23:25:23,313 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 23:25:23,313 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 23:25:23,315 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 23:25:23,315 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 23:25:23,315 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 23:25:23,315 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-14 23:25:23,315 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-14 23:25:23,316 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-14 23:25:23,316 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-14 23:25:23,316 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-14 23:25:23,317 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-14 23:25:23,317 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 23:25:23,317 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 23:25:23,317 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-14 23:25:23,317 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 23:25:23,317 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 23:25:23,317 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 23:25:23,318 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-14 23:25:23,318 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-14 23:25:23,318 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-14 23:25:23,318 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 23:25:23,318 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 23:25:23,318 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-14 23:25:23,319 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 23:25:23,319 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-14 23:25:23,319 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 23:25:23,319 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 23:25:23,319 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 23:25:23,319 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 23:25:23,320 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 23:25:23,321 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-14 23:25:23,321 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 -> ca98535e808a51f7cfa7d21c9d33f259821212a6554e27f29c2bddd9197c0249 [2021-12-14 23:25:23,482 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 23:25:23,504 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 23:25:23,506 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 23:25:23,506 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 23:25:23,507 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 23:25:23,508 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/invert_string-3.c [2021-12-14 23:25:23,563 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4701d73c3/da4b41514a95422e8ad20a556d8436d7/FLAG7775d746e [2021-12-14 23:25:23,890 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 23:25:23,891 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/invert_string-3.c [2021-12-14 23:25:23,896 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4701d73c3/da4b41514a95422e8ad20a556d8436d7/FLAG7775d746e [2021-12-14 23:25:24,319 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4701d73c3/da4b41514a95422e8ad20a556d8436d7 [2021-12-14 23:25:24,320 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 23:25:24,322 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 23:25:24,336 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 23:25:24,336 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 23:25:24,339 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 23:25:24,339 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:25:24" (1/1) ... [2021-12-14 23:25:24,340 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18c0d102 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:25:24, skipping insertion in model container [2021-12-14 23:25:24,340 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:25:24" (1/1) ... [2021-12-14 23:25:24,344 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 23:25:24,356 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 23:25:24,526 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/loops/invert_string-3.c[327,340] [2021-12-14 23:25:24,556 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 23:25:24,578 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 23:25:24,587 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/loops/invert_string-3.c[327,340] [2021-12-14 23:25:24,616 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 23:25:24,627 INFO L208 MainTranslator]: Completed translation [2021-12-14 23:25:24,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:25:24 WrapperNode [2021-12-14 23:25:24,628 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 23:25:24,629 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 23:25:24,629 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 23:25:24,630 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 23:25:24,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:25:24" (1/1) ... [2021-12-14 23:25:24,664 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:25:24" (1/1) ... [2021-12-14 23:25:24,683 INFO L137 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 68 [2021-12-14 23:25:24,683 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 23:25:24,684 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 23:25:24,684 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 23:25:24,684 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 23:25:24,689 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:25:24" (1/1) ... [2021-12-14 23:25:24,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:25:24" (1/1) ... [2021-12-14 23:25:24,692 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:25:24" (1/1) ... [2021-12-14 23:25:24,692 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:25:24" (1/1) ... [2021-12-14 23:25:24,695 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:25:24" (1/1) ... [2021-12-14 23:25:24,698 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:25:24" (1/1) ... [2021-12-14 23:25:24,699 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:25:24" (1/1) ... [2021-12-14 23:25:24,700 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 23:25:24,702 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 23:25:24,703 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 23:25:24,703 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 23:25:24,704 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:25:24" (1/1) ... [2021-12-14 23:25:24,709 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:24,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:24,732 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:24,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-14 23:25:24,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 23:25:24,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 23:25:24,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-14 23:25:24,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 23:25:24,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 23:25:24,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 23:25:24,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-14 23:25:24,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 23:25:24,811 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 23:25:24,812 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 23:25:24,943 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 23:25:24,949 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 23:25:24,949 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-14 23:25:24,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:25:24 BoogieIcfgContainer [2021-12-14 23:25:24,951 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 23:25:24,952 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-14 23:25:24,952 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-14 23:25:24,954 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-14 23:25:24,955 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-14 23:25:24,958 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.12 11:25:24" (1/3) ... [2021-12-14 23:25:24,960 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d685b48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.12 11:25:24, skipping insertion in model container [2021-12-14 23:25:24,960 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-14 23:25:24,960 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:25:24" (2/3) ... [2021-12-14 23:25:24,960 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d685b48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.12 11:25:24, skipping insertion in model container [2021-12-14 23:25:24,960 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-14 23:25:24,960 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:25:24" (3/3) ... [2021-12-14 23:25:24,961 INFO L388 chiAutomizerObserver]: Analyzing ICFG invert_string-3.c [2021-12-14 23:25:25,044 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-14 23:25:25,044 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-14 23:25:25,045 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-14 23:25:25,045 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-14 23:25:25,045 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-14 23:25:25,045 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-14 23:25:25,045 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-14 23:25:25,045 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-14 23:25:25,073 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:25:25,083 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2021-12-14 23:25:25,084 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:25:25,084 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:25:25,087 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-14 23:25:25,087 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-14 23:25:25,087 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-14 23:25:25,087 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:25:25,088 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2021-12-14 23:25:25,089 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:25:25,089 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:25:25,089 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-14 23:25:25,089 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-14 23:25:25,093 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post6#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~post9#1, main_~max~0#1, main_~#str1~0#1.base, main_~#str1~0#1.offset, main_~#str2~0#1.base, main_~#str2~0#1.offset, main_~i~0#1, main_~j~0#1;main_~max~0#1 := 5;call main_~#str1~0#1.base, main_~#str1~0#1.offset := #Ultimate.allocOnStack((if main_~max~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0#1 % 4294967296 % 4294967296 else main_~max~0#1 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0#1.base, main_~#str2~0#1.offset := #Ultimate.allocOnStack((if main_~max~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0#1 % 4294967296 % 4294967296 else main_~max~0#1 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0; 15#L18-3true [2021-12-14 23:25:25,093 INFO L793 eck$LassoCheckResult]: Loop: 15#L18-3true assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 10#L18-2true main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 15#L18-3true [2021-12-14 23:25:25,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:25:25,096 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-12-14 23:25:25,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:25:25,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106174980] [2021-12-14 23:25:25,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:25:25,115 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:25:25,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:25:25,228 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:25:25,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:25:25,269 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:25:25,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:25:25,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2021-12-14 23:25:25,272 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:25:25,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968740621] [2021-12-14 23:25:25,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:25:25,273 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:25:25,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:25:25,297 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:25:25,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:25:25,315 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:25:25,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:25:25,316 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2021-12-14 23:25:25,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:25:25,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819933474] [2021-12-14 23:25:25,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:25:25,317 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:25:25,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:25:25,352 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:25:25,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:25:25,392 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:25:25,757 INFO L210 LassoAnalysis]: Preferences: [2021-12-14 23:25:25,758 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-14 23:25:25,759 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-14 23:25:25,759 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-14 23:25:25,759 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-14 23:25:25,759 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:25,760 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-14 23:25:25,760 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-14 23:25:25,760 INFO L133 ssoRankerPreferences]: Filename of dumped script: invert_string-3.c_Iteration1_Lasso [2021-12-14 23:25:25,760 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-14 23:25:25,760 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-14 23:25:25,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:25,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:25,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:25,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:25,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:25,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:25,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:25,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:25,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:25,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:25,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:25,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:25,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:25,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:26,210 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-14 23:25:26,214 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-14 23:25:26,215 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:26,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:26,217 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:26,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-12-14 23:25:26,222 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:26,229 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:26,229 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:25:26,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:26,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:26,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:26,231 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:25:26,232 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:25:26,247 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:26,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2021-12-14 23:25:26,264 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:26,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:26,265 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:26,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-12-14 23:25:26,267 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:26,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:26,274 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:25:26,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:26,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:26,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:26,275 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:25:26,275 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:25:26,291 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:26,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-12-14 23:25:26,309 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:26,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:26,310 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:26,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-12-14 23:25:26,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 [2021-12-14 23:25:26,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:26,320 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:25:26,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:26,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:26,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:26,321 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:25:26,321 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:25:26,332 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:26,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-12-14 23:25:26,361 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:26,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:26,362 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:26,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-12-14 23:25:26,365 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:26,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:26,385 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:25:26,385 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:26,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:26,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:26,386 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:25:26,386 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:25:26,399 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:26,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-12-14 23:25:26,416 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:26,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:26,417 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:26,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-12-14 23:25:26,434 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:26,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:26,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:26,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:26,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:26,444 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:26,444 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:26,456 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:26,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-12-14 23:25:26,487 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:26,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:26,488 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:26,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-12-14 23:25:26,490 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:26,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:26,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:26,497 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:26,497 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:26,499 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:26,499 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:26,514 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:26,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-12-14 23:25:26,532 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:26,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:26,540 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:26,544 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:26,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:26,550 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:25:26,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:26,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:26,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:26,551 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:25:26,551 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:25:26,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-12-14 23:25:26,571 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:26,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-12-14 23:25:26,590 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:26,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:26,591 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:26,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-12-14 23:25:26,593 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:26,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:26,599 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:25:26,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:26,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:26,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:26,600 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:25:26,600 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:25:26,601 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:26,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2021-12-14 23:25:26,617 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:26,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:26,618 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:26,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-12-14 23:25:26,620 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:26,626 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:26,626 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:25:26,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:26,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:26,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:26,627 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:25:26,627 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:25:26,628 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:26,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-12-14 23:25:26,644 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:26,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:26,645 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:26,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-12-14 23:25:26,648 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:26,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:26,654 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:26,654 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:26,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:26,656 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:26,656 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:26,662 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:26,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-12-14 23:25:26,678 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:26,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:26,681 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:26,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-12-14 23:25:26,683 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:26,689 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:26,690 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:26,690 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:26,690 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:26,692 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:26,692 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:26,700 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:26,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-12-14 23:25:26,716 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:26,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:26,717 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:26,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-12-14 23:25:26,719 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:26,725 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:26,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:26,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:26,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:26,731 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:26,732 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:26,759 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-14 23:25:26,782 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2021-12-14 23:25:26,782 INFO L444 ModelExtractionUtils]: 9 out of 19 variables were initially zero. Simplification set additionally 6 variables to zero. [2021-12-14 23:25:26,783 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:26,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:26,785 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) [2021-12-14 23:25:26,786 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 [2021-12-14 23:25:26,786 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-14 23:25:26,793 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-14 23:25:26,793 INFO L513 LassoAnalysis]: Proved termination. [2021-12-14 23:25:26,794 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~#str1~0#1.offset, v_rep(select #length ULTIMATE.start_main_~#str1~0#1.base)_1) = -1*ULTIMATE.start_main_~i~0#1 - 1*ULTIMATE.start_main_~#str1~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_~#str1~0#1.base)_1 Supporting invariants [] [2021-12-14 23:25:26,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-12-14 23:25:26,828 INFO L297 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2021-12-14 23:25:26,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:25:26,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:25:26,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 23:25:26,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:25:26,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:25:26,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 23:25:26,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:25:26,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:25:26,907 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-12-14 23:25:26,908 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:25:26,952 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 33 states and 47 transitions. Complement of second has 8 states. [2021-12-14 23:25:26,954 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 [2021-12-14 23:25:26,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:25:26,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2021-12-14 23:25:26,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 2 letters. Loop has 2 letters. [2021-12-14 23:25:26,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:25:26,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 4 letters. Loop has 2 letters. [2021-12-14 23:25:26,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:25:26,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 2 letters. Loop has 4 letters. [2021-12-14 23:25:26,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:25:26,960 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 47 transitions. [2021-12-14 23:25:26,962 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2021-12-14 23:25:26,964 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 14 states and 19 transitions. [2021-12-14 23:25:26,965 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2021-12-14 23:25:26,965 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2021-12-14 23:25:26,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2021-12-14 23:25:26,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:25:26,966 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2021-12-14 23:25:26,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2021-12-14 23:25:26,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-12-14 23:25:26,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:25:26,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2021-12-14 23:25:26,989 INFO L704 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2021-12-14 23:25:26,989 INFO L587 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2021-12-14 23:25:26,989 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-14 23:25:26,989 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2021-12-14 23:25:26,990 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2021-12-14 23:25:26,990 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:25:26,990 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:25:26,990 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-14 23:25:26,990 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-14 23:25:26,991 INFO L791 eck$LassoCheckResult]: Stem: 130#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(18, 2);call #Ultimate.allocInit(12, 3); 131#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post6#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~post9#1, main_~max~0#1, main_~#str1~0#1.base, main_~#str1~0#1.offset, main_~#str2~0#1.base, main_~#str2~0#1.offset, main_~i~0#1, main_~j~0#1;main_~max~0#1 := 5;call main_~#str1~0#1.base, main_~#str1~0#1.offset := #Ultimate.allocOnStack((if main_~max~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0#1 % 4294967296 % 4294967296 else main_~max~0#1 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0#1.base, main_~#str2~0#1.offset := #Ultimate.allocOnStack((if main_~max~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0#1 % 4294967296 % 4294967296 else main_~max~0#1 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0; 134#L18-3 assume !(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296); 143#L18-4 call write~int(0, main_~#str1~0#1.base, main_~#str1~0#1.offset + (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0#1 := 0;main_~i~0#1 := (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296); 142#L26-3 [2021-12-14 23:25:26,991 INFO L793 eck$LassoCheckResult]: Loop: 142#L26-3 assume !!(main_~i~0#1 >= 0);call main_#t~mem7#1 := read~int(main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);call write~int(main_#t~mem7#1, main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);havoc main_#t~mem7#1;main_#t~post8#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 141#L26-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := main_#t~post6#1 - 1;havoc main_#t~post6#1; 142#L26-3 [2021-12-14 23:25:26,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:25:26,991 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2021-12-14 23:25:26,991 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:25:26,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529306033] [2021-12-14 23:25:26,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:25:26,992 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:25:27,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:25:27,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:25:27,059 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:25:27,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529306033] [2021-12-14 23:25:27,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529306033] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:25:27,060 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:25:27,060 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 23:25:27,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211528032] [2021-12-14 23:25:27,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:25:27,062 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:25:27,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:25:27,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 1 times [2021-12-14 23:25:27,063 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:25:27,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324080647] [2021-12-14 23:25:27,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:25:27,063 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:25:27,073 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 [2021-12-14 23:25:27,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:25:27,089 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:25:27,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:25:27,093 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:25:27,161 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:25:27,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 23:25:27,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 23:25:27,165 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 8 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:25:27,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:25:27,196 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2021-12-14 23:25:27,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 23:25:27,197 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2021-12-14 23:25:27,198 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-12-14 23:25:27,198 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 14 states and 16 transitions. [2021-12-14 23:25:27,198 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2021-12-14 23:25:27,198 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-12-14 23:25:27,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2021-12-14 23:25:27,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:25:27,199 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2021-12-14 23:25:27,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2021-12-14 23:25:27,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2021-12-14 23:25:27,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:25:27,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2021-12-14 23:25:27,200 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2021-12-14 23:25:27,200 INFO L587 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2021-12-14 23:25:27,200 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-14 23:25:27,200 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2021-12-14 23:25:27,201 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-12-14 23:25:27,201 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:25:27,201 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:25:27,201 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-14 23:25:27,201 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-14 23:25:27,201 INFO L791 eck$LassoCheckResult]: Stem: 168#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(18, 2);call #Ultimate.allocInit(12, 3); 169#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post6#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~post9#1, main_~max~0#1, main_~#str1~0#1.base, main_~#str1~0#1.offset, main_~#str2~0#1.base, main_~#str2~0#1.offset, main_~i~0#1, main_~j~0#1;main_~max~0#1 := 5;call main_~#str1~0#1.base, main_~#str1~0#1.offset := #Ultimate.allocOnStack((if main_~max~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0#1 % 4294967296 % 4294967296 else main_~max~0#1 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0#1.base, main_~#str2~0#1.offset := #Ultimate.allocOnStack((if main_~max~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0#1 % 4294967296 % 4294967296 else main_~max~0#1 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0; 176#L18-3 assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 171#L18-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 172#L18-3 assume !(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296); 177#L18-4 call write~int(0, main_~#str1~0#1.base, main_~#str1~0#1.offset + (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0#1 := 0;main_~i~0#1 := (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296); 175#L26-3 [2021-12-14 23:25:27,201 INFO L793 eck$LassoCheckResult]: Loop: 175#L26-3 assume !!(main_~i~0#1 >= 0);call main_#t~mem7#1 := read~int(main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);call write~int(main_#t~mem7#1, main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);havoc main_#t~mem7#1;main_#t~post8#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 174#L26-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := main_#t~post6#1 - 1;havoc main_#t~post6#1; 175#L26-3 [2021-12-14 23:25:27,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:25:27,202 INFO L85 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2021-12-14 23:25:27,202 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:25:27,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987275309] [2021-12-14 23:25:27,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:25:27,203 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:25:27,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:25:27,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:25:27,303 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:25:27,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987275309] [2021-12-14 23:25:27,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987275309] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 23:25:27,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704047917] [2021-12-14 23:25:27,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:25:27,304 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:25:27,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:27,305 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:25:27,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-14 23:25:27,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:25:27,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-14 23:25:27,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:25:27,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 23:25:27,402 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-12-14 23:25:27,406 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2021-12-14 23:25:27,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:25:27,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 23:25:27,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:25:27,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704047917] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 23:25:27,630 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 23:25:27,630 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2021-12-14 23:25:27,630 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054381107] [2021-12-14 23:25:27,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 23:25:27,630 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:25:27,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:25:27,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 2 times [2021-12-14 23:25:27,630 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:25:27,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935253906] [2021-12-14 23:25:27,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:25:27,631 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:25:27,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:25:27,634 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:25:27,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:25:27,637 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:25:27,696 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:25:27,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 23:25:27,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-12-14 23:25:27,697 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. cyclomatic complexity: 5 Second operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:25:27,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:25:27,787 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2021-12-14 23:25:27,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 23:25:27,788 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 23 transitions. [2021-12-14 23:25:27,788 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-12-14 23:25:27,788 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 19 states and 21 transitions. [2021-12-14 23:25:27,788 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2021-12-14 23:25:27,789 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-12-14 23:25:27,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 21 transitions. [2021-12-14 23:25:27,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:25:27,789 INFO L681 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2021-12-14 23:25:27,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 21 transitions. [2021-12-14 23:25:27,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2021-12-14 23:25:27,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:25:27,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2021-12-14 23:25:27,790 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2021-12-14 23:25:27,790 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2021-12-14 23:25:27,790 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-14 23:25:27,790 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 21 transitions. [2021-12-14 23:25:27,790 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-12-14 23:25:27,790 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:25:27,790 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:25:27,791 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2021-12-14 23:25:27,791 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-14 23:25:27,791 INFO L791 eck$LassoCheckResult]: Stem: 245#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(18, 2);call #Ultimate.allocInit(12, 3); 246#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post6#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~post9#1, main_~max~0#1, main_~#str1~0#1.base, main_~#str1~0#1.offset, main_~#str2~0#1.base, main_~#str2~0#1.offset, main_~i~0#1, main_~j~0#1;main_~max~0#1 := 5;call main_~#str1~0#1.base, main_~#str1~0#1.offset := #Ultimate.allocOnStack((if main_~max~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0#1 % 4294967296 % 4294967296 else main_~max~0#1 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0#1.base, main_~#str2~0#1.offset := #Ultimate.allocOnStack((if main_~max~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0#1 % 4294967296 % 4294967296 else main_~max~0#1 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0; 253#L18-3 assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 247#L18-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 248#L18-3 assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 254#L18-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 260#L18-3 assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 259#L18-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 258#L18-3 assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 257#L18-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 256#L18-3 assume !(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296); 255#L18-4 call write~int(0, main_~#str1~0#1.base, main_~#str1~0#1.offset + (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0#1 := 0;main_~i~0#1 := (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296); 252#L26-3 [2021-12-14 23:25:27,791 INFO L793 eck$LassoCheckResult]: Loop: 252#L26-3 assume !!(main_~i~0#1 >= 0);call main_#t~mem7#1 := read~int(main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);call write~int(main_#t~mem7#1, main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);havoc main_#t~mem7#1;main_#t~post8#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 251#L26-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := main_#t~post6#1 - 1;havoc main_#t~post6#1; 252#L26-3 [2021-12-14 23:25:27,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:25:27,791 INFO L85 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 2 times [2021-12-14 23:25:27,791 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:25:27,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046613945] [2021-12-14 23:25:27,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:25:27,792 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:25:27,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:25:27,874 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:25:27,874 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:25:27,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046613945] [2021-12-14 23:25:27,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046613945] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 23:25:27,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15254143] [2021-12-14 23:25:27,875 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 23:25:27,875 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:25:27,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:27,876 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:25:27,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-14 23:25:27,942 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 23:25:27,943 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 23:25:27,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-14 23:25:27,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:25:27,972 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 23:25:27,978 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 23:25:27,978 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2021-12-14 23:25:28,094 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 [2021-12-14 23:25:28,116 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:25:28,117 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 23:25:28,228 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:25:28,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15254143] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 23:25:28,229 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 23:25:28,229 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 19 [2021-12-14 23:25:28,229 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378515956] [2021-12-14 23:25:28,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 23:25:28,229 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:25:28,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:25:28,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 3 times [2021-12-14 23:25:28,230 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:25:28,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093172380] [2021-12-14 23:25:28,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:25:28,230 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:25:28,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:25:28,234 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:25:28,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:25:28,237 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:25:28,286 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:25:28,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-14 23:25:28,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2021-12-14 23:25:28,287 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. cyclomatic complexity: 5 Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:25:28,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:25:28,812 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2021-12-14 23:25:28,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-14 23:25:28,813 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 35 transitions. [2021-12-14 23:25:28,813 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-12-14 23:25:28,814 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 35 transitions. [2021-12-14 23:25:28,814 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2021-12-14 23:25:28,814 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2021-12-14 23:25:28,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 35 transitions. [2021-12-14 23:25:28,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:25:28,814 INFO L681 BuchiCegarLoop]: Abstraction has 32 states and 35 transitions. [2021-12-14 23:25:28,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 35 transitions. [2021-12-14 23:25:28,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2021-12-14 23:25:28,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 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) [2021-12-14 23:25:28,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2021-12-14 23:25:28,816 INFO L704 BuchiCegarLoop]: Abstraction has 31 states and 34 transitions. [2021-12-14 23:25:28,816 INFO L587 BuchiCegarLoop]: Abstraction has 31 states and 34 transitions. [2021-12-14 23:25:28,816 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-14 23:25:28,816 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 34 transitions. [2021-12-14 23:25:28,817 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-12-14 23:25:28,817 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:25:28,817 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:25:28,817 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2021-12-14 23:25:28,817 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-14 23:25:28,817 INFO L791 eck$LassoCheckResult]: Stem: 402#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(18, 2);call #Ultimate.allocInit(12, 3); 403#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post6#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~post9#1, main_~max~0#1, main_~#str1~0#1.base, main_~#str1~0#1.offset, main_~#str2~0#1.base, main_~#str2~0#1.offset, main_~i~0#1, main_~j~0#1;main_~max~0#1 := 5;call main_~#str1~0#1.base, main_~#str1~0#1.offset := #Ultimate.allocOnStack((if main_~max~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0#1 % 4294967296 % 4294967296 else main_~max~0#1 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0#1.base, main_~#str2~0#1.offset := #Ultimate.allocOnStack((if main_~max~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0#1 % 4294967296 % 4294967296 else main_~max~0#1 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0; 410#L18-3 assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 404#L18-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 405#L18-3 assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 411#L18-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 427#L18-3 assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 425#L18-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 423#L18-3 assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 421#L18-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 417#L18-3 assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 418#L18-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 413#L18-3 assume !(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296); 412#L18-4 call write~int(0, main_~#str1~0#1.base, main_~#str1~0#1.offset + (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0#1 := 0;main_~i~0#1 := (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296); 409#L26-3 [2021-12-14 23:25:28,817 INFO L793 eck$LassoCheckResult]: Loop: 409#L26-3 assume !!(main_~i~0#1 >= 0);call main_#t~mem7#1 := read~int(main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);call write~int(main_#t~mem7#1, main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);havoc main_#t~mem7#1;main_#t~post8#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 408#L26-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := main_#t~post6#1 - 1;havoc main_#t~post6#1; 409#L26-3 [2021-12-14 23:25:28,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:25:28,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 3 times [2021-12-14 23:25:28,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:25:28,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465362080] [2021-12-14 23:25:28,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:25:28,818 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:25:28,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:25:28,832 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:25:28,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:25:28,864 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:25:28,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:25:28,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 4 times [2021-12-14 23:25:28,864 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:25:28,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710305637] [2021-12-14 23:25:28,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:25:28,864 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:25:28,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:25:28,871 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:25:28,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:25:28,873 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:25:28,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:25:28,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1715425495, now seen corresponding path program 1 times [2021-12-14 23:25:28,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:25:28,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314741250] [2021-12-14 23:25:28,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:25:28,874 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:25:28,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:25:28,887 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:25:28,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:25:28,901 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:25:30,777 INFO L210 LassoAnalysis]: Preferences: [2021-12-14 23:25:30,777 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-14 23:25:30,777 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-14 23:25:30,777 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-14 23:25:30,777 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-14 23:25:30,777 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:30,777 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-14 23:25:30,777 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-14 23:25:30,777 INFO L133 ssoRankerPreferences]: Filename of dumped script: invert_string-3.c_Iteration5_Lasso [2021-12-14 23:25:30,777 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-14 23:25:30,777 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-14 23:25:30,777 WARN L322 ript$VariableManager]: TermVariabe |aux_div_v_ULTIMATE.start_main_~i~0#1_59_50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 23:25:30,777 WARN L322 ript$VariableManager]: TermVariabe |aux_mod_v_ULTIMATE.start_main_~i~0#1_59_50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 23:25:30,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:30,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:31,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:31,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:31,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:31,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:31,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:31,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:31,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:31,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:31,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:31,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:31,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:31,488 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-14 23:25:31,488 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-14 23:25:31,488 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:31,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:31,528 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) [2021-12-14 23:25:31,529 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 [2021-12-14 23:25:31,530 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:31,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:31,535 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:25:31,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:31,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:31,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:31,536 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:25:31,536 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:25:31,537 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:31,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2021-12-14 23:25:31,554 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:31,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:31,556 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) [2021-12-14 23:25:31,556 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 [2021-12-14 23:25:31,557 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:31,563 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:31,563 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:31,563 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:31,563 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:31,565 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:31,565 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:31,580 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:31,620 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 [2021-12-14 23:25:31,620 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:31,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:31,621 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) [2021-12-14 23:25:31,622 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 [2021-12-14 23:25:31,623 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:31,628 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:31,628 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:31,628 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:31,628 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:31,630 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:31,630 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:31,647 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:31,699 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 [2021-12-14 23:25:31,699 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:31,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:31,701 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) [2021-12-14 23:25:31,706 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:31,711 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 [2021-12-14 23:25:31,712 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:31,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:31,712 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:31,712 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:31,714 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:31,714 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:31,729 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:31,760 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 [2021-12-14 23:25:31,760 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:31,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:31,761 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) [2021-12-14 23:25:31,762 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 [2021-12-14 23:25:31,763 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:31,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:31,769 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:31,769 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:31,769 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:31,770 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:31,770 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:31,773 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:31,800 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 [2021-12-14 23:25:31,800 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:31,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:31,801 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) [2021-12-14 23:25:31,802 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 [2021-12-14 23:25:31,803 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:31,808 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:31,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:31,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:31,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:31,809 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:31,809 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:31,833 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:31,848 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 [2021-12-14 23:25:31,848 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:31,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:31,849 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) [2021-12-14 23:25:31,851 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:31,853 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 [2021-12-14 23:25:31,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:31,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:31,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:31,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:31,858 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:31,858 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:31,860 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:31,875 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 [2021-12-14 23:25:31,875 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:31,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:31,876 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) [2021-12-14 23:25:31,877 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 [2021-12-14 23:25:31,878 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:31,884 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:31,884 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:31,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:31,884 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:31,885 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:31,885 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:31,887 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:31,902 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 [2021-12-14 23:25:31,902 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:31,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:31,903 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) [2021-12-14 23:25:31,913 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 [2021-12-14 23:25:31,914 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:31,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:31,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:31,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:31,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:31,935 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:31,935 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:31,938 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:31,955 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 [2021-12-14 23:25:31,955 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:31,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:31,956 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) [2021-12-14 23:25:31,956 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 [2021-12-14 23:25:31,958 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:31,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:31,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:31,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:31,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:31,964 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:31,964 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:31,967 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:31,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2021-12-14 23:25:31,982 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:31,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:31,983 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) [2021-12-14 23:25:31,984 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 [2021-12-14 23:25:31,985 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:31,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:31,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:31,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:31,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:31,991 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:31,991 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:32,007 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:32,024 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 [2021-12-14 23:25:32,024 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:32,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:32,025 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) [2021-12-14 23:25:32,026 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 [2021-12-14 23:25:32,027 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:32,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:32,032 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:25:32,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:32,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:32,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:32,033 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:25:32,033 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:25:32,039 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:32,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2021-12-14 23:25:32,053 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:32,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:32,054 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) [2021-12-14 23:25:32,055 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 [2021-12-14 23:25:32,056 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:32,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:32,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:32,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:32,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:32,062 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:32,063 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:32,064 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:32,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2021-12-14 23:25:32,081 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:32,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:32,082 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) [2021-12-14 23:25:32,083 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 [2021-12-14 23:25:32,084 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:32,090 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:32,090 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:32,090 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:32,090 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:32,091 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:32,091 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:32,093 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:32,108 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 [2021-12-14 23:25:32,108 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:32,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:32,109 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) [2021-12-14 23:25:32,110 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 [2021-12-14 23:25:32,111 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:32,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:32,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:32,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:32,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:32,118 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:32,118 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:32,120 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:32,135 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 [2021-12-14 23:25:32,136 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:32,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:32,136 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) [2021-12-14 23:25:32,137 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 [2021-12-14 23:25:32,138 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:32,144 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:32,144 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:32,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:32,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:32,150 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:32,150 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:32,160 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-14 23:25:32,198 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2021-12-14 23:25:32,198 INFO L444 ModelExtractionUtils]: 10 out of 25 variables were initially zero. Simplification set additionally 12 variables to zero. [2021-12-14 23:25:32,198 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:32,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:32,199 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) [2021-12-14 23:25:32,200 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-14 23:25:32,208 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 [2021-12-14 23:25:32,217 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-14 23:25:32,217 INFO L513 LassoAnalysis]: Proved termination. [2021-12-14 23:25:32,217 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 2*ULTIMATE.start_main_~i~0#1 + 1 Supporting invariants [] [2021-12-14 23:25:32,235 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 [2021-12-14 23:25:32,254 INFO L297 tatePredicateManager]: 12 out of 12 supporting invariants were superfluous and have been removed [2021-12-14 23:25:32,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:25:32,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:25:32,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 23:25:32,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:25:32,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:25:32,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 23:25:32,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:25:32,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:25:32,320 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-12-14 23:25:32,320 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 34 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:25:32,331 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 34 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 34 states and 40 transitions. Complement of second has 7 states. [2021-12-14 23:25:32,331 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 [2021-12-14 23:25:32,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:25:32,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2021-12-14 23:25:32,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 14 letters. Loop has 2 letters. [2021-12-14 23:25:32,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:25:32,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 16 letters. Loop has 2 letters. [2021-12-14 23:25:32,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:25:32,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 14 letters. Loop has 4 letters. [2021-12-14 23:25:32,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:25:32,335 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 40 transitions. [2021-12-14 23:25:32,339 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-14 23:25:32,339 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 32 states and 36 transitions. [2021-12-14 23:25:32,339 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-12-14 23:25:32,339 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-12-14 23:25:32,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 36 transitions. [2021-12-14 23:25:32,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:25:32,355 INFO L681 BuchiCegarLoop]: Abstraction has 32 states and 36 transitions. [2021-12-14 23:25:32,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 36 transitions. [2021-12-14 23:25:32,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2021-12-14 23:25:32,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.125) internal successors, (36), 31 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:25:32,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2021-12-14 23:25:32,361 INFO L704 BuchiCegarLoop]: Abstraction has 32 states and 36 transitions. [2021-12-14 23:25:32,361 INFO L587 BuchiCegarLoop]: Abstraction has 32 states and 36 transitions. [2021-12-14 23:25:32,361 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-14 23:25:32,361 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 36 transitions. [2021-12-14 23:25:32,363 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-14 23:25:32,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:25:32,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:25:32,364 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1] [2021-12-14 23:25:32,364 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-14 23:25:32,364 INFO L791 eck$LassoCheckResult]: Stem: 587#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(18, 2);call #Ultimate.allocInit(12, 3); 588#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post6#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~post9#1, main_~max~0#1, main_~#str1~0#1.base, main_~#str1~0#1.offset, main_~#str2~0#1.base, main_~#str2~0#1.offset, main_~i~0#1, main_~j~0#1;main_~max~0#1 := 5;call main_~#str1~0#1.base, main_~#str1~0#1.offset := #Ultimate.allocOnStack((if main_~max~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0#1 % 4294967296 % 4294967296 else main_~max~0#1 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0#1.base, main_~#str2~0#1.offset := #Ultimate.allocOnStack((if main_~max~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0#1 % 4294967296 % 4294967296 else main_~max~0#1 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0; 595#L18-3 assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 589#L18-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 590#L18-3 assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 596#L18-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 613#L18-3 assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 611#L18-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 609#L18-3 assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 607#L18-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 603#L18-3 assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 604#L18-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 599#L18-3 assume !(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296); 597#L18-4 call write~int(0, main_~#str1~0#1.base, main_~#str1~0#1.offset + (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0#1 := 0;main_~i~0#1 := (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296); 598#L26-3 assume !(main_~i~0#1 >= 0); 592#L26-4 main_~j~0#1 := (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296);main_~i~0#1 := 0; 585#L32-3 [2021-12-14 23:25:32,369 INFO L793 eck$LassoCheckResult]: Loop: 585#L32-3 assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call main_#t~mem10#1 := read~int(main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);call main_#t~mem11#1 := read~int(main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem10#1 == main_#t~mem11#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 591#L6 assume !(0 == __VERIFIER_assert_~cond#1); 586#L6-2 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem10#1;havoc main_#t~mem11#1;main_#t~post12#1 := main_~j~0#1;main_~j~0#1 := main_#t~post12#1 - 1;havoc main_#t~post12#1; 584#L32-2 main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 585#L32-3 [2021-12-14 23:25:32,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:25:32,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1715425437, now seen corresponding path program 1 times [2021-12-14 23:25:32,369 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:25:32,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100890904] [2021-12-14 23:25:32,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:25:32,370 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:25:32,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:25:32,436 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-14 23:25:32,436 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:25:32,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100890904] [2021-12-14 23:25:32,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100890904] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 23:25:32,437 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 23:25:32,437 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 23:25:32,437 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65199900] [2021-12-14 23:25:32,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 23:25:32,437 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:25:32,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:25:32,438 INFO L85 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 1 times [2021-12-14 23:25:32,438 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:25:32,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946865161] [2021-12-14 23:25:32,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:25:32,438 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:25:32,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:25:32,444 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:25:32,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:25:32,455 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:25:32,528 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:25:32,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 23:25:32,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 23:25:32,529 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:25:32,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:25:32,547 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2021-12-14 23:25:32,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 23:25:32,549 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 36 transitions. [2021-12-14 23:25:32,550 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-14 23:25:32,551 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 36 transitions. [2021-12-14 23:25:32,551 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-12-14 23:25:32,552 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-12-14 23:25:32,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 36 transitions. [2021-12-14 23:25:32,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:25:32,552 INFO L681 BuchiCegarLoop]: Abstraction has 33 states and 36 transitions. [2021-12-14 23:25:32,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 36 transitions. [2021-12-14 23:25:32,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2021-12-14 23:25:32,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:25:32,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2021-12-14 23:25:32,555 INFO L704 BuchiCegarLoop]: Abstraction has 32 states and 35 transitions. [2021-12-14 23:25:32,556 INFO L587 BuchiCegarLoop]: Abstraction has 32 states and 35 transitions. [2021-12-14 23:25:32,556 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-14 23:25:32,556 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 35 transitions. [2021-12-14 23:25:32,556 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-14 23:25:32,556 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:25:32,556 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:25:32,557 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 23:25:32,557 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-14 23:25:32,557 INFO L791 eck$LassoCheckResult]: Stem: 661#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(18, 2);call #Ultimate.allocInit(12, 3); 662#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post6#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~post9#1, main_~max~0#1, main_~#str1~0#1.base, main_~#str1~0#1.offset, main_~#str2~0#1.base, main_~#str2~0#1.offset, main_~i~0#1, main_~j~0#1;main_~max~0#1 := 5;call main_~#str1~0#1.base, main_~#str1~0#1.offset := #Ultimate.allocOnStack((if main_~max~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0#1 % 4294967296 % 4294967296 else main_~max~0#1 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0#1.base, main_~#str2~0#1.offset := #Ultimate.allocOnStack((if main_~max~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0#1 % 4294967296 % 4294967296 else main_~max~0#1 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0; 669#L18-3 assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 663#L18-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 664#L18-3 assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 670#L18-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 687#L18-3 assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 685#L18-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 683#L18-3 assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 681#L18-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 677#L18-3 assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 678#L18-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 673#L18-3 assume !(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296); 671#L18-4 call write~int(0, main_~#str1~0#1.base, main_~#str1~0#1.offset + (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0#1 := 0;main_~i~0#1 := (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296); 672#L26-3 assume !!(main_~i~0#1 >= 0);call main_#t~mem7#1 := read~int(main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);call write~int(main_#t~mem7#1, main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);havoc main_#t~mem7#1;main_#t~post8#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 666#L26-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := main_#t~post6#1 - 1;havoc main_#t~post6#1; 667#L26-3 assume !(main_~i~0#1 >= 0); 668#L26-4 main_~j~0#1 := (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296);main_~i~0#1 := 0; 659#L32-3 [2021-12-14 23:25:32,557 INFO L793 eck$LassoCheckResult]: Loop: 659#L32-3 assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call main_#t~mem10#1 := read~int(main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);call main_#t~mem11#1 := read~int(main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem10#1 == main_#t~mem11#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 665#L6 assume !(0 == __VERIFIER_assert_~cond#1); 660#L6-2 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem10#1;havoc main_#t~mem11#1;main_#t~post12#1 := main_~j~0#1;main_~j~0#1 := main_#t~post12#1 - 1;havoc main_#t~post12#1; 658#L32-2 main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 659#L32-3 [2021-12-14 23:25:32,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:25:32,557 INFO L85 PathProgramCache]: Analyzing trace with hash -743540257, now seen corresponding path program 1 times [2021-12-14 23:25:32,557 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:25:32,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019212636] [2021-12-14 23:25:32,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:25:32,558 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:25:32,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:25:32,637 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-14 23:25:32,637 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:25:32,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019212636] [2021-12-14 23:25:32,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019212636] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 23:25:32,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258781782] [2021-12-14 23:25:32,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:25:32,638 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:25:32,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:32,639 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:25:32,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2021-12-14 23:25:32,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:25:32,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-14 23:25:32,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:25:32,782 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-14 23:25:32,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 23:25:32,870 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 [2021-12-14 23:25:33,001 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-14 23:25:33,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258781782] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 23:25:33,001 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 23:25:33,001 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2021-12-14 23:25:33,001 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108551668] [2021-12-14 23:25:33,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 23:25:33,002 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:25:33,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:25:33,002 INFO L85 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 2 times [2021-12-14 23:25:33,002 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:25:33,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417728944] [2021-12-14 23:25:33,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:25:33,003 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:25:33,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:25:33,006 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:25:33,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:25:33,013 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:25:33,080 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:25:33,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 23:25:33,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-12-14 23:25:33,081 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. cyclomatic complexity: 6 Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:25:33,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:25:33,165 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2021-12-14 23:25:33,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 23:25:33,166 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 45 transitions. [2021-12-14 23:25:33,166 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-14 23:25:33,167 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 45 transitions. [2021-12-14 23:25:33,167 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-12-14 23:25:33,167 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-12-14 23:25:33,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 45 transitions. [2021-12-14 23:25:33,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:25:33,167 INFO L681 BuchiCegarLoop]: Abstraction has 42 states and 45 transitions. [2021-12-14 23:25:33,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 45 transitions. [2021-12-14 23:25:33,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2021-12-14 23:25:33,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:25:33,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2021-12-14 23:25:33,169 INFO L704 BuchiCegarLoop]: Abstraction has 38 states and 41 transitions. [2021-12-14 23:25:33,169 INFO L587 BuchiCegarLoop]: Abstraction has 38 states and 41 transitions. [2021-12-14 23:25:33,169 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-14 23:25:33,169 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 41 transitions. [2021-12-14 23:25:33,169 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-14 23:25:33,169 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:25:33,169 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:25:33,169 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2021-12-14 23:25:33,169 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-14 23:25:33,170 INFO L791 eck$LassoCheckResult]: Stem: 861#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(18, 2);call #Ultimate.allocInit(12, 3); 862#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post6#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~post9#1, main_~max~0#1, main_~#str1~0#1.base, main_~#str1~0#1.offset, main_~#str2~0#1.base, main_~#str2~0#1.offset, main_~i~0#1, main_~j~0#1;main_~max~0#1 := 5;call main_~#str1~0#1.base, main_~#str1~0#1.offset := #Ultimate.allocOnStack((if main_~max~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0#1 % 4294967296 % 4294967296 else main_~max~0#1 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0#1.base, main_~#str2~0#1.offset := #Ultimate.allocOnStack((if main_~max~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0#1 % 4294967296 % 4294967296 else main_~max~0#1 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0; 869#L18-3 assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 863#L18-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 864#L18-3 assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 870#L18-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 893#L18-3 assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 891#L18-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 889#L18-3 assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 887#L18-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 883#L18-3 assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 884#L18-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 874#L18-3 assume !(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296); 871#L18-4 call write~int(0, main_~#str1~0#1.base, main_~#str1~0#1.offset + (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0#1 := 0;main_~i~0#1 := (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296); 872#L26-3 assume !!(main_~i~0#1 >= 0);call main_#t~mem7#1 := read~int(main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);call write~int(main_#t~mem7#1, main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);havoc main_#t~mem7#1;main_#t~post8#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 866#L26-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := main_#t~post6#1 - 1;havoc main_#t~post6#1; 867#L26-3 assume !!(main_~i~0#1 >= 0);call main_#t~mem7#1 := read~int(main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);call write~int(main_#t~mem7#1, main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);havoc main_#t~mem7#1;main_#t~post8#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 873#L26-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := main_#t~post6#1 - 1;havoc main_#t~post6#1; 880#L26-3 assume !!(main_~i~0#1 >= 0);call main_#t~mem7#1 := read~int(main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);call write~int(main_#t~mem7#1, main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);havoc main_#t~mem7#1;main_#t~post8#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 879#L26-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := main_#t~post6#1 - 1;havoc main_#t~post6#1; 878#L26-3 assume !!(main_~i~0#1 >= 0);call main_#t~mem7#1 := read~int(main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);call write~int(main_#t~mem7#1, main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);havoc main_#t~mem7#1;main_#t~post8#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 877#L26-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := main_#t~post6#1 - 1;havoc main_#t~post6#1; 876#L26-3 assume !(main_~i~0#1 >= 0); 868#L26-4 main_~j~0#1 := (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296);main_~i~0#1 := 0; 859#L32-3 [2021-12-14 23:25:33,170 INFO L793 eck$LassoCheckResult]: Loop: 859#L32-3 assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call main_#t~mem10#1 := read~int(main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);call main_#t~mem11#1 := read~int(main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem10#1 == main_#t~mem11#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 865#L6 assume !(0 == __VERIFIER_assert_~cond#1); 860#L6-2 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem10#1;havoc main_#t~mem11#1;main_#t~post12#1 := main_~j~0#1;main_~j~0#1 := main_#t~post12#1 - 1;havoc main_#t~post12#1; 858#L32-2 main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 859#L32-3 [2021-12-14 23:25:33,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:25:33,170 INFO L85 PathProgramCache]: Analyzing trace with hash -430652763, now seen corresponding path program 2 times [2021-12-14 23:25:33,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:25:33,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766168804] [2021-12-14 23:25:33,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:25:33,170 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:25:33,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:25:33,347 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-14 23:25:33,347 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 23:25:33,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766168804] [2021-12-14 23:25:33,347 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766168804] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 23:25:33,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506312759] [2021-12-14 23:25:33,347 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 23:25:33,347 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 23:25:33,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:33,348 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 23:25:33,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2021-12-14 23:25:33,401 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 23:25:33,401 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 23:25:33,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-14 23:25:33,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:25:33,506 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-14 23:25:33,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 23:25:33,679 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-14 23:25:33,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506312759] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 23:25:33,679 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 23:25:33,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 21 [2021-12-14 23:25:33,680 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215715524] [2021-12-14 23:25:33,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 23:25:33,680 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-14 23:25:33,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:25:33,680 INFO L85 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 3 times [2021-12-14 23:25:33,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:25:33,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548257764] [2021-12-14 23:25:33,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:25:33,681 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:25:33,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:25:33,684 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:25:33,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:25:33,686 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:25:33,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 23:25:33,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-14 23:25:33,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2021-12-14 23:25:33,758 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. cyclomatic complexity: 6 Second operand has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 23:25:34,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 23:25:34,166 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2021-12-14 23:25:34,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-14 23:25:34,167 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 68 transitions. [2021-12-14 23:25:34,167 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-14 23:25:34,168 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 64 states and 68 transitions. [2021-12-14 23:25:34,168 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2021-12-14 23:25:34,168 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2021-12-14 23:25:34,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 68 transitions. [2021-12-14 23:25:34,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:25:34,168 INFO L681 BuchiCegarLoop]: Abstraction has 64 states and 68 transitions. [2021-12-14 23:25:34,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 68 transitions. [2021-12-14 23:25:34,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 48. [2021-12-14 23:25:34,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 47 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) [2021-12-14 23:25:34,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2021-12-14 23:25:34,170 INFO L704 BuchiCegarLoop]: Abstraction has 48 states and 52 transitions. [2021-12-14 23:25:34,170 INFO L587 BuchiCegarLoop]: Abstraction has 48 states and 52 transitions. [2021-12-14 23:25:34,170 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-12-14 23:25:34,170 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 52 transitions. [2021-12-14 23:25:34,171 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-14 23:25:34,171 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-14 23:25:34,171 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-14 23:25:34,171 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2021-12-14 23:25:34,171 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-14 23:25:34,171 INFO L791 eck$LassoCheckResult]: Stem: 1152#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(18, 2);call #Ultimate.allocInit(12, 3); 1153#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post4#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post6#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post12#1, main_#t~post9#1, main_~max~0#1, main_~#str1~0#1.base, main_~#str1~0#1.offset, main_~#str2~0#1.base, main_~#str2~0#1.offset, main_~i~0#1, main_~j~0#1;main_~max~0#1 := 5;call main_~#str1~0#1.base, main_~#str1~0#1.offset := #Ultimate.allocOnStack((if main_~max~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0#1 % 4294967296 % 4294967296 else main_~max~0#1 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0#1.base, main_~#str2~0#1.offset := #Ultimate.allocOnStack((if main_~max~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0#1 % 4294967296 % 4294967296 else main_~max~0#1 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0#1;havoc main_~j~0#1;main_~i~0#1 := 0; 1161#L18-3 assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 1162#L18-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1163#L18-3 assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 1155#L18-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1156#L18-3 assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 1194#L18-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1186#L18-3 assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 1182#L18-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1176#L18-3 assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call write~int(main_#t~nondet5#1, main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet5#1; 1177#L18-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1169#L18-3 assume !(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296); 1164#L18-4 call write~int(0, main_~#str1~0#1.base, main_~#str1~0#1.offset + (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0#1 := 0;main_~i~0#1 := (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296); 1165#L26-3 assume !!(main_~i~0#1 >= 0);call main_#t~mem7#1 := read~int(main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);call write~int(main_#t~mem7#1, main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);havoc main_#t~mem7#1;main_#t~post8#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1166#L26-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := main_#t~post6#1 - 1;havoc main_#t~post6#1; 1167#L26-3 assume !!(main_~i~0#1 >= 0);call main_#t~mem7#1 := read~int(main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);call write~int(main_#t~mem7#1, main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);havoc main_#t~mem7#1;main_#t~post8#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1168#L26-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := main_#t~post6#1 - 1;havoc main_#t~post6#1; 1193#L26-3 assume !!(main_~i~0#1 >= 0);call main_#t~mem7#1 := read~int(main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);call write~int(main_#t~mem7#1, main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);havoc main_#t~mem7#1;main_#t~post8#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1192#L26-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := main_#t~post6#1 - 1;havoc main_#t~post6#1; 1191#L26-3 assume !!(main_~i~0#1 >= 0);call main_#t~mem7#1 := read~int(main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);call write~int(main_#t~mem7#1, main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);havoc main_#t~mem7#1;main_#t~post8#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1189#L26-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := main_#t~post6#1 - 1;havoc main_#t~post6#1; 1180#L26-3 assume !!(main_~i~0#1 >= 0);call main_#t~mem7#1 := read~int(main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);call write~int(main_#t~mem7#1, main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);havoc main_#t~mem7#1;main_#t~post8#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1181#L26-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := main_#t~post6#1 - 1;havoc main_#t~post6#1; 1171#L26-3 assume !(main_~i~0#1 >= 0); 1160#L26-4 main_~j~0#1 := (if (main_~max~0#1 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0#1 - 1) % 4294967296 % 4294967296 else (main_~max~0#1 - 1) % 4294967296 % 4294967296 - 4294967296);main_~i~0#1 := 0; 1151#L32-3 [2021-12-14 23:25:34,171 INFO L793 eck$LassoCheckResult]: Loop: 1151#L32-3 assume !!(main_~i~0#1 % 4294967296 < main_~max~0#1 % 4294967296);call main_#t~mem10#1 := read~int(main_~#str1~0#1.base, main_~#str1~0#1.offset + main_~i~0#1, 1);call main_#t~mem11#1 := read~int(main_~#str2~0#1.base, main_~#str2~0#1.offset + main_~j~0#1, 1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem10#1 == main_#t~mem11#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1157#L6 assume !(0 == __VERIFIER_assert_~cond#1); 1154#L6-2 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem10#1;havoc main_#t~mem11#1;main_#t~post12#1 := main_~j~0#1;main_~j~0#1 := main_#t~post12#1 - 1;havoc main_#t~post12#1; 1150#L32-2 main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1151#L32-3 [2021-12-14 23:25:34,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:25:34,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1540388377, now seen corresponding path program 3 times [2021-12-14 23:25:34,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:25:34,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501883914] [2021-12-14 23:25:34,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:25:34,172 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:25:34,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:25:34,186 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:25:34,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:25:34,202 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:25:34,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:25:34,203 INFO L85 PathProgramCache]: Analyzing trace with hash 2100362, now seen corresponding path program 4 times [2021-12-14 23:25:34,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:25:34,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737878320] [2021-12-14 23:25:34,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:25:34,203 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:25:34,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:25:34,206 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:25:34,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:25:34,209 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:25:34,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:25:34,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1945357456, now seen corresponding path program 1 times [2021-12-14 23:25:34,209 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 23:25:34,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267137633] [2021-12-14 23:25:34,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 23:25:34,209 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 23:25:34,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:25:34,270 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 23:25:34,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 23:25:34,292 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 23:25:40,653 WARN L227 SmtUtils]: Spent 6.28s on a formula simplification. DAG size of input: 291 DAG size of output: 217 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-14 23:25:42,376 INFO L210 LassoAnalysis]: Preferences: [2021-12-14 23:25:42,376 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-14 23:25:42,376 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-14 23:25:42,376 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-14 23:25:42,376 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-14 23:25:42,376 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:42,376 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-14 23:25:42,376 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-14 23:25:42,376 INFO L133 ssoRankerPreferences]: Filename of dumped script: invert_string-3.c_Iteration9_Lasso [2021-12-14 23:25:42,377 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-14 23:25:42,377 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-14 23:25:42,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:42,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:42,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:42,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:42,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:42,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:43,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:43,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:43,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:43,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:43,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:43,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:43,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:43,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-14 23:25:44,102 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-14 23:25:44,103 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-14 23:25:44,103 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:44,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:44,108 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) [2021-12-14 23:25:44,110 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 [2021-12-14 23:25:44,110 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:44,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:44,116 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:25:44,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:44,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:44,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:44,117 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:25:44,117 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:25:44,131 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:44,147 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 [2021-12-14 23:25:44,148 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:44,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:44,148 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) [2021-12-14 23:25:44,149 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 [2021-12-14 23:25:44,151 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:44,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:44,157 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:25:44,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:44,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:44,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:44,158 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:25:44,158 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:25:44,159 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:44,176 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 [2021-12-14 23:25:44,177 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:44,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:44,178 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) [2021-12-14 23:25:44,179 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 [2021-12-14 23:25:44,181 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:44,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:44,187 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:25:44,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:44,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:44,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:44,187 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:25:44,187 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:25:44,188 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:44,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2021-12-14 23:25:44,206 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:44,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:44,207 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) [2021-12-14 23:25:44,208 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 [2021-12-14 23:25:44,209 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:44,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:44,216 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-14 23:25:44,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:44,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:44,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:44,217 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-14 23:25:44,217 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-14 23:25:44,231 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:44,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2021-12-14 23:25:44,247 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:44,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:44,248 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) [2021-12-14 23:25:44,249 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 [2021-12-14 23:25:44,250 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:44,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:44,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:44,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:44,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:44,257 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:44,257 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:44,262 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:44,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2021-12-14 23:25:44,281 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:44,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:44,282 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) [2021-12-14 23:25:44,283 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 [2021-12-14 23:25:44,284 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:44,290 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:44,290 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:44,290 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:44,290 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:44,291 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:44,291 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:44,306 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:44,324 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 [2021-12-14 23:25:44,325 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:44,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:44,333 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) [2021-12-14 23:25:44,334 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 [2021-12-14 23:25:44,335 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:44,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:44,342 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:44,342 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:44,342 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:44,343 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:44,343 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:44,345 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:44,362 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 [2021-12-14 23:25:44,362 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:44,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:44,363 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) [2021-12-14 23:25:44,364 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 [2021-12-14 23:25:44,365 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:44,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:44,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:44,372 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:44,372 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:44,373 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:44,373 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:44,382 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:44,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2021-12-14 23:25:44,403 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:44,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:44,404 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) [2021-12-14 23:25:44,405 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 [2021-12-14 23:25:44,406 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:44,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:44,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:44,412 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:44,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:44,413 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:44,413 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:44,415 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:44,434 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 [2021-12-14 23:25:44,434 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:44,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:44,435 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) [2021-12-14 23:25:44,451 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:44,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:44,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:44,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:44,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:44,459 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:44,459 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:44,462 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 [2021-12-14 23:25:44,462 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:44,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2021-12-14 23:25:44,488 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:44,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:44,489 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) [2021-12-14 23:25:44,491 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 [2021-12-14 23:25:44,492 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:44,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:44,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:44,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:44,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:44,500 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:44,500 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:44,513 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:44,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2021-12-14 23:25:44,544 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:44,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:44,545 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) [2021-12-14 23:25:44,546 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 [2021-12-14 23:25:44,547 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:44,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:44,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:44,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:44,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:44,555 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:44,555 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:44,565 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:44,580 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 [2021-12-14 23:25:44,580 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:44,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:44,581 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:44,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2021-12-14 23:25:44,583 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:44,589 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:44,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:44,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:44,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:44,590 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:44,590 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:44,594 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:44,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2021-12-14 23:25:44,609 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:44,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:44,610 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:44,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2021-12-14 23:25:44,612 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:44,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:44,618 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:44,618 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:44,618 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:44,619 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:44,619 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:44,625 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:44,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2021-12-14 23:25:44,651 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:44,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:44,652 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:44,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2021-12-14 23:25:44,655 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:44,661 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:44,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:44,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:44,661 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:44,663 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:44,663 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:44,666 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:44,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2021-12-14 23:25:44,682 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:44,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:44,683 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:44,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2021-12-14 23:25:44,685 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:44,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:44,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:44,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:44,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:44,693 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:44,693 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:44,708 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:44,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2021-12-14 23:25:44,724 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:44,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:44,725 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:44,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2021-12-14 23:25:44,727 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:44,733 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:44,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:44,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:44,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:44,735 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:44,735 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:44,750 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:44,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2021-12-14 23:25:44,766 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:44,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:44,767 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:44,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2021-12-14 23:25:44,769 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:44,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:44,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:44,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:44,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:44,776 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:44,776 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:44,791 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:44,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2021-12-14 23:25:44,807 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:44,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:44,808 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:44,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2021-12-14 23:25:44,810 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:44,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:44,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:44,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:44,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:44,818 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:44,818 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:44,821 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-14 23:25:44,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2021-12-14 23:25:44,838 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:44,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:44,839 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:44,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2021-12-14 23:25:44,841 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-14 23:25:44,847 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-14 23:25:44,847 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-14 23:25:44,847 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-14 23:25:44,847 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-14 23:25:44,862 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-14 23:25:44,862 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-14 23:25:44,875 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-14 23:25:44,919 INFO L443 ModelExtractionUtils]: Simplification made 19 calls to the SMT solver. [2021-12-14 23:25:44,920 INFO L444 ModelExtractionUtils]: 5 out of 25 variables were initially zero. Simplification set additionally 16 variables to zero. [2021-12-14 23:25:44,920 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-14 23:25:44,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 23:25:44,922 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-14 23:25:44,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2021-12-14 23:25:44,923 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-14 23:25:44,930 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-14 23:25:44,930 INFO L513 LassoAnalysis]: Proved termination. [2021-12-14 23:25:44,930 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~#str2~0#1.offset, ULTIMATE.start_main_~j~0#1, v_rep(select #length ULTIMATE.start_main_~#str1~0#1.base)_3) = 2*ULTIMATE.start_main_~#str2~0#1.offset + 2*ULTIMATE.start_main_~j~0#1 + 1*v_rep(select #length ULTIMATE.start_main_~#str1~0#1.base)_3 Supporting invariants [] [2021-12-14 23:25:44,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2021-12-14 23:25:45,107 INFO L297 tatePredicateManager]: 64 out of 64 supporting invariants were superfluous and have been removed [2021-12-14 23:25:45,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 23:25:45,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:25:45,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 23:25:45,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:25:45,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 23:25:45,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 23:25:45,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 23:25:45,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 23:25:45,219 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2021-12-14 23:25:45,219 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 52 transitions. cyclomatic complexity: 7 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) [2021-12-14 23:25:45,226 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 52 transitions. cyclomatic complexity: 7. 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) Result 53 states and 58 transitions. Complement of second has 6 states. [2021-12-14 23:25:45,226 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 [2021-12-14 23:25:45,227 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2021-12-14 23:25:45,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2021-12-14 23:25:45,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 26 letters. Loop has 4 letters. [2021-12-14 23:25:45,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:25:45,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 30 letters. Loop has 4 letters. [2021-12-14 23:25:45,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:25:45,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 26 letters. Loop has 8 letters. [2021-12-14 23:25:45,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-14 23:25:45,228 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 58 transitions. [2021-12-14 23:25:45,228 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-14 23:25:45,228 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 0 states and 0 transitions. [2021-12-14 23:25:45,228 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-12-14 23:25:45,228 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-12-14 23:25:45,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-12-14 23:25:45,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 23:25:45,228 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-14 23:25:45,228 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-14 23:25:45,228 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-14 23:25:45,228 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-12-14 23:25:45,228 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-12-14 23:25:45,228 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-14 23:25:45,229 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-12-14 23:25:45,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.12 11:25:45 BoogieIcfgContainer [2021-12-14 23:25:45,233 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-12-14 23:25:45,233 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 23:25:45,233 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 23:25:45,233 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 23:25:45,233 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:25:24" (3/4) ... [2021-12-14 23:25:45,235 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-14 23:25:45,235 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 23:25:45,236 INFO L158 Benchmark]: Toolchain (without parser) took 20914.31ms. Allocated memory was 88.1MB in the beginning and 182.5MB in the end (delta: 94.4MB). Free memory was 54.9MB in the beginning and 78.4MB in the end (delta: -23.5MB). Peak memory consumption was 70.9MB. Max. memory is 16.1GB. [2021-12-14 23:25:45,236 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 88.1MB. Free memory is still 44.5MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 23:25:45,236 INFO L158 Benchmark]: CACSL2BoogieTranslator took 292.18ms. Allocated memory is still 88.1MB. Free memory was 54.8MB in the beginning and 63.5MB in the end (delta: -8.7MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2021-12-14 23:25:45,236 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.03ms. Allocated memory is still 88.1MB. Free memory was 63.5MB in the beginning and 61.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 23:25:45,236 INFO L158 Benchmark]: Boogie Preprocessor took 16.10ms. Allocated memory is still 88.1MB. Free memory was 61.8MB in the beginning and 60.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 23:25:45,237 INFO L158 Benchmark]: RCFGBuilder took 248.74ms. Allocated memory is still 88.1MB. Free memory was 60.7MB in the beginning and 50.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-14 23:25:45,237 INFO L158 Benchmark]: BuchiAutomizer took 20281.00ms. Allocated memory was 88.1MB in the beginning and 182.5MB in the end (delta: 94.4MB). Free memory was 50.2MB in the beginning and 78.4MB in the end (delta: -28.2MB). Peak memory consumption was 65.5MB. Max. memory is 16.1GB. [2021-12-14 23:25:45,237 INFO L158 Benchmark]: Witness Printer took 2.43ms. Allocated memory is still 182.5MB. Free memory is still 78.4MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 23:25:45,238 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 88.1MB. Free memory is still 44.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 292.18ms. Allocated memory is still 88.1MB. Free memory was 54.8MB in the beginning and 63.5MB in the end (delta: -8.7MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.03ms. Allocated memory is still 88.1MB. Free memory was 63.5MB in the beginning and 61.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 16.10ms. Allocated memory is still 88.1MB. Free memory was 61.8MB in the beginning and 60.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 248.74ms. Allocated memory is still 88.1MB. Free memory was 60.7MB in the beginning and 50.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 20281.00ms. Allocated memory was 88.1MB in the beginning and 182.5MB in the end (delta: 94.4MB). Free memory was 50.2MB in the beginning and 78.4MB in the end (delta: -28.2MB). Peak memory consumption was 65.5MB. Max. memory is 16.1GB. * Witness Printer took 2.43ms. Allocated memory is still 182.5MB. Free memory is still 78.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (6 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * str1 + -1 * i + unknown-#length-unknown[str1] and consists of 5 locations. One deterministic module has affine ranking function 2 * i + 1 and consists of 4 locations. One deterministic module has affine ranking function 2 * j + 2 * str2 + unknown-#length-unknown[str1] and consists of 4 locations. 6 modules have a trivial ranking function, the largest among these consists of 21 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 20.2s and 10 iterations. TraceHistogramMax:5. Analysis of lassos took 18.5s. Construction of modules took 0.4s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 9. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 23 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 48 states and ocurred in iteration 8. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 229 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 226 mSDsluCounter, 193 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 112 mSDsCounter, 129 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 491 IncrementalHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 129 mSolverCounterUnsat, 81 mSDtfsCounter, 491 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU6 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital753 mio100 ax100 hnf100 lsp97 ukn53 mio100 lsp44 div258 bol100 ite100 ukn100 eq154 hnf59 smp95 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 40ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2021-12-14 23:25:45,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2021-12-14 23:25:45,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2021-12-14 23:25:45,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2021-12-14 23:25:45,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2021-12-14 23:25:46,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2021-12-14 23:25:46,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE