./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-numeric/Binomial.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3dbbec33 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-numeric/Binomial.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c204b56aba09d3ce87e17edffdff1d33aa0b4dc87a1e1140339548dffa982588 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3dbbec3 [2023-02-14 14:42:46,231 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 14:42:46,233 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 14:42:46,257 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 14:42:46,258 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 14:42:46,259 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 14:42:46,260 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 14:42:46,262 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 14:42:46,263 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 14:42:46,264 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 14:42:46,265 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 14:42:46,266 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 14:42:46,266 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 14:42:46,267 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 14:42:46,268 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 14:42:46,269 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 14:42:46,270 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 14:42:46,270 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 14:42:46,272 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 14:42:46,273 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 14:42:46,274 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 14:42:46,280 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 14:42:46,281 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 14:42:46,283 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 14:42:46,287 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 14:42:46,291 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 14:42:46,291 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 14:42:46,292 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 14:42:46,294 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 14:42:46,294 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 14:42:46,296 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 14:42:46,297 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 14:42:46,298 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 14:42:46,299 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 14:42:46,300 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 14:42:46,300 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 14:42:46,301 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 14:42:46,301 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 14:42:46,301 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 14:42:46,304 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 14:42:46,305 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 14:42:46,306 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2023-02-14 14:42:46,338 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 14:42:46,338 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 14:42:46,339 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 14:42:46,339 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 14:42:46,340 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 14:42:46,340 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 14:42:46,341 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 14:42:46,341 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-02-14 14:42:46,341 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-02-14 14:42:46,341 INFO L138 SettingsManager]: * Use old map elimination=false [2023-02-14 14:42:46,342 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2023-02-14 14:42:46,343 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2023-02-14 14:42:46,343 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-02-14 14:42:46,343 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 14:42:46,343 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-14 14:42:46,343 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 14:42:46,344 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 14:42:46,344 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-02-14 14:42:46,344 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-02-14 14:42:46,344 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-02-14 14:42:46,344 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-14 14:42:46,345 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-02-14 14:42:46,345 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 14:42:46,345 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-02-14 14:42:46,345 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 14:42:46,346 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 14:42:46,346 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 14:42:46,346 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-14 14:42:46,347 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-02-14 14:42:46,347 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c204b56aba09d3ce87e17edffdff1d33aa0b4dc87a1e1140339548dffa982588 [2023-02-14 14:42:46,578 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 14:42:46,603 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 14:42:46,606 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 14:42:46,607 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 14:42:46,608 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 14:42:46,609 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-numeric/Binomial.c [2023-02-14 14:42:47,857 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 14:42:48,012 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 14:42:48,012 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Binomial.c [2023-02-14 14:42:48,018 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fa77a09c/688f4bd60c5e43fe8ad7e0dea38aeea5/FLAGe9f508acf [2023-02-14 14:42:48,032 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fa77a09c/688f4bd60c5e43fe8ad7e0dea38aeea5 [2023-02-14 14:42:48,034 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 14:42:48,035 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 14:42:48,036 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 14:42:48,037 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 14:42:48,040 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 14:42:48,040 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 02:42:48" (1/1) ... [2023-02-14 14:42:48,041 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@509e7fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:42:48, skipping insertion in model container [2023-02-14 14:42:48,042 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 02:42:48" (1/1) ... [2023-02-14 14:42:48,048 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 14:42:48,060 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 14:42:48,175 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 14:42:48,180 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 14:42:48,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 14:42:48,206 INFO L208 MainTranslator]: Completed translation [2023-02-14 14:42:48,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:42:48 WrapperNode [2023-02-14 14:42:48,207 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 14:42:48,209 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 14:42:48,209 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 14:42:48,209 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 14:42:48,216 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:42:48" (1/1) ... [2023-02-14 14:42:48,222 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:42:48" (1/1) ... [2023-02-14 14:42:48,244 INFO L138 Inliner]: procedures = 6, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 55 [2023-02-14 14:42:48,245 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 14:42:48,247 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 14:42:48,247 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 14:42:48,247 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 14:42:48,254 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:42:48" (1/1) ... [2023-02-14 14:42:48,255 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:42:48" (1/1) ... [2023-02-14 14:42:48,258 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:42:48" (1/1) ... [2023-02-14 14:42:48,258 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:42:48" (1/1) ... [2023-02-14 14:42:48,265 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:42:48" (1/1) ... [2023-02-14 14:42:48,269 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:42:48" (1/1) ... [2023-02-14 14:42:48,274 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:42:48" (1/1) ... [2023-02-14 14:42:48,275 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:42:48" (1/1) ... [2023-02-14 14:42:48,277 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 14:42:48,279 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 14:42:48,279 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 14:42:48,279 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 14:42:48,280 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:42:48" (1/1) ... [2023-02-14 14:42:48,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:48,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:48,311 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) [2023-02-14 14:42:48,337 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 [2023-02-14 14:42:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure fact [2023-02-14 14:42:48,352 INFO L138 BoogieDeclarations]: Found implementation of procedure fact [2023-02-14 14:42:48,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 14:42:48,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 14:42:48,409 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 14:42:48,410 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 14:42:48,602 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 14:42:48,622 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 14:42:48,623 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-14 14:42:48,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 02:42:48 BoogieIcfgContainer [2023-02-14 14:42:48,625 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 14:42:48,626 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-02-14 14:42:48,626 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2023-02-14 14:42:48,629 INFO L275 PluginConnector]: BuchiAutomizer initialized [2023-02-14 14:42:48,630 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-14 14:42:48,645 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.02 02:42:48" (1/3) ... [2023-02-14 14:42:48,646 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5100003a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.02 02:42:48, skipping insertion in model container [2023-02-14 14:42:48,646 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-14 14:42:48,646 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:42:48" (2/3) ... [2023-02-14 14:42:48,647 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5100003a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.02 02:42:48, skipping insertion in model container [2023-02-14 14:42:48,647 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-14 14:42:48,647 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 02:42:48" (3/3) ... [2023-02-14 14:42:48,648 INFO L332 chiAutomizerObserver]: Analyzing ICFG Binomial.c [2023-02-14 14:42:48,737 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-02-14 14:42:48,737 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-02-14 14:42:48,738 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-02-14 14:42:48,738 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-02-14 14:42:48,738 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-02-14 14:42:48,738 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-02-14 14:42:48,738 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-02-14 14:42:48,738 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-02-14 14:42:48,742 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 28 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-14 14:42:48,762 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2023-02-14 14:42:48,762 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 14:42:48,763 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 14:42:48,777 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-02-14 14:42:48,777 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-02-14 14:42:48,778 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-02-14 14:42:48,778 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 28 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-14 14:42:48,781 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2023-02-14 14:42:48,781 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 14:42:48,781 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 14:42:48,781 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-02-14 14:42:48,781 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-02-14 14:42:48,788 INFO L748 eck$LassoCheckResult]: Stem: 26#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 14#L35true assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 27#L38true assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 11#L41-3true [2023-02-14 14:42:48,789 INFO L750 eck$LassoCheckResult]: Loop: 11#L41-3true assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 20#L42-3true assume !(main_~k~0#1 <= main_~x~0#1); 12#L41-2true main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 11#L41-3true [2023-02-14 14:42:48,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:42:48,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 1 times [2023-02-14 14:42:48,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:42:48,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594344921] [2023-02-14 14:42:48,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:42:48,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:42:48,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:42:48,896 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:42:48,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:42:48,933 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:42:48,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:42:48,936 INFO L85 PathProgramCache]: Analyzing trace with hash 57812, now seen corresponding path program 1 times [2023-02-14 14:42:48,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:42:48,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441247903] [2023-02-14 14:42:48,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:42:48,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:42:48,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:42:48,958 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:42:48,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:42:48,970 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:42:48,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:42:48,972 INFO L85 PathProgramCache]: Analyzing trace with hash 553673357, now seen corresponding path program 1 times [2023-02-14 14:42:48,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:42:48,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695920200] [2023-02-14 14:42:48,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:42:48,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:42:48,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:42:49,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 14:42:49,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:42:49,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695920200] [2023-02-14 14:42:49,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695920200] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 14:42:49,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 14:42:49,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 14:42:49,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759184623] [2023-02-14 14:42:49,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 14:42:49,159 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 14:42:49,161 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 14:42:49,161 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 14:42:49,161 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 14:42:49,162 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-14 14:42:49,162 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:49,162 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 14:42:49,162 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 14:42:49,162 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration1_Loop [2023-02-14 14:42:49,163 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 14:42:49,163 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 14:42:49,178 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:49,188 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:49,244 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 14:42:49,245 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-14 14:42:49,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:49,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:49,251 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) [2023-02-14 14:42:49,253 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 [2023-02-14 14:42:49,254 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 14:42:49,254 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 14:42:49,280 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 14:42:49,280 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post7#1=0} Honda state: {ULTIMATE.start_main_#t~post7#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-14 14:42:49,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-02-14 14:42:49,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:49,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:49,291 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) [2023-02-14 14:42:49,304 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 14:42:49,304 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 14:42:49,315 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 [2023-02-14 14:42:49,337 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 [2023-02-14 14:42:49,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:49,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:49,339 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) [2023-02-14 14:42:49,342 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 [2023-02-14 14:42:49,343 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-14 14:42:49,343 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 14:42:49,481 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-14 14:42:49,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2023-02-14 14:42:49,486 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 14:42:49,486 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 14:42:49,486 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 14:42:49,486 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 14:42:49,486 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-14 14:42:49,486 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:49,486 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 14:42:49,486 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 14:42:49,486 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration1_Loop [2023-02-14 14:42:49,487 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 14:42:49,487 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 14:42:49,488 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:49,492 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:49,549 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 14:42:49,554 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-14 14:42:49,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:49,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:49,556 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) [2023-02-14 14:42:49,567 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 [2023-02-14 14:42:49,568 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 [2023-02-14 14:42:49,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:49,575 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:49,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:49,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:49,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:42:49,578 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 14:42:49,578 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:49,589 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:49,593 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 [2023-02-14 14:42:49,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:49,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:49,595 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) [2023-02-14 14:42:49,602 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 [2023-02-14 14:42:49,603 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 [2023-02-14 14:42:49,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:49,610 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:49,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:49,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:49,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:42:49,612 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 14:42:49,613 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:49,636 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-14 14:42:49,641 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-02-14 14:42:49,642 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 2 variables to zero. [2023-02-14 14:42:49,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:49,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:49,677 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) [2023-02-14 14:42:49,679 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 [2023-02-14 14:42:49,680 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-14 14:42:49,681 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-14 14:42:49,681 INFO L513 LassoAnalysis]: Proved termination. [2023-02-14 14:42:49,681 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1) = -1*ULTIMATE.start_main_~n~0#1 Supporting invariants [] [2023-02-14 14:42:49,686 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 [2023-02-14 14:42:49,689 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-14 14:42:49,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:42:49,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:42:49,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-14 14:42:49,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:42:49,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:42:49,749 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-14 14:42:49,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:42:49,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 14:42:49,831 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2023-02-14 14:42:49,833 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 28 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:42:49,908 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 28 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7). Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 73 states and 106 transitions. Complement of second has 11 states. [2023-02-14 14:42:49,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2023-02-14 14:42:49,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:42:49,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2023-02-14 14:42:49,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 54 transitions. Stem has 4 letters. Loop has 3 letters. [2023-02-14 14:42:49,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 14:42:49,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 54 transitions. Stem has 7 letters. Loop has 3 letters. [2023-02-14 14:42:49,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 14:42:49,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 54 transitions. Stem has 4 letters. Loop has 6 letters. [2023-02-14 14:42:49,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 14:42:49,919 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 106 transitions. [2023-02-14 14:42:49,924 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2023-02-14 14:42:49,931 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 33 states and 48 transitions. [2023-02-14 14:42:49,932 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2023-02-14 14:42:49,932 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2023-02-14 14:42:49,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 48 transitions. [2023-02-14 14:42:49,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 14:42:49,933 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 48 transitions. [2023-02-14 14:42:49,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 48 transitions. [2023-02-14 14:42:49,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2023-02-14 14:42:49,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-14 14:42:49,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2023-02-14 14:42:49,963 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 42 transitions. [2023-02-14 14:42:49,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 14:42:49,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 14:42:49,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 14:42:49,980 INFO L87 Difference]: Start difference. First operand 30 states and 42 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:42:50,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:42:50,064 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2023-02-14 14:42:50,064 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2023-02-14 14:42:50,070 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2023-02-14 14:42:50,072 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 28 states and 37 transitions. [2023-02-14 14:42:50,072 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2023-02-14 14:42:50,072 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2023-02-14 14:42:50,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 37 transitions. [2023-02-14 14:42:50,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-14 14:42:50,073 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 37 transitions. [2023-02-14 14:42:50,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 37 transitions. [2023-02-14 14:42:50,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2023-02-14 14:42:50,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-14 14:42:50,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2023-02-14 14:42:50,082 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 35 transitions. [2023-02-14 14:42:50,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 14:42:50,086 INFO L428 stractBuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2023-02-14 14:42:50,086 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-02-14 14:42:50,086 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2023-02-14 14:42:50,088 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2023-02-14 14:42:50,088 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 14:42:50,088 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 14:42:50,089 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-02-14 14:42:50,093 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:42:50,094 INFO L748 eck$LassoCheckResult]: Stem: 243#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 231#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 232#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 238#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 234#L41-3 [2023-02-14 14:42:50,094 INFO L750 eck$LassoCheckResult]: Loop: 234#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 235#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 240#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 218#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 219#$Ultimate##0 ~n := #in~n; 241#L25 assume ~n <= 0;#res := 1; 230#factFINAL assume true; 220#factEXIT >#74#return; 225#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 219#$Ultimate##0 ~n := #in~n; 241#L25 assume ~n <= 0;#res := 1; 230#factFINAL assume true; 220#factEXIT >#76#return; 221#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 219#$Ultimate##0 ~n := #in~n; 241#L25 assume ~n <= 0;#res := 1; 230#factFINAL assume true; 220#factEXIT >#78#return; 227#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 233#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 239#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 242#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 237#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 234#L41-3 [2023-02-14 14:42:50,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:42:50,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 2 times [2023-02-14 14:42:50,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:42:50,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501426837] [2023-02-14 14:42:50,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:42:50,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:42:50,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:42:50,103 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:42:50,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:42:50,109 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:42:50,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:42:50,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1284911041, now seen corresponding path program 1 times [2023-02-14 14:42:50,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:42:50,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117240499] [2023-02-14 14:42:50,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:42:50,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:42:50,128 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 14:42:50,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [381745531] [2023-02-14 14:42:50,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:42:50,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 14:42:50,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:50,132 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 14:42:50,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-14 14:42:50,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:42:50,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-14 14:42:50,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:42:50,229 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-14 14:42:50,229 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 14:42:50,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:42:50,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117240499] [2023-02-14 14:42:50,230 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 14:42:50,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381745531] [2023-02-14 14:42:50,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381745531] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 14:42:50,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 14:42:50,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 14:42:50,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260116662] [2023-02-14 14:42:50,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 14:42:50,231 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-14 14:42:50,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 14:42:50,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 14:42:50,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 14:42:50,232 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-14 14:42:50,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:42:50,315 INFO L93 Difference]: Finished difference Result 34 states and 50 transitions. [2023-02-14 14:42:50,316 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 50 transitions. [2023-02-14 14:42:50,317 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2023-02-14 14:42:50,319 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 50 transitions. [2023-02-14 14:42:50,319 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2023-02-14 14:42:50,319 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2023-02-14 14:42:50,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 50 transitions. [2023-02-14 14:42:50,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-14 14:42:50,320 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 50 transitions. [2023-02-14 14:42:50,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 50 transitions. [2023-02-14 14:42:50,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2023-02-14 14:42:50,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 7 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2023-02-14 14:42:50,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2023-02-14 14:42:50,326 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 42 transitions. [2023-02-14 14:42:50,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 14:42:50,327 INFO L428 stractBuchiCegarLoop]: Abstraction has 28 states and 42 transitions. [2023-02-14 14:42:50,328 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-02-14 14:42:50,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 42 transitions. [2023-02-14 14:42:50,329 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2023-02-14 14:42:50,329 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 14:42:50,329 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 14:42:50,330 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-02-14 14:42:50,330 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:42:50,330 INFO L748 eck$LassoCheckResult]: Stem: 380#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 366#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 367#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 374#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 370#L41-3 [2023-02-14 14:42:50,330 INFO L750 eck$LassoCheckResult]: Loop: 370#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 371#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 376#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 354#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 355#$Ultimate##0 ~n := #in~n; 378#L25 assume ~n <= 0;#res := 1; 365#factFINAL assume true; 356#factEXIT >#74#return; 362#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 355#$Ultimate##0 ~n := #in~n; 378#L25 assume ~n <= 0;#res := 1; 365#factFINAL assume true; 356#factEXIT >#76#return; 358#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 355#$Ultimate##0 ~n := #in~n; 378#L25 assume !(~n <= 0); 360#L26 call #t~ret0 := fact(~n - 1);< 355#$Ultimate##0 ~n := #in~n; 378#L25 assume ~n <= 0;#res := 1; 365#factFINAL assume true; 356#factEXIT >#66#return; 364#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 377#factFINAL assume true; 381#factEXIT >#78#return; 368#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 369#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 375#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 379#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 373#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 370#L41-3 [2023-02-14 14:42:50,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:42:50,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 3 times [2023-02-14 14:42:50,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:42:50,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075988241] [2023-02-14 14:42:50,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:42:50,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:42:50,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:42:50,336 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:42:50,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:42:50,340 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:42:50,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:42:50,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1183838151, now seen corresponding path program 1 times [2023-02-14 14:42:50,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:42:50,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285156817] [2023-02-14 14:42:50,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:42:50,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:42:50,351 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 14:42:50,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1658217101] [2023-02-14 14:42:50,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:42:50,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 14:42:50,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:50,355 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 14:42:50,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-14 14:42:50,397 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 [2023-02-14 14:42:50,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:42:50,413 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:42:50,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:42:50,436 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:42:50,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:42:50,437 INFO L85 PathProgramCache]: Analyzing trace with hash 2107943858, now seen corresponding path program 1 times [2023-02-14 14:42:50,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:42:50,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352099250] [2023-02-14 14:42:50,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:42:50,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:42:50,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:42:50,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:42:50,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352099250] [2023-02-14 14:42:50,455 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-14 14:42:50,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186277577] [2023-02-14 14:42:50,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:42:50,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 14:42:50,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:50,457 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 14:42:50,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-14 14:42:50,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:42:50,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-14 14:42:50,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:42:50,545 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-02-14 14:42:50,546 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 14:42:50,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186277577] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 14:42:50,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 14:42:50,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 14:42:50,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43422253] [2023-02-14 14:42:50,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 14:42:50,924 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 14:42:50,925 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 14:42:50,925 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 14:42:50,925 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 14:42:50,925 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-14 14:42:50,925 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:50,925 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 14:42:50,925 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 14:42:50,925 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration3_Loop [2023-02-14 14:42:50,925 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 14:42:50,925 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 14:42:50,926 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:50,931 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:50,962 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:50,965 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:50,967 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:50,970 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:50,977 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:51,251 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 14:42:51,251 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-14 14:42:51,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:51,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:51,256 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) [2023-02-14 14:42:51,258 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 [2023-02-14 14:42:51,260 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 14:42:51,260 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 14:42:51,281 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 14:42:51,282 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-14 14:42:51,293 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 [2023-02-14 14:42:51,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:51,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:51,297 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) [2023-02-14 14:42:51,313 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 [2023-02-14 14:42:51,316 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 14:42:51,316 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 14:42:51,351 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 [2023-02-14 14:42:51,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:51,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:51,353 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) [2023-02-14 14:42:51,368 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-14 14:42:51,368 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 14:42:51,373 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 [2023-02-14 14:42:51,400 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-14 14:42:51,408 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 [2023-02-14 14:42:51,408 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 14:42:51,408 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 14:42:51,409 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 14:42:51,409 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 14:42:51,409 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-14 14:42:51,409 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:51,409 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 14:42:51,409 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 14:42:51,409 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration3_Loop [2023-02-14 14:42:51,409 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 14:42:51,409 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 14:42:51,411 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:51,413 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:51,415 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:51,417 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:51,419 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:51,420 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:51,422 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:51,699 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 14:42:51,699 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-14 14:42:51,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:51,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:51,701 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) [2023-02-14 14:42:51,710 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 [2023-02-14 14:42:51,715 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 [2023-02-14 14:42:51,718 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:51,718 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:51,719 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:51,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:51,719 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:42:51,719 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 14:42:51,720 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:51,749 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:51,753 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 [2023-02-14 14:42:51,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:51,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:51,755 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-14 14:42:51,765 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-14 14:42:51,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-02-14 14:42:51,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:51,772 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:51,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:51,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:51,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:42:51,773 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 14:42:51,773 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:51,775 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:51,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2023-02-14 14:42:51,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:51,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:51,781 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-14 14:42:51,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-02-14 14:42:51,789 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 [2023-02-14 14:42:51,797 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:51,797 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:51,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:51,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:51,797 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:42:51,798 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 14:42:51,798 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:51,815 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:51,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2023-02-14 14:42:51,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:51,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:51,824 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) [2023-02-14 14:42:51,829 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 [2023-02-14 14:42:51,836 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 [2023-02-14 14:42:51,845 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:51,845 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:51,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:51,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:51,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:42:51,846 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 14:42:51,846 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:51,858 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:51,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-02-14 14:42:51,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:51,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:51,865 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) [2023-02-14 14:42:51,872 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-14 14:42:51,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:51,880 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:51,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:51,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:51,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:42:51,881 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 14:42:51,881 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:51,885 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 [2023-02-14 14:42:51,889 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:51,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2023-02-14 14:42:51,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:51,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:51,899 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) [2023-02-14 14:42:51,910 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 [2023-02-14 14:42:51,918 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:51,919 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:51,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:51,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:51,919 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:42:51,920 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 14:42:51,920 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:51,921 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 [2023-02-14 14:42:51,929 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:51,936 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 [2023-02-14 14:42:51,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:51,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:51,938 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) [2023-02-14 14:42:51,947 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 [2023-02-14 14:42:51,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:51,956 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:51,956 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:51,956 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:51,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:42:51,957 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 [2023-02-14 14:42:51,965 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 14:42:51,965 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:51,980 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:51,987 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 [2023-02-14 14:42:51,988 INFO L490 LassoAnalysis]: Using template '2-nested'. [2023-02-14 14:42:51,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:51,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:51,989 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) [2023-02-14 14:42:51,992 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 [2023-02-14 14:42:51,994 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 [2023-02-14 14:42:52,001 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:52,002 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:52,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:52,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:52,002 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-02-14 14:42:52,004 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2023-02-14 14:42:52,004 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:52,027 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:52,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2023-02-14 14:42:52,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:52,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:52,041 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) [2023-02-14 14:42:52,046 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 [2023-02-14 14:42:52,046 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 [2023-02-14 14:42:52,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:52,052 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:52,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:52,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:52,053 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-02-14 14:42:52,054 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2023-02-14 14:42:52,054 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:52,060 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:52,067 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 [2023-02-14 14:42:52,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:52,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:52,069 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) [2023-02-14 14:42:52,071 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 [2023-02-14 14:42:52,072 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 [2023-02-14 14:42:52,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:52,079 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:52,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:52,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:52,079 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-02-14 14:42:52,080 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2023-02-14 14:42:52,080 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:52,084 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:52,087 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 [2023-02-14 14:42:52,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:52,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:52,097 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) [2023-02-14 14:42:52,098 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 [2023-02-14 14:42:52,101 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 [2023-02-14 14:42:52,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:52,106 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:52,106 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:52,106 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:52,106 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-02-14 14:42:52,107 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2023-02-14 14:42:52,107 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:52,121 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:52,128 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 [2023-02-14 14:42:52,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:52,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:52,130 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) [2023-02-14 14:42:52,137 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 [2023-02-14 14:42:52,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:52,145 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:52,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:52,146 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:52,146 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-02-14 14:42:52,146 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2023-02-14 14:42:52,146 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:52,148 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 [2023-02-14 14:42:52,159 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:52,166 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 [2023-02-14 14:42:52,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:52,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:52,167 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) [2023-02-14 14:42:52,170 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 [2023-02-14 14:42:52,171 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 [2023-02-14 14:42:52,178 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:52,178 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:52,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:52,179 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:52,179 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-02-14 14:42:52,179 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2023-02-14 14:42:52,179 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:52,193 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:52,199 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 [2023-02-14 14:42:52,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:52,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:52,201 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) [2023-02-14 14:42:52,205 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 [2023-02-14 14:42:52,206 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-14 14:42:52,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:52,215 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:52,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:52,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:52,216 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-02-14 14:42:52,220 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2023-02-14 14:42:52,220 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:52,249 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:52,253 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 [2023-02-14 14:42:52,253 INFO L490 LassoAnalysis]: Using template '3-nested'. [2023-02-14 14:42:52,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:52,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:52,255 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) [2023-02-14 14:42:52,261 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 [2023-02-14 14:42:52,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:52,269 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:52,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:52,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:52,269 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-14 14:42:52,270 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-14 14:42:52,271 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:52,272 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 [2023-02-14 14:42:52,283 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:52,289 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 [2023-02-14 14:42:52,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:52,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:52,291 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) [2023-02-14 14:42:52,297 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 [2023-02-14 14:42:52,305 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:52,306 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:52,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:52,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:52,306 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-14 14:42:52,307 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-14 14:42:52,307 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:52,309 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 [2023-02-14 14:42:52,316 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:52,324 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 [2023-02-14 14:42:52,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:52,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:52,326 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) [2023-02-14 14:42:52,329 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 [2023-02-14 14:42:52,330 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 [2023-02-14 14:42:52,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:52,339 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:52,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:52,339 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:52,339 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-14 14:42:52,341 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-14 14:42:52,341 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:52,344 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:52,347 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 [2023-02-14 14:42:52,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:52,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:52,349 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) [2023-02-14 14:42:52,352 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 [2023-02-14 14:42:52,354 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 [2023-02-14 14:42:52,361 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:52,361 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:52,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:52,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:52,361 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-14 14:42:52,362 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-14 14:42:52,362 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:52,373 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:52,375 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 [2023-02-14 14:42:52,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:52,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:52,377 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) [2023-02-14 14:42:52,381 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 [2023-02-14 14:42:52,381 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 [2023-02-14 14:42:52,387 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:52,387 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:52,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:52,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:52,388 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-14 14:42:52,388 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-14 14:42:52,389 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:52,390 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:52,393 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 [2023-02-14 14:42:52,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:52,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:52,394 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) [2023-02-14 14:42:52,396 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 [2023-02-14 14:42:52,397 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-14 14:42:52,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:52,404 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:52,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:52,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:52,404 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-14 14:42:52,405 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-14 14:42:52,405 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:52,406 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:52,409 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 [2023-02-14 14:42:52,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:52,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:52,410 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-14 14:42:52,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2023-02-14 14:42:52,414 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-14 14:42:52,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:52,421 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:52,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:52,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:52,421 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-14 14:42:52,429 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-14 14:42:52,429 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:52,443 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:52,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2023-02-14 14:42:52,447 INFO L490 LassoAnalysis]: Using template '4-nested'. [2023-02-14 14:42:52,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:52,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:52,449 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-14 14:42:52,453 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 [2023-02-14 14:42:52,460 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:52,461 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:52,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:52,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:52,461 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2023-02-14 14:42:52,462 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2023-02-14 14:42:52,462 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:52,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2023-02-14 14:42:52,466 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:52,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2023-02-14 14:42:52,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:52,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:52,473 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) [2023-02-14 14:42:52,474 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 [2023-02-14 14:42:52,476 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 [2023-02-14 14:42:52,484 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:52,484 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:52,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:52,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:52,485 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2023-02-14 14:42:52,486 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2023-02-14 14:42:52,486 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:52,496 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:52,501 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 [2023-02-14 14:42:52,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:52,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:52,502 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) [2023-02-14 14:42:52,510 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 [2023-02-14 14:42:52,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:52,518 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:52,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:52,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:52,519 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2023-02-14 14:42:52,520 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2023-02-14 14:42:52,521 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:52,523 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 [2023-02-14 14:42:52,529 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:52,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2023-02-14 14:42:52,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:52,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:52,535 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) [2023-02-14 14:42:52,549 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 [2023-02-14 14:42:52,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:52,558 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:52,558 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:52,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:52,558 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2023-02-14 14:42:52,559 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2023-02-14 14:42:52,559 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:52,562 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 [2023-02-14 14:42:52,573 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:52,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2023-02-14 14:42:52,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:52,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:52,578 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) [2023-02-14 14:42:52,585 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 [2023-02-14 14:42:52,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:52,593 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:52,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:52,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:52,593 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2023-02-14 14:42:52,595 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2023-02-14 14:42:52,595 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:52,596 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 [2023-02-14 14:42:52,609 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:52,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2023-02-14 14:42:52,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:52,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:52,614 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) [2023-02-14 14:42:52,618 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 [2023-02-14 14:42:52,620 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 [2023-02-14 14:42:52,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:52,625 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:52,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:52,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:52,625 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2023-02-14 14:42:52,626 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2023-02-14 14:42:52,626 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:52,627 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:52,633 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 [2023-02-14 14:42:52,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:52,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:52,635 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) [2023-02-14 14:42:52,637 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 [2023-02-14 14:42:52,638 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 [2023-02-14 14:42:52,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:52,647 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:52,647 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:52,647 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:52,647 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2023-02-14 14:42:52,654 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2023-02-14 14:42:52,654 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:52,673 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:52,677 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 [2023-02-14 14:42:52,677 INFO L490 LassoAnalysis]: Using template '2-phase'. [2023-02-14 14:42:52,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:52,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:52,679 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) [2023-02-14 14:42:52,682 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 [2023-02-14 14:42:52,682 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 [2023-02-14 14:42:52,688 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 14:42:52,688 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2023-02-14 14:42:52,689 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:52,689 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:52,689 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:52,689 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-02-14 14:42:52,689 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2023-02-14 14:42:52,689 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:52,691 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:52,694 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 [2023-02-14 14:42:52,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:52,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:52,696 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) [2023-02-14 14:42:52,697 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 [2023-02-14 14:42:52,699 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 [2023-02-14 14:42:52,707 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 14:42:52,707 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2023-02-14 14:42:52,707 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:52,707 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:52,707 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:52,707 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-02-14 14:42:52,708 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2023-02-14 14:42:52,708 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:52,720 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:52,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2023-02-14 14:42:52,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:52,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:52,726 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) [2023-02-14 14:42:52,728 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 [2023-02-14 14:42:52,729 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 [2023-02-14 14:42:52,736 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 14:42:52,736 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2023-02-14 14:42:52,736 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:52,736 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:52,736 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:52,736 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-02-14 14:42:52,737 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2023-02-14 14:42:52,737 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:52,751 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:52,761 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 [2023-02-14 14:42:52,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:52,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:52,763 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) [2023-02-14 14:42:52,774 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 [2023-02-14 14:42:52,782 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 14:42:52,782 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2023-02-14 14:42:52,782 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:52,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:52,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:52,782 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-02-14 14:42:52,783 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2023-02-14 14:42:52,783 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:52,786 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 [2023-02-14 14:42:52,801 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:52,805 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 [2023-02-14 14:42:52,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:52,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:52,807 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) [2023-02-14 14:42:52,810 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 [2023-02-14 14:42:52,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 [2023-02-14 14:42:52,817 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 14:42:52,817 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2023-02-14 14:42:52,817 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:52,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:52,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:52,817 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-02-14 14:42:52,818 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2023-02-14 14:42:52,818 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:52,833 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:52,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2023-02-14 14:42:52,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:52,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:52,839 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) [2023-02-14 14:42:52,845 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 [2023-02-14 14:42:52,853 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 14:42:52,853 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2023-02-14 14:42:52,853 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:52,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:52,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:52,854 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-02-14 14:42:52,854 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2023-02-14 14:42:52,855 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:52,857 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 [2023-02-14 14:42:52,873 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:52,877 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 [2023-02-14 14:42:52,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:52,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:52,879 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) [2023-02-14 14:42:52,884 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 [2023-02-14 14:42:52,921 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 [2023-02-14 14:42:52,929 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 14:42:52,929 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2023-02-14 14:42:52,929 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:52,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:52,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:52,929 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-02-14 14:42:52,934 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2023-02-14 14:42:52,934 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:52,945 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:52,950 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 [2023-02-14 14:42:52,950 INFO L490 LassoAnalysis]: Using template '3-phase'. [2023-02-14 14:42:52,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:52,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:52,951 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) [2023-02-14 14:42:52,961 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 [2023-02-14 14:42:52,969 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 14:42:52,970 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2023-02-14 14:42:52,970 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:52,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:52,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:52,970 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-14 14:42:52,971 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-14 14:42:52,971 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:52,975 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 [2023-02-14 14:42:52,984 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:52,991 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 [2023-02-14 14:42:52,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:52,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:52,994 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) [2023-02-14 14:42:53,014 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 [2023-02-14 14:42:53,022 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 14:42:53,022 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2023-02-14 14:42:53,023 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:53,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:53,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:53,023 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-14 14:42:53,025 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-14 14:42:53,025 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:53,028 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 [2023-02-14 14:42:53,036 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:53,041 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 [2023-02-14 14:42:53,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:53,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:53,043 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) [2023-02-14 14:42:53,049 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 [2023-02-14 14:42:53,057 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 14:42:53,057 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2023-02-14 14:42:53,057 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:53,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:53,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:53,058 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-14 14:42:53,059 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-14 14:42:53,059 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:53,064 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 [2023-02-14 14:42:53,073 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:53,077 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 [2023-02-14 14:42:53,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:53,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:53,079 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) [2023-02-14 14:42:53,081 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 [2023-02-14 14:42:53,083 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 [2023-02-14 14:42:53,091 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 14:42:53,091 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2023-02-14 14:42:53,091 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:53,091 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:53,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:53,092 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-14 14:42:53,093 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-14 14:42:53,093 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:53,113 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:53,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2023-02-14 14:42:53,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:53,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:53,118 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) [2023-02-14 14:42:53,125 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 [2023-02-14 14:42:53,133 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 14:42:53,134 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2023-02-14 14:42:53,134 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:53,134 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:53,134 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:53,134 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-14 14:42:53,135 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-14 14:42:53,135 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:53,136 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 [2023-02-14 14:42:53,149 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:53,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2023-02-14 14:42:53,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:53,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:53,155 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) [2023-02-14 14:42:53,161 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 [2023-02-14 14:42:53,167 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 [2023-02-14 14:42:53,169 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 14:42:53,169 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2023-02-14 14:42:53,170 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:53,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:53,170 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:53,170 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-14 14:42:53,171 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-14 14:42:53,171 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:53,174 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:53,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2023-02-14 14:42:53,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:53,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:53,178 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) [2023-02-14 14:42:53,179 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 [2023-02-14 14:42:53,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 [2023-02-14 14:42:53,189 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 14:42:53,189 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2023-02-14 14:42:53,189 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:53,189 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:53,189 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:53,189 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-14 14:42:53,199 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-14 14:42:53,199 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:53,219 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:53,224 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 [2023-02-14 14:42:53,224 INFO L490 LassoAnalysis]: Using template '4-phase'. [2023-02-14 14:42:53,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:53,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:53,226 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) [2023-02-14 14:42:53,229 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 [2023-02-14 14:42:53,229 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 [2023-02-14 14:42:53,238 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 14:42:53,238 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2023-02-14 14:42:53,238 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:53,238 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:53,238 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:53,238 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2023-02-14 14:42:53,240 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2023-02-14 14:42:53,240 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:53,257 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:53,260 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 [2023-02-14 14:42:53,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:53,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:53,262 INFO L229 MonitoredProcess]: Starting monitored process 57 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) [2023-02-14 14:42:53,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2023-02-14 14:42:53,266 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-14 14:42:53,274 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 14:42:53,275 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2023-02-14 14:42:53,275 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:53,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:53,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:53,275 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2023-02-14 14:42:53,276 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2023-02-14 14:42:53,276 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:53,293 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:53,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2023-02-14 14:42:53,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:53,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:53,300 INFO L229 MonitoredProcess]: Starting monitored process 58 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) [2023-02-14 14:42:53,305 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 [2023-02-14 14:42:53,314 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 14:42:53,314 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2023-02-14 14:42:53,314 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:53,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:53,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:53,314 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2023-02-14 14:42:53,316 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2023-02-14 14:42:53,316 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:53,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2023-02-14 14:42:53,337 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:53,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2023-02-14 14:42:53,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:53,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:53,343 INFO L229 MonitoredProcess]: Starting monitored process 59 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) [2023-02-14 14:42:53,349 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 [2023-02-14 14:42:53,358 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 14:42:53,358 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2023-02-14 14:42:53,358 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:53,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:53,358 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:53,358 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2023-02-14 14:42:53,360 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2023-02-14 14:42:53,360 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:53,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2023-02-14 14:42:53,374 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:53,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2023-02-14 14:42:53,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:53,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:53,380 INFO L229 MonitoredProcess]: Starting monitored process 60 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) [2023-02-14 14:42:53,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2023-02-14 14:42:53,384 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-14 14:42:53,392 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 14:42:53,393 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2023-02-14 14:42:53,393 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:53,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:53,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:53,393 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2023-02-14 14:42:53,394 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2023-02-14 14:42:53,394 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:53,410 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:53,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2023-02-14 14:42:53,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:53,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:53,420 INFO L229 MonitoredProcess]: Starting monitored process 61 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) [2023-02-14 14:42:53,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2023-02-14 14:42:53,423 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 [2023-02-14 14:42:53,432 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 14:42:53,432 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2023-02-14 14:42:53,432 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:53,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:53,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:53,432 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2023-02-14 14:42:53,434 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2023-02-14 14:42:53,434 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:53,448 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:53,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2023-02-14 14:42:53,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:53,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:53,454 INFO L229 MonitoredProcess]: Starting monitored process 62 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) [2023-02-14 14:42:53,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2023-02-14 14:42:53,459 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 [2023-02-14 14:42:53,470 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 14:42:53,470 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2023-02-14 14:42:53,470 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:53,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:53,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:53,471 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2023-02-14 14:42:53,479 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2023-02-14 14:42:53,479 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:53,509 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:53,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2023-02-14 14:42:53,514 INFO L490 LassoAnalysis]: Using template '2-lex'. [2023-02-14 14:42:53,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:53,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:53,516 INFO L229 MonitoredProcess]: Starting monitored process 63 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) [2023-02-14 14:42:53,537 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 [2023-02-14 14:42:53,546 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 14:42:53,546 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2023-02-14 14:42:53,546 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:53,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:53,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:53,547 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-14 14:42:53,548 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-14 14:42:53,548 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:53,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2023-02-14 14:42:53,551 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:53,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2023-02-14 14:42:53,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:53,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:53,556 INFO L229 MonitoredProcess]: Starting monitored process 64 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) [2023-02-14 14:42:53,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2023-02-14 14:42:53,571 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-14 14:42:53,578 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 14:42:53,578 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2023-02-14 14:42:53,578 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:53,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:53,579 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:53,579 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-14 14:42:53,579 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-14 14:42:53,579 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:53,581 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:53,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2023-02-14 14:42:53,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:53,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:53,585 INFO L229 MonitoredProcess]: Starting monitored process 65 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) [2023-02-14 14:42:53,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2023-02-14 14:42:53,590 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 [2023-02-14 14:42:53,596 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 14:42:53,597 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2023-02-14 14:42:53,597 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:53,597 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:53,597 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:53,597 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-14 14:42:53,603 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-14 14:42:53,603 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:53,606 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:53,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2023-02-14 14:42:53,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:53,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:53,610 INFO L229 MonitoredProcess]: Starting monitored process 66 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) [2023-02-14 14:42:53,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2023-02-14 14:42:53,614 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 [2023-02-14 14:42:53,620 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 14:42:53,620 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2023-02-14 14:42:53,620 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:53,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:53,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:53,621 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-14 14:42:53,621 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-14 14:42:53,621 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:53,657 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:53,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2023-02-14 14:42:53,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:53,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:53,662 INFO L229 MonitoredProcess]: Starting monitored process 67 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) [2023-02-14 14:42:53,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2023-02-14 14:42:53,666 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 [2023-02-14 14:42:53,673 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 14:42:53,673 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2023-02-14 14:42:53,673 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:53,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:53,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:53,674 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-14 14:42:53,674 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-14 14:42:53,675 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:53,689 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:53,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2023-02-14 14:42:53,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:53,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:53,694 INFO L229 MonitoredProcess]: Starting monitored process 68 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) [2023-02-14 14:42:53,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2023-02-14 14:42:53,698 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 [2023-02-14 14:42:53,706 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 14:42:53,706 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2023-02-14 14:42:53,706 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:53,706 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:53,706 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:53,706 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-14 14:42:53,707 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-14 14:42:53,707 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:53,729 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:53,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2023-02-14 14:42:53,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:53,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:53,734 INFO L229 MonitoredProcess]: Starting monitored process 69 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) [2023-02-14 14:42:53,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2023-02-14 14:42:53,737 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 [2023-02-14 14:42:53,744 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 14:42:53,744 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2023-02-14 14:42:53,744 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:53,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:53,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:53,744 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-14 14:42:53,749 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-14 14:42:53,750 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:53,769 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:53,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2023-02-14 14:42:53,774 INFO L490 LassoAnalysis]: Using template '3-lex'. [2023-02-14 14:42:53,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:53,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:53,776 INFO L229 MonitoredProcess]: Starting monitored process 70 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) [2023-02-14 14:42:53,781 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 [2023-02-14 14:42:53,789 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 14:42:53,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2023-02-14 14:42:53,789 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2023-02-14 14:42:53,789 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:53,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:53,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:53,790 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2023-02-14 14:42:53,791 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-14 14:42:53,791 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:53,802 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:53,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2023-02-14 14:42:53,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:53,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:53,807 INFO L229 MonitoredProcess]: Starting monitored process 71 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) [2023-02-14 14:42:53,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2023-02-14 14:42:53,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 [2023-02-14 14:42:53,816 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 14:42:53,816 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2023-02-14 14:42:53,817 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:53,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:53,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:53,817 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2023-02-14 14:42:53,818 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-14 14:42:53,818 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:53,824 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:53,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2023-02-14 14:42:53,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:53,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:53,829 INFO L229 MonitoredProcess]: Starting monitored process 72 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) [2023-02-14 14:42:53,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2023-02-14 14:42:53,832 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 [2023-02-14 14:42:53,839 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 14:42:53,839 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2023-02-14 14:42:53,839 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:53,839 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:53,839 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:53,839 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2023-02-14 14:42:53,840 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-14 14:42:53,840 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:53,843 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:53,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2023-02-14 14:42:53,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:53,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:53,847 INFO L229 MonitoredProcess]: Starting monitored process 73 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) [2023-02-14 14:42:53,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2023-02-14 14:42:53,853 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 [2023-02-14 14:42:53,864 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 14:42:53,864 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2023-02-14 14:42:53,865 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:53,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:53,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:53,865 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2023-02-14 14:42:53,866 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-14 14:42:53,866 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:53,879 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:53,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2023-02-14 14:42:53,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:53,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:53,885 INFO L229 MonitoredProcess]: Starting monitored process 74 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) [2023-02-14 14:42:53,893 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 [2023-02-14 14:42:53,901 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 14:42:53,901 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2023-02-14 14:42:53,901 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:53,901 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:53,901 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:53,902 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2023-02-14 14:42:53,903 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-14 14:42:53,903 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:53,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2023-02-14 14:42:53,911 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:53,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2023-02-14 14:42:53,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:53,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:53,915 INFO L229 MonitoredProcess]: Starting monitored process 75 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) [2023-02-14 14:42:53,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2023-02-14 14:42:53,918 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 [2023-02-14 14:42:53,925 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 14:42:53,925 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2023-02-14 14:42:53,925 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:53,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:53,925 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:53,925 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2023-02-14 14:42:53,926 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-14 14:42:53,926 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:53,953 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:53,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2023-02-14 14:42:53,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:53,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:53,958 INFO L229 MonitoredProcess]: Starting monitored process 76 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) [2023-02-14 14:42:53,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2023-02-14 14:42:53,962 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 [2023-02-14 14:42:53,971 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 14:42:53,971 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2023-02-14 14:42:53,971 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:53,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:53,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:53,972 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2023-02-14 14:42:53,979 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-14 14:42:53,980 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:53,998 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:54,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2023-02-14 14:42:54,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 14:42:54,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 14:42:54,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-14 14:42:54,002 INFO L87 Difference]: Start difference. First operand 28 states and 42 transitions. cyclomatic complexity: 16 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-14 14:42:54,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:42:54,039 INFO L93 Difference]: Finished difference Result 35 states and 55 transitions. [2023-02-14 14:42:54,039 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 55 transitions. [2023-02-14 14:42:54,041 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 26 [2023-02-14 14:42:54,042 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 55 transitions. [2023-02-14 14:42:54,042 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2023-02-14 14:42:54,043 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2023-02-14 14:42:54,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 55 transitions. [2023-02-14 14:42:54,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-14 14:42:54,044 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 55 transitions. [2023-02-14 14:42:54,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 55 transitions. [2023-02-14 14:42:54,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2023-02-14 14:42:54,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 7 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2023-02-14 14:42:54,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2023-02-14 14:42:54,049 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 43 transitions. [2023-02-14 14:42:54,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 14:42:54,050 INFO L428 stractBuchiCegarLoop]: Abstraction has 29 states and 43 transitions. [2023-02-14 14:42:54,050 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-02-14 14:42:54,050 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 43 transitions. [2023-02-14 14:42:54,051 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2023-02-14 14:42:54,051 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 14:42:54,051 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 14:42:54,052 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-02-14 14:42:54,052 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:42:54,052 INFO L748 eck$LassoCheckResult]: Stem: 548#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 534#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 535#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 542#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 538#L41-3 [2023-02-14 14:42:54,057 INFO L750 eck$LassoCheckResult]: Loop: 538#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 539#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 544#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 530#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 523#$Ultimate##0 ~n := #in~n; 546#L25 assume !(~n <= 0); 527#L26 call #t~ret0 := fact(~n - 1);< 523#$Ultimate##0 ~n := #in~n; 546#L25 assume ~n <= 0;#res := 1; 533#factFINAL assume true; 525#factEXIT >#66#return; 531#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 545#factFINAL assume true; 550#factEXIT >#68#return; 528#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 523#$Ultimate##0 ~n := #in~n; 546#L25 assume !(~n <= 0); 527#L26 call #t~ret0 := fact(~n - 1);< 523#$Ultimate##0 ~n := #in~n; 546#L25 assume ~n <= 0;#res := 1; 533#factFINAL assume true; 525#factEXIT >#66#return; 531#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 545#factFINAL assume true; 550#factEXIT >#70#return; 524#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 523#$Ultimate##0 ~n := #in~n; 546#L25 assume !(~n <= 0); 527#L26 call #t~ret0 := fact(~n - 1);< 523#$Ultimate##0 ~n := #in~n; 546#L25 assume ~n <= 0;#res := 1; 533#factFINAL assume true; 525#factEXIT >#66#return; 531#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 545#factFINAL assume true; 550#factEXIT >#72#return; 532#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 540#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 543#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 547#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 541#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 538#L41-3 [2023-02-14 14:42:54,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:42:54,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 4 times [2023-02-14 14:42:54,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:42:54,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381940717] [2023-02-14 14:42:54,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:42:54,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:42:54,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:42:54,064 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:42:54,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:42:54,066 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:42:54,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:42:54,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1909923709, now seen corresponding path program 1 times [2023-02-14 14:42:54,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:42:54,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669026678] [2023-02-14 14:42:54,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:42:54,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:42:54,075 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 14:42:54,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1737285758] [2023-02-14 14:42:54,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:42:54,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 14:42:54,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:54,077 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 14:42:54,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2023-02-14 14:42:54,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:42:54,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-14 14:42:54,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:42:54,165 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 47 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-02-14 14:42:54,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 14:42:54,251 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2023-02-14 14:42:54,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:42:54,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669026678] [2023-02-14 14:42:54,252 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 14:42:54,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737285758] [2023-02-14 14:42:54,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737285758] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 14:42:54,253 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 14:42:54,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2023-02-14 14:42:54,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381425689] [2023-02-14 14:42:54,253 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 14:42:54,254 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-14 14:42:54,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 14:42:54,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 14:42:54,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-14 14:42:54,255 INFO L87 Difference]: Start difference. First operand 29 states and 43 transitions. cyclomatic complexity: 16 Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-02-14 14:42:54,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:42:54,400 INFO L93 Difference]: Finished difference Result 41 states and 62 transitions. [2023-02-14 14:42:54,400 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 62 transitions. [2023-02-14 14:42:54,403 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2023-02-14 14:42:54,408 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 62 transitions. [2023-02-14 14:42:54,408 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2023-02-14 14:42:54,410 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2023-02-14 14:42:54,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 62 transitions. [2023-02-14 14:42:54,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-14 14:42:54,415 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 62 transitions. [2023-02-14 14:42:54,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 62 transitions. [2023-02-14 14:42:54,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 31. [2023-02-14 14:42:54,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (16), 8 states have call predecessors, (16), 9 states have call successors, (16) [2023-02-14 14:42:54,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 48 transitions. [2023-02-14 14:42:54,428 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 48 transitions. [2023-02-14 14:42:54,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 14:42:54,429 INFO L428 stractBuchiCegarLoop]: Abstraction has 31 states and 48 transitions. [2023-02-14 14:42:54,430 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-02-14 14:42:54,430 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 48 transitions. [2023-02-14 14:42:54,431 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2023-02-14 14:42:54,432 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 14:42:54,432 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 14:42:54,433 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-02-14 14:42:54,434 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:42:54,435 INFO L748 eck$LassoCheckResult]: Stem: 875#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 860#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 861#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 868#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 864#L41-3 [2023-02-14 14:42:54,435 INFO L750 eck$LassoCheckResult]: Loop: 864#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 865#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 870#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 855#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 847#$Ultimate##0 ~n := #in~n; 874#L25 assume ~n <= 0;#res := 1; 859#factFINAL assume true; 849#factEXIT >#68#return; 851#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 847#$Ultimate##0 ~n := #in~n; 874#L25 assume ~n <= 0;#res := 1; 859#factFINAL assume true; 849#factEXIT >#70#return; 848#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 847#$Ultimate##0 ~n := #in~n; 874#L25 assume ~n <= 0;#res := 1; 859#factFINAL assume true; 849#factEXIT >#72#return; 858#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 866#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 869#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 872#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 867#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 864#L41-3 [2023-02-14 14:42:54,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:42:54,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 5 times [2023-02-14 14:42:54,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:42:54,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625547828] [2023-02-14 14:42:54,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:42:54,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:42:54,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:42:54,448 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:42:54,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:42:54,455 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:42:54,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:42:54,456 INFO L85 PathProgramCache]: Analyzing trace with hash -743603515, now seen corresponding path program 1 times [2023-02-14 14:42:54,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:42:54,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851754998] [2023-02-14 14:42:54,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:42:54,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:42:54,468 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 14:42:54,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2013679318] [2023-02-14 14:42:54,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:42:54,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 14:42:54,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:54,480 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 14:42:54,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2023-02-14 14:42:54,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:42:54,522 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:42:54,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:42:54,536 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:42:54,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:42:54,537 INFO L85 PathProgramCache]: Analyzing trace with hash 343305470, now seen corresponding path program 1 times [2023-02-14 14:42:54,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:42:54,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44364806] [2023-02-14 14:42:54,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:42:54,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:42:54,544 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 14:42:54,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [935643086] [2023-02-14 14:42:54,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:42:54,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 14:42:54,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:54,548 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 14:42:54,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2023-02-14 14:42:54,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:42:54,581 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:42:54,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:42:54,597 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:42:54,860 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 14:42:54,861 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 14:42:54,861 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 14:42:54,861 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 14:42:54,861 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-14 14:42:54,861 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:54,861 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 14:42:54,861 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 14:42:54,861 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration5_Loop [2023-02-14 14:42:54,862 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 14:42:54,862 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 14:42:54,863 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:54,867 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:54,884 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:54,886 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:54,887 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:54,889 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:54,891 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:54,892 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:54,974 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 14:42:54,975 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-14 14:42:54,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:54,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:54,989 INFO L229 MonitoredProcess]: Starting monitored process 80 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) [2023-02-14 14:42:54,994 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 14:42:54,994 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 14:42:55,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2023-02-14 14:42:55,017 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 14:42:55,017 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret9#1=0} Honda state: {ULTIMATE.start_main_#t~ret9#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-14 14:42:55,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2023-02-14 14:42:55,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:55,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:55,021 INFO L229 MonitoredProcess]: Starting monitored process 81 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) [2023-02-14 14:42:55,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2023-02-14 14:42:55,025 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 14:42:55,025 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 14:42:55,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Forceful destruction successful, exit code 0 [2023-02-14 14:42:55,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:55,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:55,038 INFO L229 MonitoredProcess]: Starting monitored process 82 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) [2023-02-14 14:42:55,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2023-02-14 14:42:55,041 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-14 14:42:55,041 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 14:42:55,487 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-14 14:42:55,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2023-02-14 14:42:55,492 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 14:42:55,492 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 14:42:55,492 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 14:42:55,493 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 14:42:55,493 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-14 14:42:55,493 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:55,493 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 14:42:55,493 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 14:42:55,493 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration5_Loop [2023-02-14 14:42:55,493 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 14:42:55,493 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 14:42:55,494 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:55,496 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:55,530 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:55,532 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:55,535 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:55,538 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:55,539 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:55,541 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:42:55,625 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 14:42:55,625 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-14 14:42:55,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:55,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:55,627 INFO L229 MonitoredProcess]: Starting monitored process 83 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) [2023-02-14 14:42:55,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2023-02-14 14:42:55,630 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 [2023-02-14 14:42:55,636 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:55,636 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:55,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:55,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:55,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:42:55,636 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 14:42:55,636 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:55,637 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:42:55,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Forceful destruction successful, exit code 0 [2023-02-14 14:42:55,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:55,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:55,642 INFO L229 MonitoredProcess]: Starting monitored process 84 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) [2023-02-14 14:42:55,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2023-02-14 14:42:55,645 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 [2023-02-14 14:42:55,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:42:55,651 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:42:55,651 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:42:55,651 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:42:55,651 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:42:55,653 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 14:42:55,653 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:42:55,656 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-14 14:42:55,682 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-14 14:42:55,683 INFO L444 ModelExtractionUtils]: 6 out of 9 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-14 14:42:55,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:42:55,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:55,697 INFO L229 MonitoredProcess]: Starting monitored process 85 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) [2023-02-14 14:42:55,709 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-14 14:42:55,709 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-14 14:42:55,710 INFO L513 LassoAnalysis]: Proved termination. [2023-02-14 14:42:55,710 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1) = -2*ULTIMATE.start_main_~n~0#1 + 1 Supporting invariants [] [2023-02-14 14:42:55,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2023-02-14 14:42:55,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Forceful destruction successful, exit code 0 [2023-02-14 14:42:55,715 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-14 14:42:55,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:42:55,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:42:55,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-14 14:42:55,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:42:55,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:42:55,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-14 14:42:55,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:42:55,912 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-14 14:42:55,913 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2023-02-14 14:42:55,913 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 48 transitions. cyclomatic complexity: 19 Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-14 14:42:56,171 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 48 transitions. cyclomatic complexity: 19. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Result 123 states and 190 transitions. Complement of second has 26 states. [2023-02-14 14:42:56,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2023-02-14 14:42:56,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-14 14:42:56,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 71 transitions. [2023-02-14 14:42:56,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 71 transitions. Stem has 4 letters. Loop has 23 letters. [2023-02-14 14:42:56,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 14:42:56,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 71 transitions. Stem has 27 letters. Loop has 23 letters. [2023-02-14 14:42:56,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 14:42:56,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 71 transitions. Stem has 4 letters. Loop has 46 letters. [2023-02-14 14:42:56,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 14:42:56,175 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 190 transitions. [2023-02-14 14:42:56,178 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 35 [2023-02-14 14:42:56,181 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 122 states and 189 transitions. [2023-02-14 14:42:56,181 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2023-02-14 14:42:56,181 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2023-02-14 14:42:56,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 189 transitions. [2023-02-14 14:42:56,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 14:42:56,182 INFO L218 hiAutomatonCegarLoop]: Abstraction has 122 states and 189 transitions. [2023-02-14 14:42:56,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 189 transitions. [2023-02-14 14:42:56,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 117. [2023-02-14 14:42:56,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 71 states have (on average 1.2112676056338028) internal successors, (86), 76 states have internal predecessors, (86), 36 states have call successors, (36), 6 states have call predecessors, (36), 10 states have return successors, (58), 34 states have call predecessors, (58), 36 states have call successors, (58) [2023-02-14 14:42:56,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 180 transitions. [2023-02-14 14:42:56,199 INFO L240 hiAutomatonCegarLoop]: Abstraction has 117 states and 180 transitions. [2023-02-14 14:42:56,199 INFO L428 stractBuchiCegarLoop]: Abstraction has 117 states and 180 transitions. [2023-02-14 14:42:56,199 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-02-14 14:42:56,199 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 180 transitions. [2023-02-14 14:42:56,201 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 35 [2023-02-14 14:42:56,201 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 14:42:56,201 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 14:42:56,202 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-02-14 14:42:56,202 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:42:56,203 INFO L748 eck$LassoCheckResult]: Stem: 1203#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 1164#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1165#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 1182#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 1204#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1173#L42-3 [2023-02-14 14:42:56,203 INFO L750 eck$LassoCheckResult]: Loop: 1173#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1191#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1215#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1222#$Ultimate##0 ~n := #in~n; 1228#L25 assume !(~n <= 0); 1138#L26 call #t~ret0 := fact(~n - 1);< 1170#$Ultimate##0 ~n := #in~n; 1189#L25 assume ~n <= 0;#res := 1; 1154#factFINAL assume true; 1137#factEXIT >#66#return; 1141#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1225#factFINAL assume true; 1213#factEXIT >#68#return; 1218#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1222#$Ultimate##0 ~n := #in~n; 1228#L25 assume ~n <= 0;#res := 1; 1226#factFINAL assume true; 1223#factEXIT >#70#return; 1217#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1222#$Ultimate##0 ~n := #in~n; 1228#L25 assume ~n <= 0;#res := 1; 1226#factFINAL assume true; 1223#factEXIT >#72#return; 1212#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1210#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1208#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1206#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 1180#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 1172#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1173#L42-3 [2023-02-14 14:42:56,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:42:56,203 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 1 times [2023-02-14 14:42:56,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:42:56,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688291552] [2023-02-14 14:42:56,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:42:56,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:42:56,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:42:56,216 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:42:56,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:42:56,223 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:42:56,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:42:56,224 INFO L85 PathProgramCache]: Analyzing trace with hash -304298247, now seen corresponding path program 2 times [2023-02-14 14:42:56,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:42:56,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840367630] [2023-02-14 14:42:56,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:42:56,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:42:56,229 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 14:42:56,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1904551391] [2023-02-14 14:42:56,232 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 14:42:56,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 14:42:56,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:56,237 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 14:42:56,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Waiting until timeout for monitored process [2023-02-14 14:42:56,273 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 14:42:56,273 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 14:42:56,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-14 14:42:56,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:42:56,349 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-14 14:42:56,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 14:42:56,484 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-14 14:42:56,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:42:56,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840367630] [2023-02-14 14:42:56,485 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 14:42:56,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904551391] [2023-02-14 14:42:56,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904551391] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 14:42:56,485 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 14:42:56,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2023-02-14 14:42:56,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380281889] [2023-02-14 14:42:56,486 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 14:42:56,486 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-14 14:42:56,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 14:42:56,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-14 14:42:56,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-02-14 14:42:56,487 INFO L87 Difference]: Start difference. First operand 117 states and 180 transitions. cyclomatic complexity: 68 Second operand has 11 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-14 14:42:56,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:42:56,777 INFO L93 Difference]: Finished difference Result 249 states and 362 transitions. [2023-02-14 14:42:56,777 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 249 states and 362 transitions. [2023-02-14 14:42:56,780 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 87 [2023-02-14 14:42:56,785 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 249 states to 249 states and 362 transitions. [2023-02-14 14:42:56,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0 [2023-02-14 14:42:56,785 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 122 [2023-02-14 14:42:56,786 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2023-02-14 14:42:56,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 249 states and 362 transitions. [2023-02-14 14:42:56,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 14:42:56,786 INFO L218 hiAutomatonCegarLoop]: Abstraction has 249 states and 362 transitions. [2023-02-14 14:42:56,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states and 362 transitions. [2023-02-14 14:42:56,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 131. [2023-02-14 14:42:56,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 80 states have internal predecessors, (94), 42 states have call successors, (42), 10 states have call predecessors, (42), 10 states have return successors, (66), 40 states have call predecessors, (66), 42 states have call successors, (66) [2023-02-14 14:42:56,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 202 transitions. [2023-02-14 14:42:56,801 INFO L240 hiAutomatonCegarLoop]: Abstraction has 131 states and 202 transitions. [2023-02-14 14:42:56,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-14 14:42:56,802 INFO L428 stractBuchiCegarLoop]: Abstraction has 131 states and 202 transitions. [2023-02-14 14:42:56,803 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-02-14 14:42:56,803 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 131 states and 202 transitions. [2023-02-14 14:42:56,804 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 [2023-02-14 14:42:56,804 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 14:42:56,804 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 14:42:56,807 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-02-14 14:42:56,808 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:42:56,808 INFO L748 eck$LassoCheckResult]: Stem: 1773#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 1728#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1729#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 1756#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 1774#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1746#L42-3 [2023-02-14 14:42:56,808 INFO L750 eck$LassoCheckResult]: Loop: 1746#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1759#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1760#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1796#$Ultimate##0 ~n := #in~n; 1801#L25 assume !(~n <= 0); 1700#L26 call #t~ret0 := fact(~n - 1);< 1734#$Ultimate##0 ~n := #in~n; 1804#L25 assume ~n <= 0;#res := 1; 1802#factFINAL assume true; 1698#factEXIT >#66#return; 1704#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1795#factFINAL assume true; 1786#factEXIT >#68#return; 1789#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1796#$Ultimate##0 ~n := #in~n; 1801#L25 assume ~n <= 0;#res := 1; 1800#factFINAL assume true; 1799#factEXIT >#70#return; 1787#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1794#$Ultimate##0 ~n := #in~n; 1798#L25 assume !(~n <= 0); 1700#L26 call #t~ret0 := fact(~n - 1);< 1734#$Ultimate##0 ~n := #in~n; 1804#L25 assume ~n <= 0;#res := 1; 1802#factFINAL assume true; 1698#factEXIT >#66#return; 1704#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1795#factFINAL assume true; 1786#factEXIT >#72#return; 1793#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1784#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1782#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1781#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 1753#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 1745#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1746#L42-3 [2023-02-14 14:42:56,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:42:56,810 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 2 times [2023-02-14 14:42:56,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:42:56,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153346988] [2023-02-14 14:42:56,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:42:56,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:42:56,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:42:56,817 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:42:56,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:42:56,822 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:42:56,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:42:56,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1403101825, now seen corresponding path program 3 times [2023-02-14 14:42:56,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:42:56,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347899481] [2023-02-14 14:42:56,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:42:56,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:42:56,830 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 14:42:56,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1870975546] [2023-02-14 14:42:56,833 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-14 14:42:56,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 14:42:56,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:56,837 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 14:42:56,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Waiting until timeout for monitored process [2023-02-14 14:42:56,875 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-02-14 14:42:56,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 14:42:56,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-14 14:42:56,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:42:56,914 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-02-14 14:42:56,914 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 14:42:56,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:42:56,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347899481] [2023-02-14 14:42:56,915 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 14:42:56,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870975546] [2023-02-14 14:42:56,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870975546] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 14:42:56,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 14:42:56,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 14:42:56,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908261336] [2023-02-14 14:42:56,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 14:42:56,916 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-14 14:42:56,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 14:42:56,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 14:42:56,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-14 14:42:56,917 INFO L87 Difference]: Start difference. First operand 131 states and 202 transitions. cyclomatic complexity: 76 Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-14 14:42:56,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:42:56,973 INFO L93 Difference]: Finished difference Result 173 states and 268 transitions. [2023-02-14 14:42:56,974 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 173 states and 268 transitions. [2023-02-14 14:42:56,976 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 56 [2023-02-14 14:42:56,979 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 173 states to 167 states and 262 transitions. [2023-02-14 14:42:56,980 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 85 [2023-02-14 14:42:56,980 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 85 [2023-02-14 14:42:56,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 167 states and 262 transitions. [2023-02-14 14:42:56,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 14:42:56,981 INFO L218 hiAutomatonCegarLoop]: Abstraction has 167 states and 262 transitions. [2023-02-14 14:42:56,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states and 262 transitions. [2023-02-14 14:42:56,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 137. [2023-02-14 14:42:56,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 85 states have (on average 1.1764705882352942) internal successors, (100), 86 states have internal predecessors, (100), 42 states have call successors, (42), 10 states have call predecessors, (42), 10 states have return successors, (66), 40 states have call predecessors, (66), 42 states have call successors, (66) [2023-02-14 14:42:56,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 208 transitions. [2023-02-14 14:42:56,991 INFO L240 hiAutomatonCegarLoop]: Abstraction has 137 states and 208 transitions. [2023-02-14 14:42:56,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 14:42:56,992 INFO L428 stractBuchiCegarLoop]: Abstraction has 137 states and 208 transitions. [2023-02-14 14:42:56,992 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-02-14 14:42:56,992 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states and 208 transitions. [2023-02-14 14:42:56,994 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 40 [2023-02-14 14:42:56,994 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 14:42:56,994 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 14:42:56,995 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-02-14 14:42:56,995 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 10, 6, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:42:56,995 INFO L748 eck$LassoCheckResult]: Stem: 2176#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 2143#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 2144#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 2161#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 2177#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 2152#L42-3 [2023-02-14 14:42:56,996 INFO L750 eck$LassoCheckResult]: Loop: 2152#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 2216#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 2205#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 2213#$Ultimate##0 ~n := #in~n; 2218#L25 assume !(~n <= 0); 2119#L26 call #t~ret0 := fact(~n - 1);< 2149#$Ultimate##0 ~n := #in~n; 2236#L25 assume ~n <= 0;#res := 1; 2134#factFINAL assume true; 2118#factEXIT >#66#return; 2124#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2212#factFINAL assume true; 2200#factEXIT >#68#return; 2201#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 2213#$Ultimate##0 ~n := #in~n; 2218#L25 assume ~n <= 0;#res := 1; 2217#factFINAL assume true; 2215#factEXIT >#70#return; 2208#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 2211#$Ultimate##0 ~n := #in~n; 2214#L25 assume !(~n <= 0); 2119#L26 call #t~ret0 := fact(~n - 1);< 2149#$Ultimate##0 ~n := #in~n; 2236#L25 assume ~n <= 0;#res := 1; 2134#factFINAL assume true; 2118#factEXIT >#66#return; 2124#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2212#factFINAL assume true; 2200#factEXIT >#72#return; 2210#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 2245#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 2223#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 2221#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 2181#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 2202#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 2213#$Ultimate##0 ~n := #in~n; 2218#L25 assume !(~n <= 0); 2119#L26 call #t~ret0 := fact(~n - 1);< 2149#$Ultimate##0 ~n := #in~n; 2236#L25 assume ~n <= 0;#res := 1; 2134#factFINAL assume true; 2118#factEXIT >#66#return; 2124#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2212#factFINAL assume true; 2200#factEXIT >#74#return; 2203#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 2213#$Ultimate##0 ~n := #in~n; 2218#L25 assume ~n <= 0;#res := 1; 2217#factFINAL assume true; 2215#factEXIT >#76#return; 2206#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 2211#$Ultimate##0 ~n := #in~n; 2214#L25 assume !(~n <= 0); 2119#L26 call #t~ret0 := fact(~n - 1);< 2149#$Ultimate##0 ~n := #in~n; 2236#L25 assume ~n <= 0;#res := 1; 2134#factFINAL assume true; 2118#factEXIT >#66#return; 2124#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2212#factFINAL assume true; 2200#factEXIT >#78#return; 2199#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 2194#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 2182#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 2180#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 2155#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 2151#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 2152#L42-3 [2023-02-14 14:42:56,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:42:56,996 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 3 times [2023-02-14 14:42:56,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:42:56,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037050302] [2023-02-14 14:42:56,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:42:56,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:42:57,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:42:57,000 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:42:57,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:42:57,003 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:42:57,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:42:57,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1715041092, now seen corresponding path program 1 times [2023-02-14 14:42:57,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:42:57,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970328337] [2023-02-14 14:42:57,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:42:57,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:42:57,011 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 14:42:57,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [321885044] [2023-02-14 14:42:57,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:42:57,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 14:42:57,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:57,015 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 14:42:57,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Waiting until timeout for monitored process [2023-02-14 14:42:57,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:42:57,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-14 14:42:57,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:42:57,174 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 118 proven. 18 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-02-14 14:42:57,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 14:42:57,357 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 10 proven. 52 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2023-02-14 14:42:57,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:42:57,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970328337] [2023-02-14 14:42:57,358 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 14:42:57,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321885044] [2023-02-14 14:42:57,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321885044] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 14:42:57,359 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 14:42:57,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-02-14 14:42:57,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723426140] [2023-02-14 14:42:57,359 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 14:42:57,360 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-14 14:42:57,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 14:42:57,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-14 14:42:57,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2023-02-14 14:42:57,361 INFO L87 Difference]: Start difference. First operand 137 states and 208 transitions. cyclomatic complexity: 76 Second operand has 16 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 14 states have internal predecessors, (40), 9 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (15), 7 states have call predecessors, (15), 9 states have call successors, (15) [2023-02-14 14:42:57,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:42:57,862 INFO L93 Difference]: Finished difference Result 270 states and 395 transitions. [2023-02-14 14:42:57,862 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 270 states and 395 transitions. [2023-02-14 14:42:57,866 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 105 [2023-02-14 14:42:57,869 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 270 states to 270 states and 395 transitions. [2023-02-14 14:42:57,870 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 136 [2023-02-14 14:42:57,870 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 136 [2023-02-14 14:42:57,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 270 states and 395 transitions. [2023-02-14 14:42:57,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 14:42:57,870 INFO L218 hiAutomatonCegarLoop]: Abstraction has 270 states and 395 transitions. [2023-02-14 14:42:57,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states and 395 transitions. [2023-02-14 14:42:57,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 185. [2023-02-14 14:42:57,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 125 states have (on average 1.12) internal successors, (140), 122 states have internal predecessors, (140), 50 states have call successors, (50), 10 states have call predecessors, (50), 10 states have return successors, (82), 52 states have call predecessors, (82), 50 states have call successors, (82) [2023-02-14 14:42:57,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 272 transitions. [2023-02-14 14:42:57,881 INFO L240 hiAutomatonCegarLoop]: Abstraction has 185 states and 272 transitions. [2023-02-14 14:42:57,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-14 14:42:57,882 INFO L428 stractBuchiCegarLoop]: Abstraction has 185 states and 272 transitions. [2023-02-14 14:42:57,882 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-02-14 14:42:57,882 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 185 states and 272 transitions. [2023-02-14 14:42:57,883 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 64 [2023-02-14 14:42:57,884 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 14:42:57,884 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 14:42:57,885 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-02-14 14:42:57,885 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [15, 15, 9, 6, 6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:42:57,885 INFO L748 eck$LassoCheckResult]: Stem: 3031#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 2992#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 2993#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 3010#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 3032#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 3001#L42-3 [2023-02-14 14:42:57,886 INFO L750 eck$LassoCheckResult]: Loop: 3001#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 3082#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 3059#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 3065#$Ultimate##0 ~n := #in~n; 3072#L25 assume !(~n <= 0); 3025#L26 call #t~ret0 := fact(~n - 1);< 2997#$Ultimate##0 ~n := #in~n; 3026#L25 assume ~n <= 0;#res := 1; 3078#factFINAL assume true; 3067#factEXIT >#66#return; 3066#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 3064#factFINAL assume true; 3052#factEXIT >#68#return; 3054#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 3065#$Ultimate##0 ~n := #in~n; 3072#L25 assume ~n <= 0;#res := 1; 3076#factFINAL assume true; 3075#factEXIT >#70#return; 3058#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 3063#$Ultimate##0 ~n := #in~n; 3070#L25 assume !(~n <= 0); 3025#L26 call #t~ret0 := fact(~n - 1);< 2997#$Ultimate##0 ~n := #in~n; 3026#L25 assume ~n <= 0;#res := 1; 3078#factFINAL assume true; 3067#factEXIT >#66#return; 3066#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 3064#factFINAL assume true; 3052#factEXIT >#72#return; 3062#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 3137#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 3133#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 3079#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 3077#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 3060#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 3065#$Ultimate##0 ~n := #in~n; 3072#L25 assume !(~n <= 0); 3025#L26 call #t~ret0 := fact(~n - 1);< 2997#$Ultimate##0 ~n := #in~n; 3026#L25 assume ~n <= 0;#res := 1; 3078#factFINAL assume true; 3067#factEXIT >#66#return; 3066#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 3064#factFINAL assume true; 3052#factEXIT >#68#return; 3053#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 3065#$Ultimate##0 ~n := #in~n; 3072#L25 assume !(~n <= 0); 3025#L26 call #t~ret0 := fact(~n - 1);< 2997#$Ultimate##0 ~n := #in~n; 3026#L25 assume ~n <= 0;#res := 1; 3078#factFINAL assume true; 3067#factEXIT >#66#return; 3066#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 3064#factFINAL assume true; 3052#factEXIT >#70#return; 3057#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 3065#$Ultimate##0 ~n := #in~n; 3072#L25 assume ~n <= 0;#res := 1; 3076#factFINAL assume true; 3075#factEXIT >#72#return; 3074#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 3073#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 3071#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 3069#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 3035#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 3043#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 3065#$Ultimate##0 ~n := #in~n; 3072#L25 assume !(~n <= 0); 3025#L26 call #t~ret0 := fact(~n - 1);< 2997#$Ultimate##0 ~n := #in~n; 3026#L25 assume ~n <= 0;#res := 1; 3078#factFINAL assume true; 3067#factEXIT >#66#return; 3066#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 3064#factFINAL assume true; 3052#factEXIT >#74#return; 3055#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 3065#$Ultimate##0 ~n := #in~n; 3072#L25 assume ~n <= 0;#res := 1; 3076#factFINAL assume true; 3075#factEXIT >#76#return; 3056#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 3063#$Ultimate##0 ~n := #in~n; 3070#L25 assume !(~n <= 0); 3025#L26 call #t~ret0 := fact(~n - 1);< 2997#$Ultimate##0 ~n := #in~n; 3026#L25 assume ~n <= 0;#res := 1; 3078#factFINAL assume true; 3067#factEXIT >#66#return; 3066#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 3064#factFINAL assume true; 3052#factEXIT >#78#return; 3047#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 3041#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 3036#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 3034#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 3007#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 3000#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 3001#L42-3 [2023-02-14 14:42:57,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:42:57,886 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 4 times [2023-02-14 14:42:57,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:42:57,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536610520] [2023-02-14 14:42:57,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:42:57,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:42:57,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:42:57,890 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:42:57,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:42:57,892 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:42:57,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:42:57,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1813506637, now seen corresponding path program 2 times [2023-02-14 14:42:57,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:42:57,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52788120] [2023-02-14 14:42:57,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:42:57,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:42:57,900 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 14:42:57,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1893085637] [2023-02-14 14:42:57,901 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 14:42:57,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 14:42:57,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:57,904 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 14:42:57,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Waiting until timeout for monitored process [2023-02-14 14:42:57,974 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 14:42:57,974 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 14:42:57,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-14 14:42:57,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:42:58,134 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 230 proven. 82 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2023-02-14 14:42:58,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 14:42:58,514 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 79 proven. 134 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2023-02-14 14:42:58,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:42:58,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52788120] [2023-02-14 14:42:58,515 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 14:42:58,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893085637] [2023-02-14 14:42:58,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893085637] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 14:42:58,515 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 14:42:58,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 18 [2023-02-14 14:42:58,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884039520] [2023-02-14 14:42:58,516 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 14:42:58,516 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-14 14:42:58,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 14:42:58,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-14 14:42:58,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2023-02-14 14:42:58,517 INFO L87 Difference]: Start difference. First operand 185 states and 272 transitions. cyclomatic complexity: 92 Second operand has 18 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 16 states have internal predecessors, (45), 11 states have call successors, (19), 2 states have call predecessors, (19), 5 states have return successors, (19), 8 states have call predecessors, (19), 11 states have call successors, (19) [2023-02-14 14:42:59,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:42:59,067 INFO L93 Difference]: Finished difference Result 337 states and 498 transitions. [2023-02-14 14:42:59,067 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 337 states and 498 transitions. [2023-02-14 14:42:59,071 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 86 [2023-02-14 14:42:59,075 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 337 states to 337 states and 498 transitions. [2023-02-14 14:42:59,076 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 167 [2023-02-14 14:42:59,077 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 167 [2023-02-14 14:42:59,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 337 states and 498 transitions. [2023-02-14 14:42:59,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 14:42:59,077 INFO L218 hiAutomatonCegarLoop]: Abstraction has 337 states and 498 transitions. [2023-02-14 14:42:59,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states and 498 transitions. [2023-02-14 14:42:59,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 211. [2023-02-14 14:42:59,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 145 states have (on average 1.1172413793103448) internal successors, (162), 144 states have internal predecessors, (162), 50 states have call successors, (50), 10 states have call predecessors, (50), 16 states have return successors, (104), 56 states have call predecessors, (104), 50 states have call successors, (104) [2023-02-14 14:42:59,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 316 transitions. [2023-02-14 14:42:59,097 INFO L240 hiAutomatonCegarLoop]: Abstraction has 211 states and 316 transitions. [2023-02-14 14:42:59,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-14 14:42:59,099 INFO L428 stractBuchiCegarLoop]: Abstraction has 211 states and 316 transitions. [2023-02-14 14:42:59,099 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-02-14 14:42:59,099 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 211 states and 316 transitions. [2023-02-14 14:42:59,101 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 56 [2023-02-14 14:42:59,101 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 14:42:59,101 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 14:42:59,103 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-02-14 14:42:59,103 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [17, 17, 9, 8, 8, 8, 8, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:42:59,104 INFO L748 eck$LassoCheckResult]: Stem: 4185#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 4144#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 4145#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 4168#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 4186#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 4159#L42-3 [2023-02-14 14:42:59,104 INFO L750 eck$LassoCheckResult]: Loop: 4159#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 4214#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 4201#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 4209#$Ultimate##0 ~n := #in~n; 4212#L25 assume !(~n <= 0); 4213#L26 call #t~ret0 := fact(~n - 1);< 4153#$Ultimate##0 ~n := #in~n; 4227#L25 assume ~n <= 0;#res := 1; 4225#factFINAL assume true; 4222#factEXIT >#66#return; 4224#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4226#factFINAL assume true; 4192#factEXIT >#68#return; 4193#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 4209#$Ultimate##0 ~n := #in~n; 4212#L25 assume ~n <= 0;#res := 1; 4210#factFINAL assume true; 4207#factEXIT >#70#return; 4194#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 4206#$Ultimate##0 ~n := #in~n; 4220#L25 assume !(~n <= 0); 4213#L26 call #t~ret0 := fact(~n - 1);< 4153#$Ultimate##0 ~n := #in~n; 4227#L25 assume ~n <= 0;#res := 1; 4225#factFINAL assume true; 4222#factEXIT >#66#return; 4224#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4226#factFINAL assume true; 4192#factEXIT >#72#return; 4204#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 4231#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 4230#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 4229#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 4228#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 4203#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 4206#$Ultimate##0 ~n := #in~n; 4220#L25 assume !(~n <= 0); 4213#L26 call #t~ret0 := fact(~n - 1);< 4153#$Ultimate##0 ~n := #in~n; 4227#L25 assume ~n <= 0;#res := 1; 4225#factFINAL assume true; 4222#factEXIT >#66#return; 4224#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4226#factFINAL assume true; 4192#factEXIT >#68#return; 4196#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 4209#$Ultimate##0 ~n := #in~n; 4212#L25 assume !(~n <= 0); 4213#L26 call #t~ret0 := fact(~n - 1);< 4153#$Ultimate##0 ~n := #in~n; 4227#L25 assume ~n <= 0;#res := 1; 4225#factFINAL assume true; 4222#factEXIT >#66#return; 4224#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4226#factFINAL assume true; 4192#factEXIT >#70#return; 4195#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 4209#$Ultimate##0 ~n := #in~n; 4212#L25 assume ~n <= 0;#res := 1; 4210#factFINAL assume true; 4207#factEXIT >#72#return; 4208#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 4237#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 4234#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 4233#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 4188#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 4200#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 4206#$Ultimate##0 ~n := #in~n; 4220#L25 assume !(~n <= 0); 4213#L26 call #t~ret0 := fact(~n - 1);< 4153#$Ultimate##0 ~n := #in~n; 4227#L25 assume !(~n <= 0); 4218#L26 call #t~ret0 := fact(~n - 1);< 4153#$Ultimate##0 ~n := #in~n; 4227#L25 assume ~n <= 0;#res := 1; 4225#factFINAL assume true; 4222#factEXIT >#66#return; 4219#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4221#factFINAL assume true; 4217#factEXIT >#66#return; 4216#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4215#factFINAL assume true; 4211#factEXIT >#74#return; 4202#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 4209#$Ultimate##0 ~n := #in~n; 4212#L25 assume !(~n <= 0); 4213#L26 call #t~ret0 := fact(~n - 1);< 4153#$Ultimate##0 ~n := #in~n; 4227#L25 assume ~n <= 0;#res := 1; 4225#factFINAL assume true; 4222#factEXIT >#66#return; 4224#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4226#factFINAL assume true; 4192#factEXIT >#76#return; 4199#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 4206#$Ultimate##0 ~n := #in~n; 4220#L25 assume !(~n <= 0); 4213#L26 call #t~ret0 := fact(~n - 1);< 4153#$Ultimate##0 ~n := #in~n; 4227#L25 assume ~n <= 0;#res := 1; 4225#factFINAL assume true; 4222#factEXIT >#66#return; 4224#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4226#factFINAL assume true; 4192#factEXIT >#78#return; 4191#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 4190#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 4189#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 4187#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 4166#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 4158#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 4159#L42-3 [2023-02-14 14:42:59,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:42:59,104 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 5 times [2023-02-14 14:42:59,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:42:59,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66943602] [2023-02-14 14:42:59,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:42:59,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:42:59,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:42:59,112 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:42:59,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:42:59,118 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:42:59,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:42:59,118 INFO L85 PathProgramCache]: Analyzing trace with hash 590406435, now seen corresponding path program 3 times [2023-02-14 14:42:59,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:42:59,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835417932] [2023-02-14 14:42:59,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:42:59,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:42:59,129 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 14:42:59,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1227040482] [2023-02-14 14:42:59,129 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-14 14:42:59,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 14:42:59,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:59,133 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 14:42:59,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Waiting until timeout for monitored process [2023-02-14 14:42:59,219 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2023-02-14 14:42:59,219 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-02-14 14:42:59,219 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:42:59,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:42:59,271 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:42:59,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:42:59,272 INFO L85 PathProgramCache]: Analyzing trace with hash -552239216, now seen corresponding path program 1 times [2023-02-14 14:42:59,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:42:59,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097164304] [2023-02-14 14:42:59,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:42:59,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:42:59,281 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 14:42:59,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [558714291] [2023-02-14 14:42:59,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:42:59,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 14:42:59,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:42:59,285 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 14:42:59,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Waiting until timeout for monitored process [2023-02-14 14:42:59,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:42:59,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-14 14:42:59,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:42:59,410 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 143 proven. 1 refuted. 0 times theorem prover too weak. 474 trivial. 0 not checked. [2023-02-14 14:42:59,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 14:42:59,506 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 9 proven. 60 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked. [2023-02-14 14:42:59,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:42:59,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097164304] [2023-02-14 14:42:59,507 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 14:42:59,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558714291] [2023-02-14 14:42:59,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558714291] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 14:42:59,507 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 14:42:59,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2023-02-14 14:42:59,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069239239] [2023-02-14 14:42:59,508 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 14:43:02,616 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 14:43:02,616 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 14:43:02,616 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 14:43:02,616 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 14:43:02,617 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-14 14:43:02,617 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:02,617 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 14:43:02,617 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 14:43:02,617 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration10_Loop [2023-02-14 14:43:02,617 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 14:43:02,617 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 14:43:02,618 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:02,622 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:02,624 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:02,628 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:02,634 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:02,636 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:02,637 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:02,639 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:02,642 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:02,899 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 14:43:02,900 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-14 14:43:02,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:02,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:02,905 INFO L229 MonitoredProcess]: Starting monitored process 92 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) [2023-02-14 14:43:02,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2023-02-14 14:43:02,908 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 14:43:02,908 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 14:43:02,915 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 14:43:02,915 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret10#1=0} Honda state: {ULTIMATE.start_main_#t~ret10#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-14 14:43:02,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2023-02-14 14:43:02,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:02,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:02,918 INFO L229 MonitoredProcess]: Starting monitored process 93 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) [2023-02-14 14:43:02,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2023-02-14 14:43:02,921 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 14:43:02,921 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 14:43:02,928 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 14:43:02,928 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post8#1=0} Honda state: {ULTIMATE.start_main_#t~post8#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-14 14:43:02,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2023-02-14 14:43:02,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:02,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:02,932 INFO L229 MonitoredProcess]: Starting monitored process 94 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) [2023-02-14 14:43:02,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2023-02-14 14:43:02,934 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 14:43:02,934 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 14:43:02,941 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 14:43:02,942 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~k~0#1=0} Honda state: {ULTIMATE.start_main_~k~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-14 14:43:02,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2023-02-14 14:43:02,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:02,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:02,945 INFO L229 MonitoredProcess]: Starting monitored process 95 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) [2023-02-14 14:43:02,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2023-02-14 14:43:02,948 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 14:43:02,948 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 14:43:02,955 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 14:43:02,955 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post7#1=0} Honda state: {ULTIMATE.start_main_#t~post7#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-14 14:43:02,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2023-02-14 14:43:02,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:02,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:02,959 INFO L229 MonitoredProcess]: Starting monitored process 96 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) [2023-02-14 14:43:02,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2023-02-14 14:43:02,962 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 14:43:02,962 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 14:43:02,968 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 14:43:02,969 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-14 14:43:02,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Forceful destruction successful, exit code 0 [2023-02-14 14:43:02,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:02,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:02,973 INFO L229 MonitoredProcess]: Starting monitored process 97 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) [2023-02-14 14:43:02,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2023-02-14 14:43:02,976 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 14:43:02,976 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 14:43:02,982 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 14:43:02,982 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret9#1=0} Honda state: {ULTIMATE.start_main_#t~ret9#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-14 14:43:02,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2023-02-14 14:43:02,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:02,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:02,987 INFO L229 MonitoredProcess]: Starting monitored process 98 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) [2023-02-14 14:43:02,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2023-02-14 14:43:02,990 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 14:43:02,990 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 14:43:02,998 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 14:43:02,998 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret2#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret2#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-14 14:43:03,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Forceful destruction successful, exit code 0 [2023-02-14 14:43:03,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:03,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:03,002 INFO L229 MonitoredProcess]: Starting monitored process 99 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) [2023-02-14 14:43:03,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2023-02-14 14:43:03,005 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 14:43:03,005 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 14:43:03,012 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 14:43:03,012 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-14 14:43:03,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2023-02-14 14:43:03,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:03,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:03,017 INFO L229 MonitoredProcess]: Starting monitored process 100 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) [2023-02-14 14:43:03,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2023-02-14 14:43:03,020 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 14:43:03,021 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 14:43:03,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Forceful destruction successful, exit code 0 [2023-02-14 14:43:03,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:03,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:03,035 INFO L229 MonitoredProcess]: Starting monitored process 101 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) [2023-02-14 14:43:03,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2023-02-14 14:43:03,038 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-14 14:43:03,038 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 14:43:03,075 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-14 14:43:03,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Forceful destruction successful, exit code 0 [2023-02-14 14:43:03,079 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 14:43:03,079 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 14:43:03,079 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 14:43:03,079 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 14:43:03,080 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-14 14:43:03,080 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:03,080 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 14:43:03,080 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 14:43:03,080 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration10_Loop [2023-02-14 14:43:03,080 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 14:43:03,080 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 14:43:03,081 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:03,131 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:03,133 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:03,134 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:03,136 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:03,140 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:03,142 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:03,143 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:03,144 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:03,336 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 14:43:03,336 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-14 14:43:03,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:03,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:03,338 INFO L229 MonitoredProcess]: Starting monitored process 102 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) [2023-02-14 14:43:03,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2023-02-14 14:43:03,342 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 [2023-02-14 14:43:03,349 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:43:03,349 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:43:03,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:43:03,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:43:03,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:43:03,351 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 14:43:03,351 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:43:03,354 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-14 14:43:03,357 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-14 14:43:03,357 INFO L444 ModelExtractionUtils]: 6 out of 9 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-14 14:43:03,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:03,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:03,360 INFO L229 MonitoredProcess]: Starting monitored process 103 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) [2023-02-14 14:43:03,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2023-02-14 14:43:03,361 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-14 14:43:03,362 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-14 14:43:03,362 INFO L513 LassoAnalysis]: Proved termination. [2023-02-14 14:43:03,362 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~n~0#1) = 1*ULTIMATE.start_main_~x~0#1 - 1*ULTIMATE.start_main_~n~0#1 Supporting invariants [] [2023-02-14 14:43:03,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Ended with exit code 0 [2023-02-14 14:43:03,365 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-14 14:43:03,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:43:03,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:43:03,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-14 14:43:03,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:43:03,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:43:03,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 733 conjuncts, 49 conjunts are in the unsatisfiable core [2023-02-14 14:43:03,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:43:03,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Forceful destruction successful, exit code 0 [2023-02-14 14:43:03,912 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 29 proven. 94 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2023-02-14 14:43:03,913 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 11 loop predicates [2023-02-14 14:43:03,913 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 211 states and 316 transitions. cyclomatic complexity: 110 Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 5 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2023-02-14 14:43:04,323 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 211 states and 316 transitions. cyclomatic complexity: 110. Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 5 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) Result 1010 states and 1427 transitions. Complement of second has 48 states. [2023-02-14 14:43:04,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2023-02-14 14:43:04,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 5 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2023-02-14 14:43:04,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 106 transitions. [2023-02-14 14:43:04,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 106 transitions. Stem has 5 letters. Loop has 111 letters. [2023-02-14 14:43:04,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 14:43:04,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 106 transitions. Stem has 116 letters. Loop has 111 letters. [2023-02-14 14:43:04,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 14:43:04,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 106 transitions. Stem has 5 letters. Loop has 222 letters. [2023-02-14 14:43:04,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 14:43:04,332 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1010 states and 1427 transitions. [2023-02-14 14:43:04,343 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 37 [2023-02-14 14:43:04,349 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1010 states to 482 states and 654 transitions. [2023-02-14 14:43:04,349 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 193 [2023-02-14 14:43:04,350 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 195 [2023-02-14 14:43:04,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 482 states and 654 transitions. [2023-02-14 14:43:04,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 14:43:04,350 INFO L218 hiAutomatonCegarLoop]: Abstraction has 482 states and 654 transitions. [2023-02-14 14:43:04,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states and 654 transitions. [2023-02-14 14:43:04,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 466. [2023-02-14 14:43:04,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 320 states have (on average 1.08125) internal successors, (346), 320 states have internal predecessors, (346), 95 states have call successors, (95), 33 states have call predecessors, (95), 51 states have return successors, (182), 112 states have call predecessors, (182), 93 states have call successors, (182) [2023-02-14 14:43:04,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 623 transitions. [2023-02-14 14:43:04,367 INFO L240 hiAutomatonCegarLoop]: Abstraction has 466 states and 623 transitions. [2023-02-14 14:43:04,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 14:43:04,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 14:43:04,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-14 14:43:04,368 INFO L87 Difference]: Start difference. First operand 466 states and 623 transitions. Second operand has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2023-02-14 14:43:04,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:43:04,503 INFO L93 Difference]: Finished difference Result 530 states and 714 transitions. [2023-02-14 14:43:04,503 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 530 states and 714 transitions. [2023-02-14 14:43:04,508 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 45 [2023-02-14 14:43:04,513 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 530 states to 516 states and 697 transitions. [2023-02-14 14:43:04,514 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 216 [2023-02-14 14:43:04,514 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 216 [2023-02-14 14:43:04,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 516 states and 697 transitions. [2023-02-14 14:43:04,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 14:43:04,515 INFO L218 hiAutomatonCegarLoop]: Abstraction has 516 states and 697 transitions. [2023-02-14 14:43:04,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states and 697 transitions. [2023-02-14 14:43:04,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 487. [2023-02-14 14:43:04,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 333 states have (on average 1.075075075075075) internal successors, (358), 335 states have internal predecessors, (358), 103 states have call successors, (103), 33 states have call predecessors, (103), 51 states have return successors, (190), 118 states have call predecessors, (190), 99 states have call successors, (190) [2023-02-14 14:43:04,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 651 transitions. [2023-02-14 14:43:04,530 INFO L240 hiAutomatonCegarLoop]: Abstraction has 487 states and 651 transitions. [2023-02-14 14:43:04,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 14:43:04,531 INFO L428 stractBuchiCegarLoop]: Abstraction has 487 states and 651 transitions. [2023-02-14 14:43:04,531 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-02-14 14:43:04,531 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 487 states and 651 transitions. [2023-02-14 14:43:04,534 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 37 [2023-02-14 14:43:04,534 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 14:43:04,534 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 14:43:04,535 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:43:04,535 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-02-14 14:43:04,535 INFO L748 eck$LassoCheckResult]: Stem: 7560#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 7494#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 7495#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 7522#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 7511#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 7512#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 7638#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 7621#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 7624#$Ultimate##0 ~n := #in~n; 7705#L25 assume !(~n <= 0); 7585#L26 call #t~ret0 := fact(~n - 1);< 7504#$Ultimate##0 [2023-02-14 14:43:04,535 INFO L750 eck$LassoCheckResult]: Loop: 7504#$Ultimate##0 ~n := #in~n; 7607#L25 assume !(~n <= 0); 7586#L26 call #t~ret0 := fact(~n - 1);< 7504#$Ultimate##0 [2023-02-14 14:43:04,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:43:04,535 INFO L85 PathProgramCache]: Analyzing trace with hash 271623377, now seen corresponding path program 1 times [2023-02-14 14:43:04,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:43:04,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182447555] [2023-02-14 14:43:04,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:43:04,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:43:04,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:43:04,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 14:43:04,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:43:04,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182447555] [2023-02-14 14:43:04,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182447555] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 14:43:04,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 14:43:04,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 14:43:04,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691284021] [2023-02-14 14:43:04,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 14:43:04,576 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-14 14:43:04,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:43:04,577 INFO L85 PathProgramCache]: Analyzing trace with hash 29980, now seen corresponding path program 1 times [2023-02-14 14:43:04,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:43:04,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893949988] [2023-02-14 14:43:04,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:43:04,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:43:04,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:43:04,579 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:43:04,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:43:04,581 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:43:04,604 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 14:43:04,604 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 14:43:04,604 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 14:43:04,604 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 14:43:04,604 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-14 14:43:04,604 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:04,604 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 14:43:04,605 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 14:43:04,605 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration11_Loop [2023-02-14 14:43:04,605 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 14:43:04,605 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 14:43:04,606 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:04,610 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:04,612 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:04,614 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:04,631 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 14:43:04,632 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-14 14:43:04,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:04,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:04,637 INFO L229 MonitoredProcess]: Starting monitored process 104 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) [2023-02-14 14:43:04,646 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 14:43:04,646 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 14:43:04,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2023-02-14 14:43:04,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Forceful destruction successful, exit code 0 [2023-02-14 14:43:04,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:04,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:04,673 INFO L229 MonitoredProcess]: Starting monitored process 105 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) [2023-02-14 14:43:04,678 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-14 14:43:04,678 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 14:43:04,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2023-02-14 14:43:04,749 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-14 14:43:04,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Forceful destruction successful, exit code 0 [2023-02-14 14:43:04,753 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 14:43:04,753 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 14:43:04,754 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 14:43:04,754 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 14:43:04,754 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-14 14:43:04,754 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:04,754 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 14:43:04,754 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 14:43:04,754 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration11_Loop [2023-02-14 14:43:04,754 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 14:43:04,754 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 14:43:04,754 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:04,759 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:04,761 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:04,762 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:04,780 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 14:43:04,780 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-14 14:43:04,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:04,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:04,782 INFO L229 MonitoredProcess]: Starting monitored process 106 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) [2023-02-14 14:43:04,789 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 [2023-02-14 14:43:04,797 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:43:04,797 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:43:04,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:43:04,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:43:04,797 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:43:04,798 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 14:43:04,798 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:43:04,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2023-02-14 14:43:04,815 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-14 14:43:04,818 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-14 14:43:04,818 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-14 14:43:04,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:04,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:04,821 INFO L229 MonitoredProcess]: Starting monitored process 107 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) [2023-02-14 14:43:04,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2023-02-14 14:43:04,825 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-14 14:43:04,825 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-14 14:43:04,825 INFO L513 LassoAnalysis]: Proved termination. [2023-02-14 14:43:04,825 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fact_#in~n) = 1*fact_#in~n Supporting invariants [] [2023-02-14 14:43:04,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Forceful destruction successful, exit code 0 [2023-02-14 14:43:04,830 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-14 14:43:04,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:43:04,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:43:04,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-14 14:43:04,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:43:04,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Forceful destruction successful, exit code 0 [2023-02-14 14:43:04,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:43:04,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-14 14:43:04,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:43:04,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 14:43:04,924 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2023-02-14 14:43:04,924 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 487 states and 651 transitions. cyclomatic complexity: 173 Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:43:04,971 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 487 states and 651 transitions. cyclomatic complexity: 173. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 561 states and 749 transitions. Complement of second has 13 states. [2023-02-14 14:43:04,972 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 [2023-02-14 14:43:04,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:43:04,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2023-02-14 14:43:04,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 11 letters. Loop has 3 letters. [2023-02-14 14:43:04,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 14:43:04,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 14 letters. Loop has 3 letters. [2023-02-14 14:43:04,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 14:43:04,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 11 letters. Loop has 6 letters. [2023-02-14 14:43:04,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 14:43:04,974 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 561 states and 749 transitions. [2023-02-14 14:43:04,981 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 37 [2023-02-14 14:43:04,986 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 561 states to 546 states and 725 transitions. [2023-02-14 14:43:04,987 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 225 [2023-02-14 14:43:04,987 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 227 [2023-02-14 14:43:04,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 546 states and 725 transitions. [2023-02-14 14:43:04,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 14:43:04,988 INFO L218 hiAutomatonCegarLoop]: Abstraction has 546 states and 725 transitions. [2023-02-14 14:43:04,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states and 725 transitions. [2023-02-14 14:43:05,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 542. [2023-02-14 14:43:05,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 373 states have (on average 1.0804289544235925) internal successors, (403), 378 states have internal predecessors, (403), 110 states have call successors, (110), 43 states have call predecessors, (110), 59 states have return successors, (204), 120 states have call predecessors, (204), 106 states have call successors, (204) [2023-02-14 14:43:05,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 717 transitions. [2023-02-14 14:43:05,006 INFO L240 hiAutomatonCegarLoop]: Abstraction has 542 states and 717 transitions. [2023-02-14 14:43:05,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 14:43:05,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 14:43:05,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-14 14:43:05,007 INFO L87 Difference]: Start difference. First operand 542 states and 717 transitions. Second operand has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:43:05,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:43:05,068 INFO L93 Difference]: Finished difference Result 563 states and 749 transitions. [2023-02-14 14:43:05,068 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 563 states and 749 transitions. [2023-02-14 14:43:05,074 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 45 [2023-02-14 14:43:05,080 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 563 states to 546 states and 729 transitions. [2023-02-14 14:43:05,080 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 222 [2023-02-14 14:43:05,081 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 222 [2023-02-14 14:43:05,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 546 states and 729 transitions. [2023-02-14 14:43:05,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 14:43:05,081 INFO L218 hiAutomatonCegarLoop]: Abstraction has 546 states and 729 transitions. [2023-02-14 14:43:05,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states and 729 transitions. [2023-02-14 14:43:05,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 529. [2023-02-14 14:43:05,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 363 states have (on average 1.0798898071625345) internal successors, (392), 367 states have internal predecessors, (392), 107 states have call successors, (107), 43 states have call predecessors, (107), 59 states have return successors, (200), 118 states have call predecessors, (200), 105 states have call successors, (200) [2023-02-14 14:43:05,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 699 transitions. [2023-02-14 14:43:05,098 INFO L240 hiAutomatonCegarLoop]: Abstraction has 529 states and 699 transitions. [2023-02-14 14:43:05,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 14:43:05,099 INFO L428 stractBuchiCegarLoop]: Abstraction has 529 states and 699 transitions. [2023-02-14 14:43:05,099 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2023-02-14 14:43:05,099 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 529 states and 699 transitions. [2023-02-14 14:43:05,102 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 37 [2023-02-14 14:43:05,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 14:43:05,102 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 14:43:05,103 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:43:05,103 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 8, 5, 5, 5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:43:05,104 INFO L748 eck$LassoCheckResult]: Stem: 9778#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 9719#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 9720#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 9744#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 9733#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 9735#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 10089#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 9756#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 10088#$Ultimate##0 ~n := #in~n; 9755#L25 assume ~n <= 0;#res := 1; 9757#factFINAL assume true; 10087#factEXIT >#68#return; 10077#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 10076#$Ultimate##0 ~n := #in~n; 10079#L25 assume ~n <= 0;#res := 1; 10086#factFINAL assume true; 10085#factEXIT >#70#return; 10078#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 10076#$Ultimate##0 ~n := #in~n; 10079#L25 assume ~n <= 0;#res := 1; 10086#factFINAL assume true; 10085#factEXIT >#72#return; 10084#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 10083#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 10082#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 10081#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 10080#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 9696#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 9697#$Ultimate##0 ~n := #in~n; 9859#L25 assume !(~n <= 0); 9725#L26 call #t~ret0 := fact(~n - 1);< 9726#$Ultimate##0 ~n := #in~n; 9834#L25 assume ~n <= 0;#res := 1; 9852#factFINAL assume true; 9851#factEXIT >#66#return; 9829#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 10203#factFINAL assume true; 9782#factEXIT >#74#return; 9772#L30-6 [2023-02-14 14:43:05,104 INFO L750 eck$LassoCheckResult]: Loop: 9772#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 9773#$Ultimate##0 ~n := #in~n; 9799#L25 assume !(~n <= 0); 9800#L26 call #t~ret0 := fact(~n - 1);< 9817#$Ultimate##0 ~n := #in~n; 9835#L25 assume ~n <= 0;#res := 1; 9836#factFINAL assume true; 9827#factEXIT >#66#return; 9829#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 10203#factFINAL assume true; 9782#factEXIT >#76#return; 9779#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 9780#$Ultimate##0 ~n := #in~n; 9853#L25 assume !(~n <= 0); 9800#L26 call #t~ret0 := fact(~n - 1);< 9817#$Ultimate##0 ~n := #in~n; 9835#L25 assume ~n <= 0;#res := 1; 9836#factFINAL assume true; 9827#factEXIT >#66#return; 9829#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 10203#factFINAL assume true; 9782#factEXIT >#78#return; 9721#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 9722#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 9745#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 9776#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 10137#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 9783#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 9780#$Ultimate##0 ~n := #in~n; 9853#L25 assume !(~n <= 0); 9800#L26 call #t~ret0 := fact(~n - 1);< 9817#$Ultimate##0 ~n := #in~n; 9835#L25 assume !(~n <= 0); 9809#L26 call #t~ret0 := fact(~n - 1);< 9817#$Ultimate##0 ~n := #in~n; 9835#L25 assume !(~n <= 0); 9809#L26 call #t~ret0 := fact(~n - 1);< 9817#$Ultimate##0 ~n := #in~n; 9835#L25 assume ~n <= 0;#res := 1; 9836#factFINAL assume true; 9827#factEXIT >#66#return; 9811#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 9819#factFINAL assume true; 9803#factEXIT >#66#return; 9811#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 9819#factFINAL assume true; 9803#factEXIT >#66#return; 9813#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 9786#factFINAL assume true; 9787#factEXIT >#74#return; 9772#L30-6 [2023-02-14 14:43:05,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:43:05,104 INFO L85 PathProgramCache]: Analyzing trace with hash -426322681, now seen corresponding path program 1 times [2023-02-14 14:43:05,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:43:05,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277225565] [2023-02-14 14:43:05,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:43:05,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:43:05,110 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 14:43:05,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [632644377] [2023-02-14 14:43:05,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:43:05,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 14:43:05,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:05,112 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 14:43:05,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Waiting until timeout for monitored process [2023-02-14 14:43:05,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:43:05,161 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:43:05,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:43:05,181 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:43:05,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:43:05,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1167330940, now seen corresponding path program 1 times [2023-02-14 14:43:05,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:43:05,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119511535] [2023-02-14 14:43:05,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:43:05,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:43:05,185 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 14:43:05,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [278320108] [2023-02-14 14:43:05,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:43:05,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 14:43:05,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:05,192 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 14:43:05,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Waiting until timeout for monitored process [2023-02-14 14:43:05,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:43:05,238 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:43:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:43:05,261 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:43:05,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:43:05,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1873696258, now seen corresponding path program 1 times [2023-02-14 14:43:05,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:43:05,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586974550] [2023-02-14 14:43:05,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:43:05,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:43:05,267 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 14:43:05,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1000888363] [2023-02-14 14:43:05,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:43:05,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 14:43:05,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:05,272 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 14:43:05,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (110)] Waiting until timeout for monitored process [2023-02-14 14:43:05,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:43:05,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-14 14:43:05,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:43:05,363 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 209 proven. 1 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2023-02-14 14:43:05,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 14:43:05,469 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 25 proven. 27 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2023-02-14 14:43:05,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:43:05,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586974550] [2023-02-14 14:43:05,469 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 14:43:05,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000888363] [2023-02-14 14:43:05,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000888363] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 14:43:05,469 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 14:43:05,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2023-02-14 14:43:05,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338668118] [2023-02-14 14:43:05,470 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 14:43:06,028 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 14:43:06,028 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 14:43:06,028 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 14:43:06,029 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 14:43:06,029 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-14 14:43:06,029 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:06,029 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 14:43:06,029 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 14:43:06,029 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration12_Loop [2023-02-14 14:43:06,029 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 14:43:06,029 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 14:43:06,040 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:06,063 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:06,065 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:06,066 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:06,071 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:06,072 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:06,163 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 14:43:06,163 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-14 14:43:06,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:06,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:06,166 INFO L229 MonitoredProcess]: Starting monitored process 111 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) [2023-02-14 14:43:06,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2023-02-14 14:43:06,167 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 14:43:06,167 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 14:43:06,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Forceful destruction successful, exit code 0 [2023-02-14 14:43:06,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:06,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:06,179 INFO L229 MonitoredProcess]: Starting monitored process 112 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) [2023-02-14 14:43:06,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2023-02-14 14:43:06,181 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-14 14:43:06,182 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 14:43:06,195 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-14 14:43:06,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2023-02-14 14:43:06,199 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 14:43:06,199 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 14:43:06,199 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 14:43:06,199 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 14:43:06,199 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-14 14:43:06,199 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:06,199 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 14:43:06,199 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 14:43:06,199 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration12_Loop [2023-02-14 14:43:06,199 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 14:43:06,199 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 14:43:06,200 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:06,226 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:06,228 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:06,229 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:06,231 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:06,232 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:06,325 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 14:43:06,326 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-14 14:43:06,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:06,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:06,327 INFO L229 MonitoredProcess]: Starting monitored process 113 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) [2023-02-14 14:43:06,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2023-02-14 14:43:06,330 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 [2023-02-14 14:43:06,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:43:06,336 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:43:06,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:43:06,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:43:06,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:43:06,338 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 14:43:06,338 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:43:06,341 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-14 14:43:06,345 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-02-14 14:43:06,345 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-14 14:43:06,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:06,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:06,348 INFO L229 MonitoredProcess]: Starting monitored process 114 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) [2023-02-14 14:43:06,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2023-02-14 14:43:06,349 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-14 14:43:06,349 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-14 14:43:06,350 INFO L513 LassoAnalysis]: Proved termination. [2023-02-14 14:43:06,350 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1, ULTIMATE.start_main_~x~0#1) = -1*ULTIMATE.start_main_~k~0#1 + 1*ULTIMATE.start_main_~x~0#1 Supporting invariants [] [2023-02-14 14:43:06,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2023-02-14 14:43:06,353 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-14 14:43:06,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:43:06,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:43:06,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-14 14:43:06,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:43:06,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:43:06,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-14 14:43:06,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:43:06,761 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2023-02-14 14:43:06,762 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2023-02-14 14:43:06,762 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 529 states and 699 transitions. cyclomatic complexity: 181 Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) [2023-02-14 14:43:06,859 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 529 states and 699 transitions. cyclomatic complexity: 181. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) Result 711 states and 920 transitions. Complement of second has 15 states. [2023-02-14 14:43:06,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2023-02-14 14:43:06,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) [2023-02-14 14:43:06,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2023-02-14 14:43:06,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 48 transitions. Stem has 38 letters. Loop has 50 letters. [2023-02-14 14:43:06,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 14:43:06,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 48 transitions. Stem has 88 letters. Loop has 50 letters. [2023-02-14 14:43:06,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 14:43:06,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 48 transitions. Stem has 38 letters. Loop has 100 letters. [2023-02-14 14:43:06,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 14:43:06,867 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 711 states and 920 transitions. [2023-02-14 14:43:06,875 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 40 [2023-02-14 14:43:06,882 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 711 states to 705 states and 913 transitions. [2023-02-14 14:43:06,883 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 257 [2023-02-14 14:43:06,884 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 259 [2023-02-14 14:43:06,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 705 states and 913 transitions. [2023-02-14 14:43:06,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 14:43:06,884 INFO L218 hiAutomatonCegarLoop]: Abstraction has 705 states and 913 transitions. [2023-02-14 14:43:06,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states and 913 transitions. [2023-02-14 14:43:06,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 675. [2023-02-14 14:43:06,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 456 states have (on average 1.094298245614035) internal successors, (499), 464 states have internal predecessors, (499), 133 states have call successors, (135), 59 states have call predecessors, (135), 86 states have return successors, (247), 151 states have call predecessors, (247), 130 states have call successors, (247) [2023-02-14 14:43:06,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 881 transitions. [2023-02-14 14:43:06,911 INFO L240 hiAutomatonCegarLoop]: Abstraction has 675 states and 881 transitions. [2023-02-14 14:43:06,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 14:43:06,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 14:43:06,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-14 14:43:06,912 INFO L87 Difference]: Start difference. First operand 675 states and 881 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 5 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2023-02-14 14:43:07,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:43:07,022 INFO L93 Difference]: Finished difference Result 693 states and 889 transitions. [2023-02-14 14:43:07,022 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 693 states and 889 transitions. [2023-02-14 14:43:07,027 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 40 [2023-02-14 14:43:07,060 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 693 states to 675 states and 864 transitions. [2023-02-14 14:43:07,060 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 250 [2023-02-14 14:43:07,060 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 250 [2023-02-14 14:43:07,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 675 states and 864 transitions. [2023-02-14 14:43:07,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 14:43:07,060 INFO L218 hiAutomatonCegarLoop]: Abstraction has 675 states and 864 transitions. [2023-02-14 14:43:07,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states and 864 transitions. [2023-02-14 14:43:07,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 667. [2023-02-14 14:43:07,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 451 states have (on average 1.0886917960088691) internal successors, (491), 461 states have internal predecessors, (491), 130 states have call successors, (132), 59 states have call predecessors, (132), 86 states have return successors, (231), 146 states have call predecessors, (231), 126 states have call successors, (231) [2023-02-14 14:43:07,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 854 transitions. [2023-02-14 14:43:07,083 INFO L240 hiAutomatonCegarLoop]: Abstraction has 667 states and 854 transitions. [2023-02-14 14:43:07,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Ended with exit code 0 [2023-02-14 14:43:07,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 14:43:07,085 INFO L428 stractBuchiCegarLoop]: Abstraction has 667 states and 854 transitions. [2023-02-14 14:43:07,085 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2023-02-14 14:43:07,085 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 667 states and 854 transitions. [2023-02-14 14:43:07,089 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 40 [2023-02-14 14:43:07,089 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 14:43:07,089 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 14:43:07,090 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 8, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:43:07,090 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-02-14 14:43:07,090 INFO L748 eck$LassoCheckResult]: Stem: 13223#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 13161#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 13162#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 13182#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 13171#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 13172#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 13597#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 13594#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 13595#$Ultimate##0 ~n := #in~n; 13600#L25 assume ~n <= 0;#res := 1; 13598#factFINAL assume true; 13593#factEXIT >#68#return; 13589#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 13591#$Ultimate##0 ~n := #in~n; 13596#L25 assume ~n <= 0;#res := 1; 13592#factFINAL assume true; 13588#factEXIT >#70#return; 13590#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 13591#$Ultimate##0 ~n := #in~n; 13596#L25 assume ~n <= 0;#res := 1; 13592#factFINAL assume true; 13588#factEXIT >#72#return; 13586#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 13580#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 13578#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 13576#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 13575#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 13527#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 13528#$Ultimate##0 ~n := #in~n; 13720#L25 assume !(~n <= 0); 13573#L26 call #t~ret0 := fact(~n - 1);< 13574#$Ultimate##0 ~n := #in~n; 13637#L25 assume ~n <= 0;#res := 1; 13638#factFINAL assume true; 13572#factEXIT >#66#return; 13571#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 13569#factFINAL assume true; 13526#factEXIT >#74#return; 13521#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 13523#$Ultimate##0 ~n := #in~n; 13613#L25 assume ~n <= 0;#res := 1; 13607#factFINAL assume true; 13566#factEXIT >#76#return; 13195#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 13525#$Ultimate##0 ~n := #in~n; 13587#L25 assume !(~n <= 0); 13582#L26 call #t~ret0 := fact(~n - 1);< 13585#$Ultimate##0 ~n := #in~n; 13601#L25 assume ~n <= 0;#res := 1; 13602#factFINAL assume true; 13603#factEXIT >#66#return; 13194#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 13198#factFINAL assume true; 13510#factEXIT >#78#return; 13511#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 13501#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 13502#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 13494#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 13489#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 13485#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 13383#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 13379#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 13373#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 13378#$Ultimate##0 ~n := #in~n; 13386#L25 assume !(~n <= 0); 13252#L26 call #t~ret0 := fact(~n - 1);< 13263#$Ultimate##0 [2023-02-14 14:43:07,090 INFO L750 eck$LassoCheckResult]: Loop: 13263#$Ultimate##0 ~n := #in~n; 13290#L25 assume !(~n <= 0); 13254#L26 call #t~ret0 := fact(~n - 1);< 13263#$Ultimate##0 [2023-02-14 14:43:07,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:43:07,091 INFO L85 PathProgramCache]: Analyzing trace with hash -665529474, now seen corresponding path program 2 times [2023-02-14 14:43:07,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:43:07,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533534395] [2023-02-14 14:43:07,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:43:07,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:43:07,098 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 14:43:07,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1389297213] [2023-02-14 14:43:07,098 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 14:43:07,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 14:43:07,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:07,100 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 14:43:07,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Waiting until timeout for monitored process [2023-02-14 14:43:07,181 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 14:43:07,181 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-02-14 14:43:07,181 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:43:07,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:43:07,214 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:43:07,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:43:07,215 INFO L85 PathProgramCache]: Analyzing trace with hash 29980, now seen corresponding path program 2 times [2023-02-14 14:43:07,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:43:07,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963455887] [2023-02-14 14:43:07,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:43:07,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:43:07,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:43:07,218 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:43:07,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:43:07,219 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:43:07,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:43:07,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1219521409, now seen corresponding path program 3 times [2023-02-14 14:43:07,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:43:07,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174632512] [2023-02-14 14:43:07,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:43:07,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:43:07,226 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 14:43:07,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1688348095] [2023-02-14 14:43:07,227 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-14 14:43:07,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 14:43:07,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:07,229 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 14:43:07,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (116)] Waiting until timeout for monitored process [2023-02-14 14:43:07,273 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-02-14 14:43:07,273 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 14:43:07,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-14 14:43:07,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:43:07,334 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2023-02-14 14:43:07,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 14:43:07,412 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2023-02-14 14:43:07,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:43:07,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174632512] [2023-02-14 14:43:07,413 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 14:43:07,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688348095] [2023-02-14 14:43:07,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688348095] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 14:43:07,413 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 14:43:07,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2023-02-14 14:43:07,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680658076] [2023-02-14 14:43:07,414 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 14:43:07,437 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 14:43:07,437 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 14:43:07,437 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 14:43:07,437 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 14:43:07,437 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-14 14:43:07,437 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:07,437 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 14:43:07,438 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 14:43:07,438 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration13_Loop [2023-02-14 14:43:07,438 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 14:43:07,438 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 14:43:07,439 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:07,441 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:07,442 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:07,447 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:07,468 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 14:43:07,468 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-14 14:43:07,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:07,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:07,475 INFO L229 MonitoredProcess]: Starting monitored process 117 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) [2023-02-14 14:43:07,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2023-02-14 14:43:07,478 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 14:43:07,478 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 14:43:07,486 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 14:43:07,486 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_#t~ret0=0} Honda state: {fact_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-14 14:43:07,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Forceful destruction successful, exit code 0 [2023-02-14 14:43:07,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:07,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:07,490 INFO L229 MonitoredProcess]: Starting monitored process 118 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) [2023-02-14 14:43:07,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2023-02-14 14:43:07,493 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 14:43:07,493 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 14:43:07,509 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 14:43:07,509 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_~n=0} Honda state: {fact_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-14 14:43:07,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Forceful destruction successful, exit code 0 [2023-02-14 14:43:07,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:07,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:07,515 INFO L229 MonitoredProcess]: Starting monitored process 119 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) [2023-02-14 14:43:07,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2023-02-14 14:43:07,518 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 14:43:07,518 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 14:43:07,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Ended with exit code 0 [2023-02-14 14:43:07,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:07,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:07,530 INFO L229 MonitoredProcess]: Starting monitored process 120 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) [2023-02-14 14:43:07,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2023-02-14 14:43:07,533 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-14 14:43:07,533 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 14:43:07,582 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-14 14:43:07,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Ended with exit code 0 [2023-02-14 14:43:07,586 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 14:43:07,586 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 14:43:07,586 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 14:43:07,586 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 14:43:07,586 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-14 14:43:07,586 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:07,586 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 14:43:07,586 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 14:43:07,586 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration13_Loop [2023-02-14 14:43:07,586 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 14:43:07,586 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 14:43:07,587 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:07,588 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:07,590 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:07,593 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:07,609 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 14:43:07,609 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-14 14:43:07,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:07,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:07,611 INFO L229 MonitoredProcess]: Starting monitored process 121 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) [2023-02-14 14:43:07,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2023-02-14 14:43:07,614 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 [2023-02-14 14:43:07,619 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:43:07,620 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:43:07,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:43:07,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:43:07,620 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:43:07,620 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 14:43:07,620 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:43:07,622 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:43:07,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Forceful destruction successful, exit code 0 [2023-02-14 14:43:07,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:07,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:07,626 INFO L229 MonitoredProcess]: Starting monitored process 122 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) [2023-02-14 14:43:07,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2023-02-14 14:43:07,630 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 [2023-02-14 14:43:07,637 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:43:07,637 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:43:07,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:43:07,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:43:07,637 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:43:07,638 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 14:43:07,638 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:43:07,639 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:43:07,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Ended with exit code 0 [2023-02-14 14:43:07,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:07,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:07,644 INFO L229 MonitoredProcess]: Starting monitored process 123 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) [2023-02-14 14:43:07,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2023-02-14 14:43:07,647 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 [2023-02-14 14:43:07,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:43:07,653 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:43:07,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:43:07,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:43:07,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:43:07,653 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 14:43:07,653 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:43:07,655 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-14 14:43:07,656 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-14 14:43:07,656 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-14 14:43:07,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:07,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:07,659 INFO L229 MonitoredProcess]: Starting monitored process 124 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) [2023-02-14 14:43:07,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2023-02-14 14:43:07,661 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-14 14:43:07,661 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-14 14:43:07,661 INFO L513 LassoAnalysis]: Proved termination. [2023-02-14 14:43:07,661 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fact_#in~n) = 1*fact_#in~n Supporting invariants [] [2023-02-14 14:43:07,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Forceful destruction successful, exit code 0 [2023-02-14 14:43:07,665 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-14 14:43:07,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:43:07,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:43:07,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-14 14:43:07,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:43:08,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Forceful destruction successful, exit code 0 [2023-02-14 14:43:08,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:43:08,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-14 14:43:08,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:43:08,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 14:43:08,059 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2023-02-14 14:43:08,059 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 667 states and 854 transitions. cyclomatic complexity: 204 Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-14 14:43:08,137 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 667 states and 854 transitions. cyclomatic complexity: 204. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Result 691 states and 882 transitions. Complement of second has 13 states. [2023-02-14 14:43:08,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2023-02-14 14:43:08,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-14 14:43:08,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2023-02-14 14:43:08,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 66 letters. Loop has 3 letters. [2023-02-14 14:43:08,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 14:43:08,140 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-14 14:43:08,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:43:08,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:43:08,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-14 14:43:08,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:43:08,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:43:08,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-14 14:43:08,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:43:08,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 14:43:08,497 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2023-02-14 14:43:08,497 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 667 states and 854 transitions. cyclomatic complexity: 204 Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-14 14:43:08,558 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 667 states and 854 transitions. cyclomatic complexity: 204. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Result 691 states and 882 transitions. Complement of second has 13 states. [2023-02-14 14:43:08,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2023-02-14 14:43:08,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-14 14:43:08,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2023-02-14 14:43:08,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 66 letters. Loop has 3 letters. [2023-02-14 14:43:08,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 14:43:08,559 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-14 14:43:08,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:43:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:43:08,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-14 14:43:08,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:43:08,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:43:08,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-14 14:43:08,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:43:08,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 14:43:08,899 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2023-02-14 14:43:08,899 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 667 states and 854 transitions. cyclomatic complexity: 204 Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-14 14:43:08,983 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 667 states and 854 transitions. cyclomatic complexity: 204. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Result 809 states and 1014 transitions. Complement of second has 16 states. [2023-02-14 14:43:08,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2023-02-14 14:43:08,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-14 14:43:08,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2023-02-14 14:43:08,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 66 letters. Loop has 3 letters. [2023-02-14 14:43:08,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 14:43:08,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 69 letters. Loop has 3 letters. [2023-02-14 14:43:08,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 14:43:08,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 66 letters. Loop has 6 letters. [2023-02-14 14:43:08,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 14:43:08,986 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 809 states and 1014 transitions. [2023-02-14 14:43:08,994 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2023-02-14 14:43:08,998 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 809 states to 604 states and 785 transitions. [2023-02-14 14:43:08,999 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 183 [2023-02-14 14:43:08,999 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 185 [2023-02-14 14:43:08,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 604 states and 785 transitions. [2023-02-14 14:43:08,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 14:43:08,999 INFO L218 hiAutomatonCegarLoop]: Abstraction has 604 states and 785 transitions. [2023-02-14 14:43:09,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states and 785 transitions. [2023-02-14 14:43:09,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 592. [2023-02-14 14:43:09,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 408 states have (on average 1.088235294117647) internal successors, (444), 412 states have internal predecessors, (444), 110 states have call successors, (111), 51 states have call predecessors, (111), 74 states have return successors, (206), 128 states have call predecessors, (206), 110 states have call successors, (206) [2023-02-14 14:43:09,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 761 transitions. [2023-02-14 14:43:09,018 INFO L240 hiAutomatonCegarLoop]: Abstraction has 592 states and 761 transitions. [2023-02-14 14:43:09,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 14:43:09,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-14 14:43:09,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-02-14 14:43:09,019 INFO L87 Difference]: Start difference. First operand 592 states and 761 transitions. Second operand has 9 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-14 14:43:09,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:43:09,159 INFO L93 Difference]: Finished difference Result 925 states and 1217 transitions. [2023-02-14 14:43:09,159 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 925 states and 1217 transitions. [2023-02-14 14:43:09,167 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 50 [2023-02-14 14:43:09,174 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 925 states to 855 states and 1122 transitions. [2023-02-14 14:43:09,175 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 289 [2023-02-14 14:43:09,175 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 289 [2023-02-14 14:43:09,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 855 states and 1122 transitions. [2023-02-14 14:43:09,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 14:43:09,176 INFO L218 hiAutomatonCegarLoop]: Abstraction has 855 states and 1122 transitions. [2023-02-14 14:43:09,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states and 1122 transitions. [2023-02-14 14:43:09,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 763. [2023-02-14 14:43:09,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 763 states, 521 states have (on average 1.0767754318618041) internal successors, (561), 528 states have internal predecessors, (561), 153 states have call successors, (154), 66 states have call predecessors, (154), 89 states have return successors, (263), 168 states have call predecessors, (263), 153 states have call successors, (263) [2023-02-14 14:43:09,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 978 transitions. [2023-02-14 14:43:09,199 INFO L240 hiAutomatonCegarLoop]: Abstraction has 763 states and 978 transitions. [2023-02-14 14:43:09,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-14 14:43:09,200 INFO L428 stractBuchiCegarLoop]: Abstraction has 763 states and 978 transitions. [2023-02-14 14:43:09,200 INFO L335 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2023-02-14 14:43:09,200 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 763 states and 978 transitions. [2023-02-14 14:43:09,204 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2023-02-14 14:43:09,204 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 14:43:09,204 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 14:43:09,205 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [13, 13, 10, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:43:09,205 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:43:09,206 INFO L748 eck$LassoCheckResult]: Stem: 18716#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 18661#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 18662#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 18683#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 18673#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 18674#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 18922#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 18908#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 18909#$Ultimate##0 ~n := #in~n; 18913#L25 assume ~n <= 0;#res := 1; 18910#factFINAL assume true; 18907#factEXIT >#68#return; 18897#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 18899#$Ultimate##0 ~n := #in~n; 18912#L25 assume ~n <= 0;#res := 1; 18906#factFINAL assume true; 18896#factEXIT >#70#return; 18898#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 18899#$Ultimate##0 ~n := #in~n; 18912#L25 assume ~n <= 0;#res := 1; 18906#factFINAL assume true; 18896#factEXIT >#72#return; 18892#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 18889#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 18884#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 18877#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 18873#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 18868#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 18871#$Ultimate##0 ~n := #in~n; 18969#L25 assume !(~n <= 0); 18967#L26 call #t~ret0 := fact(~n - 1);< 18968#$Ultimate##0 ~n := #in~n; 18976#L25 assume ~n <= 0;#res := 1; 18977#factFINAL assume true; 18966#factEXIT >#66#return; 18965#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 18964#factFINAL assume true; 18867#factEXIT >#74#return; 18869#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 18919#$Ultimate##0 ~n := #in~n; 18950#L25 assume ~n <= 0;#res := 1; 18948#factFINAL assume true; 18930#factEXIT >#76#return; 18852#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 18854#$Ultimate##0 ~n := #in~n; 18888#L25 assume !(~n <= 0); 18880#L26 call #t~ret0 := fact(~n - 1);< 18883#$Ultimate##0 ~n := #in~n; 18895#L25 assume ~n <= 0;#res := 1; 18921#factFINAL assume true; 18915#factEXIT >#66#return; 18914#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 18911#factFINAL assume true; 18850#factEXIT >#78#return; 18849#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 18848#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 18847#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 18846#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 18795#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 18796#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 18824#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 18821#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 18801#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 18811#$Ultimate##0 ~n := #in~n; 18952#L25 assume ~n <= 0;#res := 1; 19227#factFINAL assume true; 19225#factEXIT >#68#return; 19217#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 19222#$Ultimate##0 ~n := #in~n; 19226#L25 assume ~n <= 0;#res := 1; 19224#factFINAL assume true; 19223#factEXIT >#70#return; 19218#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 19222#$Ultimate##0 ~n := #in~n; 19226#L25 assume ~n <= 0;#res := 1; 19224#factFINAL assume true; 19223#factEXIT >#72#return; 18679#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 18680#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 19396#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 19394#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 19392#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 18720#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 18636#$Ultimate##0 ~n := #in~n; 18748#L25 assume !(~n <= 0); 18726#L26 call #t~ret0 := fact(~n - 1);< 18740#$Ultimate##0 ~n := #in~n; 18746#L25 assume ~n <= 0;#res := 1; 18749#factFINAL assume true; 18725#factEXIT >#66#return; 18732#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 19373#factFINAL assume true; 18719#factEXIT >#74#return; 18711#L30-6 [2023-02-14 14:43:09,206 INFO L750 eck$LassoCheckResult]: Loop: 18711#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 18712#$Ultimate##0 ~n := #in~n; 18766#L25 assume ~n <= 0;#res := 1; 18771#factFINAL assume true; 18770#factEXIT >#76#return; 18717#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 18636#$Ultimate##0 ~n := #in~n; 18748#L25 assume !(~n <= 0); 18726#L26 call #t~ret0 := fact(~n - 1);< 18740#$Ultimate##0 ~n := #in~n; 18745#L25 assume !(~n <= 0); 18742#L26 call #t~ret0 := fact(~n - 1);< 18744#$Ultimate##0 ~n := #in~n; 18747#L25 assume ~n <= 0;#res := 1; 18757#factFINAL assume true; 18751#factEXIT >#66#return; 18750#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 18741#factFINAL assume true; 18743#factEXIT >#66#return; 18724#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 18722#factFINAL assume true; 18723#factEXIT >#78#return; 18721#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 18684#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 18685#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 18696#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 18688#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 18635#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 18636#$Ultimate##0 ~n := #in~n; 18748#L25 assume !(~n <= 0); 18726#L26 call #t~ret0 := fact(~n - 1);< 18740#$Ultimate##0 ~n := #in~n; 18745#L25 assume !(~n <= 0); 18742#L26 call #t~ret0 := fact(~n - 1);< 18744#$Ultimate##0 ~n := #in~n; 18747#L25 assume ~n <= 0;#res := 1; 18757#factFINAL assume true; 18751#factEXIT >#66#return; 18750#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 18741#factFINAL assume true; 18743#factEXIT >#66#return; 18724#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 18722#factFINAL assume true; 18723#factEXIT >#74#return; 18711#L30-6 [2023-02-14 14:43:09,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:43:09,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1955062330, now seen corresponding path program 4 times [2023-02-14 14:43:09,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:43:09,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618047578] [2023-02-14 14:43:09,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:43:09,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:43:09,215 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 14:43:09,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1591994733] [2023-02-14 14:43:09,215 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-14 14:43:09,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 14:43:09,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:09,234 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 14:43:09,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Waiting until timeout for monitored process [2023-02-14 14:43:09,295 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-14 14:43:09,295 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 14:43:09,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-14 14:43:09,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:43:09,348 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 192 proven. 1 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2023-02-14 14:43:09,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 14:43:09,464 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 44 proven. 13 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2023-02-14 14:43:09,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:43:09,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618047578] [2023-02-14 14:43:09,465 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 14:43:09,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591994733] [2023-02-14 14:43:09,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591994733] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 14:43:09,465 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 14:43:09,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2023-02-14 14:43:09,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141050786] [2023-02-14 14:43:09,465 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 14:43:09,466 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-14 14:43:09,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:43:09,466 INFO L85 PathProgramCache]: Analyzing trace with hash 49690164, now seen corresponding path program 2 times [2023-02-14 14:43:09,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:43:09,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339548339] [2023-02-14 14:43:09,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:43:09,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:43:09,474 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 14:43:09,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [793070912] [2023-02-14 14:43:09,475 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 14:43:09,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 14:43:09,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:09,476 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 14:43:09,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (126)] Waiting until timeout for monitored process [2023-02-14 14:43:09,519 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 14:43:09,519 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-02-14 14:43:09,519 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:43:09,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:43:09,538 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:43:10,055 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 14:43:10,055 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 14:43:10,055 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 14:43:10,055 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 14:43:10,055 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-14 14:43:10,055 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:10,055 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 14:43:10,055 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 14:43:10,055 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration14_Loop [2023-02-14 14:43:10,056 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 14:43:10,056 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 14:43:10,056 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:10,081 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:10,082 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:10,084 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:10,086 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:10,088 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:10,181 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 14:43:10,181 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-14 14:43:10,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:10,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:10,186 INFO L229 MonitoredProcess]: Starting monitored process 127 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) [2023-02-14 14:43:10,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2023-02-14 14:43:10,190 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 14:43:10,190 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 14:43:10,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Forceful destruction successful, exit code 0 [2023-02-14 14:43:10,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:10,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:10,202 INFO L229 MonitoredProcess]: Starting monitored process 128 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) [2023-02-14 14:43:10,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2023-02-14 14:43:10,206 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-14 14:43:10,206 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 14:43:10,228 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-14 14:43:10,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Forceful destruction successful, exit code 0 [2023-02-14 14:43:10,231 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 14:43:10,231 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 14:43:10,231 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 14:43:10,232 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 14:43:10,232 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-14 14:43:10,232 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:10,232 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 14:43:10,232 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 14:43:10,232 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration14_Loop [2023-02-14 14:43:10,232 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 14:43:10,232 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 14:43:10,233 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:10,234 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:10,254 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:10,255 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:10,257 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:10,259 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:10,344 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 14:43:10,344 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-14 14:43:10,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:10,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:10,346 INFO L229 MonitoredProcess]: Starting monitored process 129 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) [2023-02-14 14:43:10,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2023-02-14 14:43:10,349 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 [2023-02-14 14:43:10,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:43:10,355 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:43:10,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:43:10,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:43:10,355 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:43:10,355 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 14:43:10,355 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:43:10,356 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:43:10,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Ended with exit code 0 [2023-02-14 14:43:10,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:10,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:10,360 INFO L229 MonitoredProcess]: Starting monitored process 130 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) [2023-02-14 14:43:10,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2023-02-14 14:43:10,363 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 [2023-02-14 14:43:10,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:43:10,369 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:43:10,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:43:10,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:43:10,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:43:10,371 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 14:43:10,371 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:43:10,374 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-14 14:43:10,377 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-14 14:43:10,377 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-14 14:43:10,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:10,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:10,380 INFO L229 MonitoredProcess]: Starting monitored process 131 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) [2023-02-14 14:43:10,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2023-02-14 14:43:10,381 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-14 14:43:10,381 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-14 14:43:10,381 INFO L513 LassoAnalysis]: Proved termination. [2023-02-14 14:43:10,381 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 3 Supporting invariants [] [2023-02-14 14:43:10,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Forceful destruction successful, exit code 0 [2023-02-14 14:43:10,384 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-14 14:43:10,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:43:10,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:43:10,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-14 14:43:10,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:43:10,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Forceful destruction successful, exit code 0 [2023-02-14 14:43:10,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:43:10,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-14 14:43:10,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:43:11,088 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 44 proven. 7 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-02-14 14:43:11,089 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 8 loop predicates [2023-02-14 14:43:11,089 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 763 states and 978 transitions. cyclomatic complexity: 228 Second operand has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 10 states have internal predecessors, (38), 7 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2023-02-14 14:43:11,297 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 763 states and 978 transitions. cyclomatic complexity: 228. Second operand has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 10 states have internal predecessors, (38), 7 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) Result 998 states and 1261 transitions. Complement of second has 49 states. [2023-02-14 14:43:11,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 8 non-accepting loop states 1 accepting loop states [2023-02-14 14:43:11,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 10 states have internal predecessors, (38), 7 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2023-02-14 14:43:11,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 66 transitions. [2023-02-14 14:43:11,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 66 transitions. Stem has 93 letters. Loop has 44 letters. [2023-02-14 14:43:11,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 14:43:11,301 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-14 14:43:11,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:43:11,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:43:11,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-14 14:43:11,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:43:11,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:43:11,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-14 14:43:11,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:43:11,997 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 44 proven. 7 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-02-14 14:43:11,998 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 8 loop predicates [2023-02-14 14:43:11,998 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 763 states and 978 transitions. cyclomatic complexity: 228 Second operand has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 10 states have internal predecessors, (38), 7 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2023-02-14 14:43:12,186 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 763 states and 978 transitions. cyclomatic complexity: 228. Second operand has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 10 states have internal predecessors, (38), 7 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) Result 998 states and 1261 transitions. Complement of second has 49 states. [2023-02-14 14:43:12,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 8 non-accepting loop states 1 accepting loop states [2023-02-14 14:43:12,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 10 states have internal predecessors, (38), 7 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2023-02-14 14:43:12,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 66 transitions. [2023-02-14 14:43:12,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 66 transitions. Stem has 93 letters. Loop has 44 letters. [2023-02-14 14:43:12,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 14:43:12,188 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-14 14:43:12,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:43:12,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:43:12,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-14 14:43:12,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:43:12,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:43:12,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-14 14:43:12,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:43:12,830 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 44 proven. 7 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-02-14 14:43:12,830 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 8 loop predicates [2023-02-14 14:43:12,831 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 763 states and 978 transitions. cyclomatic complexity: 228 Second operand has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 10 states have internal predecessors, (38), 7 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2023-02-14 14:43:13,062 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 763 states and 978 transitions. cyclomatic complexity: 228. Second operand has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 10 states have internal predecessors, (38), 7 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) Result 2010 states and 2525 transitions. Complement of second has 78 states. [2023-02-14 14:43:13,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 8 non-accepting loop states 1 accepting loop states [2023-02-14 14:43:13,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 10 states have internal predecessors, (38), 7 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2023-02-14 14:43:13,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 81 transitions. [2023-02-14 14:43:13,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 81 transitions. Stem has 93 letters. Loop has 44 letters. [2023-02-14 14:43:13,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 14:43:13,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 81 transitions. Stem has 137 letters. Loop has 44 letters. [2023-02-14 14:43:13,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 14:43:13,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 81 transitions. Stem has 93 letters. Loop has 88 letters. [2023-02-14 14:43:13,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 14:43:13,066 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2010 states and 2525 transitions. [2023-02-14 14:43:13,083 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2023-02-14 14:43:13,099 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2010 states to 1729 states and 2216 transitions. [2023-02-14 14:43:13,099 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 388 [2023-02-14 14:43:13,100 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 392 [2023-02-14 14:43:13,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1729 states and 2216 transitions. [2023-02-14 14:43:13,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 14:43:13,100 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1729 states and 2216 transitions. [2023-02-14 14:43:13,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1729 states and 2216 transitions. [2023-02-14 14:43:13,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1729 to 1162. [2023-02-14 14:43:13,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1162 states, 783 states have (on average 1.08301404853129) internal successors, (848), 803 states have internal predecessors, (848), 222 states have call successors, (230), 118 states have call predecessors, (230), 157 states have return successors, (397), 240 states have call predecessors, (397), 222 states have call successors, (397) [2023-02-14 14:43:13,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 1475 transitions. [2023-02-14 14:43:13,174 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1162 states and 1475 transitions. [2023-02-14 14:43:13,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 14:43:13,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-14 14:43:13,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-02-14 14:43:13,175 INFO L87 Difference]: Start difference. First operand 1162 states and 1475 transitions. Second operand has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2023-02-14 14:43:13,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:43:13,325 INFO L93 Difference]: Finished difference Result 903 states and 1119 transitions. [2023-02-14 14:43:13,325 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 903 states and 1119 transitions. [2023-02-14 14:43:13,331 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2023-02-14 14:43:13,336 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 903 states to 667 states and 821 transitions. [2023-02-14 14:43:13,336 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 175 [2023-02-14 14:43:13,337 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 187 [2023-02-14 14:43:13,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 667 states and 821 transitions. [2023-02-14 14:43:13,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 14:43:13,337 INFO L218 hiAutomatonCegarLoop]: Abstraction has 667 states and 821 transitions. [2023-02-14 14:43:13,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states and 821 transitions. [2023-02-14 14:43:13,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 649. [2023-02-14 14:43:13,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 437 states have (on average 1.0869565217391304) internal successors, (475), 452 states have internal predecessors, (475), 116 states have call successors, (122), 72 states have call predecessors, (122), 96 states have return successors, (204), 124 states have call predecessors, (204), 116 states have call successors, (204) [2023-02-14 14:43:13,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 801 transitions. [2023-02-14 14:43:13,352 INFO L240 hiAutomatonCegarLoop]: Abstraction has 649 states and 801 transitions. [2023-02-14 14:43:13,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 14:43:13,353 INFO L428 stractBuchiCegarLoop]: Abstraction has 649 states and 801 transitions. [2023-02-14 14:43:13,353 INFO L335 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2023-02-14 14:43:13,353 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 649 states and 801 transitions. [2023-02-14 14:43:13,356 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2023-02-14 14:43:13,356 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 14:43:13,356 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 14:43:13,363 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [22, 22, 14, 8, 8, 8, 8, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:43:13,363 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:43:13,364 INFO L748 eck$LassoCheckResult]: Stem: 27596#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 27544#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 27545#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 27569#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 27597#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 27785#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 27783#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 27780#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 27781#$Ultimate##0 ~n := #in~n; 27784#L25 assume ~n <= 0;#res := 1; 27782#factFINAL assume true; 27779#factEXIT >#68#return; 27774#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 27776#$Ultimate##0 ~n := #in~n; 27778#L25 assume ~n <= 0;#res := 1; 27777#factFINAL assume true; 27773#factEXIT >#70#return; 27775#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 27776#$Ultimate##0 ~n := #in~n; 27778#L25 assume ~n <= 0;#res := 1; 27777#factFINAL assume true; 27773#factEXIT >#72#return; 27772#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 27770#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 27766#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 27763#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 27760#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 27751#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 27752#$Ultimate##0 ~n := #in~n; 27771#L25 assume !(~n <= 0); 27768#L26 call #t~ret0 := fact(~n - 1);< 27769#$Ultimate##0 ~n := #in~n; 28015#L25 assume ~n <= 0;#res := 1; 28016#factFINAL assume true; 27767#factEXIT >#66#return; 27765#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 27759#factFINAL assume true; 27750#factEXIT >#74#return; 27635#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 27745#$Ultimate##0 ~n := #in~n; 27901#L25 assume ~n <= 0;#res := 1; 27900#factFINAL assume true; 27634#factEXIT >#76#return; 27612#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 27613#$Ultimate##0 ~n := #in~n; 27713#L25 assume !(~n <= 0); 27676#L26 call #t~ret0 := fact(~n - 1);< 27681#$Ultimate##0 ~n := #in~n; 27714#L25 assume ~n <= 0;#res := 1; 27712#factFINAL assume true; 27675#factEXIT >#66#return; 27633#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 27624#factFINAL assume true; 27611#factEXIT >#78#return; 27609#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 27607#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 27605#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 27602#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 27563#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 27557#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 27559#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 28141#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 27551#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 27588#$Ultimate##0 ~n := #in~n; 27589#L25 assume !(~n <= 0); 27550#L26 call #t~ret0 := fact(~n - 1);< 27553#$Ultimate##0 ~n := #in~n; 28097#L25 assume ~n <= 0;#res := 1; 28136#factFINAL assume true; 28117#factEXIT >#66#return; 28118#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 28138#factFINAL assume true; 28119#factEXIT >#68#return; 28101#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 27585#$Ultimate##0 ~n := #in~n; 28110#L25 assume ~n <= 0;#res := 1; 28098#factFINAL assume true; 28104#factEXIT >#70#return; 28108#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 27529#$Ultimate##0 ~n := #in~n; 28140#L25 assume !(~n <= 0); 27517#L26 call #t~ret0 := fact(~n - 1);< 27913#$Ultimate##0 ~n := #in~n; 27581#L25 assume ~n <= 0;#res := 1; 27582#factFINAL assume true; 27516#factEXIT >#66#return; 27521#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 28137#factFINAL assume true; 28134#factEXIT >#72#return; 28133#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 28132#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 28131#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 28126#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 28124#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 27980#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 28113#$Ultimate##0 ~n := #in~n; 27979#L25 assume !(~n <= 0); 27981#L26 call #t~ret0 := fact(~n - 1);< 27553#$Ultimate##0 ~n := #in~n; 28097#L25 assume ~n <= 0;#res := 1; 28136#factFINAL assume true; 28117#factEXIT >#66#return; 28116#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 28114#factFINAL assume true; 28111#factEXIT >#68#return; 27533#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 28109#$Ultimate##0 ~n := #in~n; 28105#L25 assume !(~n <= 0); 27519#L26 call #t~ret0 := fact(~n - 1);< 27913#$Ultimate##0 ~n := #in~n; 27581#L25 assume ~n <= 0;#res := 1; 27582#factFINAL assume true; 27516#factEXIT >#66#return; 27520#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 27532#factFINAL assume true; 27537#factEXIT >#70#return; 27534#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 28109#$Ultimate##0 ~n := #in~n; 28105#L25 assume ~n <= 0;#res := 1; 28106#factFINAL assume true; 27811#factEXIT >#72#return; 27804#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 27800#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 27796#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 27788#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 27786#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 27512#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 27513#$Ultimate##0 ~n := #in~n; 27914#L25 assume !(~n <= 0); 27518#L26 call #t~ret0 := fact(~n - 1);< 27913#$Ultimate##0 ~n := #in~n; 27924#L25 assume !(~n <= 0); 27909#L26 call #t~ret0 := fact(~n - 1);< 27918#$Ultimate##0 ~n := #in~n; 27925#L25 assume ~n <= 0;#res := 1; 27923#factFINAL assume true; 27922#factEXIT >#66#return; 27910#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 27917#factFINAL assume true; 27908#factEXIT >#66#return; 27904#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 27902#factFINAL assume true; 27787#factEXIT >#74#return; 27591#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 27593#$Ultimate##0 ~n := #in~n; 27883#L25 assume ~n <= 0;#res := 1; 27884#factFINAL assume true; 27621#factEXIT >#76#return; 27598#L30-7 [2023-02-14 14:43:13,365 INFO L750 eck$LassoCheckResult]: Loop: 27598#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 27599#$Ultimate##0 ~n := #in~n; 27669#L25 assume !(~n <= 0); 27654#L26 call #t~ret0 := fact(~n - 1);< 27658#$Ultimate##0 ~n := #in~n; 27699#L25 assume ~n <= 0;#res := 1; 27718#factFINAL assume true; 27651#factEXIT >#66#return; 27649#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 27647#factFINAL assume true; 27646#factEXIT >#78#return; 27546#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 27547#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 27570#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 27645#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 27641#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 27639#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 27640#$Ultimate##0 ~n := #in~n; 27720#L25 assume !(~n <= 0); 27653#L26 call #t~ret0 := fact(~n - 1);< 27658#$Ultimate##0 ~n := #in~n; 27697#L25 assume !(~n <= 0); 27685#L26 call #t~ret0 := fact(~n - 1);< 27691#$Ultimate##0 ~n := #in~n; 27697#L25 assume !(~n <= 0); 27685#L26 call #t~ret0 := fact(~n - 1);< 27691#$Ultimate##0 ~n := #in~n; 27700#L25 assume ~n <= 0;#res := 1; 27722#factFINAL assume true; 27721#factEXIT >#66#return; 27719#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 27717#factFINAL assume true; 27715#factEXIT >#66#return; 27686#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 27690#factFINAL assume true; 27684#factEXIT >#66#return; 27683#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 27682#factFINAL assume true; 27638#factEXIT >#74#return; 27620#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 27623#$Ultimate##0 ~n := #in~n; 27977#L25 assume ~n <= 0;#res := 1; 27976#factFINAL assume true; 27619#factEXIT >#76#return; 27598#L30-7 [2023-02-14 14:43:13,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:43:13,366 INFO L85 PathProgramCache]: Analyzing trace with hash -434985182, now seen corresponding path program 5 times [2023-02-14 14:43:13,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:43:13,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616706917] [2023-02-14 14:43:13,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:43:13,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:43:13,374 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 14:43:13,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1513756258] [2023-02-14 14:43:13,374 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-14 14:43:13,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 14:43:13,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:13,376 INFO L229 MonitoredProcess]: Starting monitored process 132 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 14:43:13,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (132)] Waiting until timeout for monitored process [2023-02-14 14:43:13,472 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2023-02-14 14:43:13,472 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 14:43:13,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-14 14:43:13,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:43:13,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1029 backedges. 329 proven. 32 refuted. 0 times theorem prover too weak. 668 trivial. 0 not checked. [2023-02-14 14:43:13,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 14:43:13,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1029 backedges. 17 proven. 32 refuted. 0 times theorem prover too weak. 980 trivial. 0 not checked. [2023-02-14 14:43:13,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:43:13,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616706917] [2023-02-14 14:43:13,697 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 14:43:13,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513756258] [2023-02-14 14:43:13,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513756258] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 14:43:13,697 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 14:43:13,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2023-02-14 14:43:13,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850266175] [2023-02-14 14:43:13,698 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 14:43:13,698 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-14 14:43:13,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:43:13,698 INFO L85 PathProgramCache]: Analyzing trace with hash 74491038, now seen corresponding path program 3 times [2023-02-14 14:43:13,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:43:13,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163323539] [2023-02-14 14:43:13,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:43:13,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:43:13,702 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 14:43:13,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [347720872] [2023-02-14 14:43:13,702 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-14 14:43:13,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 14:43:13,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:13,705 INFO L229 MonitoredProcess]: Starting monitored process 133 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 14:43:13,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (133)] Waiting until timeout for monitored process [2023-02-14 14:43:13,745 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2023-02-14 14:43:13,745 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-02-14 14:43:13,745 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:43:13,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:43:13,760 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:43:14,284 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 14:43:14,284 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 14:43:14,284 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 14:43:14,284 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 14:43:14,284 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-14 14:43:14,284 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:14,284 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 14:43:14,284 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 14:43:14,285 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration15_Loop [2023-02-14 14:43:14,285 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 14:43:14,285 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 14:43:14,285 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:14,287 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:14,293 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:14,295 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:14,317 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:14,319 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:14,408 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 14:43:14,408 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-14 14:43:14,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:14,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:14,411 INFO L229 MonitoredProcess]: Starting monitored process 134 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) [2023-02-14 14:43:14,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2023-02-14 14:43:14,413 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 14:43:14,413 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 14:43:14,419 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 14:43:14,419 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret10#1=0} Honda state: {ULTIMATE.start_main_#t~ret10#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-14 14:43:14,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Ended with exit code 0 [2023-02-14 14:43:14,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:14,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:14,423 INFO L229 MonitoredProcess]: Starting monitored process 135 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) [2023-02-14 14:43:14,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2023-02-14 14:43:14,426 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 14:43:14,426 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 14:43:14,432 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 14:43:14,432 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-14 14:43:14,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Forceful destruction successful, exit code 0 [2023-02-14 14:43:14,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:14,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:14,436 INFO L229 MonitoredProcess]: Starting monitored process 136 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) [2023-02-14 14:43:14,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2023-02-14 14:43:14,439 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 14:43:14,439 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 14:43:14,446 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 14:43:14,446 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post8#1=0} Honda state: {ULTIMATE.start_main_#t~post8#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-14 14:43:14,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Ended with exit code 0 [2023-02-14 14:43:14,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:14,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:14,450 INFO L229 MonitoredProcess]: Starting monitored process 137 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) [2023-02-14 14:43:14,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2023-02-14 14:43:14,452 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 14:43:14,453 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 14:43:14,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Ended with exit code 0 [2023-02-14 14:43:14,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:14,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:14,466 INFO L229 MonitoredProcess]: Starting monitored process 138 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) [2023-02-14 14:43:14,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2023-02-14 14:43:14,469 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-14 14:43:14,469 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 14:43:14,487 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-14 14:43:14,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Ended with exit code 0 [2023-02-14 14:43:14,489 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 14:43:14,490 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 14:43:14,490 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 14:43:14,490 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 14:43:14,490 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-14 14:43:14,490 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:14,490 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 14:43:14,490 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 14:43:14,490 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration15_Loop [2023-02-14 14:43:14,490 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 14:43:14,490 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 14:43:14,491 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:14,496 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:14,497 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:14,498 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:14,518 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:14,519 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:14,616 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 14:43:14,616 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-14 14:43:14,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:14,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:14,621 INFO L229 MonitoredProcess]: Starting monitored process 139 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) [2023-02-14 14:43:14,629 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 [2023-02-14 14:43:14,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2023-02-14 14:43:14,636 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:43:14,637 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:43:14,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:43:14,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:43:14,637 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:43:14,637 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 14:43:14,637 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:43:14,644 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:43:14,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Ended with exit code 0 [2023-02-14 14:43:14,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:14,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:14,648 INFO L229 MonitoredProcess]: Starting monitored process 140 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) [2023-02-14 14:43:14,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2023-02-14 14:43:14,651 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 [2023-02-14 14:43:14,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:43:14,657 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:43:14,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:43:14,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:43:14,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:43:14,658 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 14:43:14,658 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:43:14,658 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:43:14,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Ended with exit code 0 [2023-02-14 14:43:14,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:14,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:14,662 INFO L229 MonitoredProcess]: Starting monitored process 141 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) [2023-02-14 14:43:14,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2023-02-14 14:43:14,665 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 [2023-02-14 14:43:14,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:43:14,671 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:43:14,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:43:14,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:43:14,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:43:14,671 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 14:43:14,671 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:43:14,672 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:43:14,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Forceful destruction successful, exit code 0 [2023-02-14 14:43:14,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:14,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:14,676 INFO L229 MonitoredProcess]: Starting monitored process 142 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) [2023-02-14 14:43:14,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Waiting until timeout for monitored process [2023-02-14 14:43:14,679 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 [2023-02-14 14:43:14,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:43:14,685 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:43:14,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:43:14,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:43:14,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:43:14,687 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 14:43:14,687 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:43:14,690 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-14 14:43:14,694 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-02-14 14:43:14,694 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-14 14:43:14,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:14,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:14,696 INFO L229 MonitoredProcess]: Starting monitored process 143 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) [2023-02-14 14:43:14,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Waiting until timeout for monitored process [2023-02-14 14:43:14,698 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-14 14:43:14,698 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-14 14:43:14,698 INFO L513 LassoAnalysis]: Proved termination. [2023-02-14 14:43:14,698 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~k~0#1) = 5*ULTIMATE.start_main_~x~0#1 - 6*ULTIMATE.start_main_~k~0#1 Supporting invariants [] [2023-02-14 14:43:14,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Forceful destruction successful, exit code 0 [2023-02-14 14:43:14,701 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-14 14:43:14,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:43:14,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:43:14,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 971 conjuncts, 46 conjunts are in the unsatisfiable core [2023-02-14 14:43:14,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:43:15,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Forceful destruction successful, exit code 0 [2023-02-14 14:43:15,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:43:15,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-14 14:43:15,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:43:15,866 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 30 proven. 27 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-02-14 14:43:15,867 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 11 loop predicates [2023-02-14 14:43:15,867 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 649 states and 801 transitions. cyclomatic complexity: 169 Second operand has 14 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 7 states have call successors, (12), 2 states have call predecessors, (12), 6 states have return successors, (15), 9 states have call predecessors, (15), 7 states have call successors, (15) [2023-02-14 14:43:16,166 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 649 states and 801 transitions. cyclomatic complexity: 169. Second operand has 14 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 7 states have call successors, (12), 2 states have call predecessors, (12), 6 states have return successors, (15), 9 states have call predecessors, (15), 7 states have call successors, (15) Result 1140 states and 1397 transitions. Complement of second has 59 states. [2023-02-14 14:43:16,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 2 stem states 10 non-accepting loop states 1 accepting loop states [2023-02-14 14:43:16,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 7 states have call successors, (12), 2 states have call predecessors, (12), 6 states have return successors, (15), 9 states have call predecessors, (15), 7 states have call successors, (15) [2023-02-14 14:43:16,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 79 transitions. [2023-02-14 14:43:16,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 79 transitions. Stem has 148 letters. Loop has 44 letters. [2023-02-14 14:43:16,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 14:43:16,168 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-14 14:43:16,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:43:16,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:43:16,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 971 conjuncts, 46 conjunts are in the unsatisfiable core [2023-02-14 14:43:16,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:43:16,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:43:16,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-14 14:43:16,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:43:17,204 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 30 proven. 27 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-02-14 14:43:17,205 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 11 loop predicates [2023-02-14 14:43:17,205 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 649 states and 801 transitions. cyclomatic complexity: 169 Second operand has 14 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 7 states have call successors, (12), 2 states have call predecessors, (12), 6 states have return successors, (15), 9 states have call predecessors, (15), 7 states have call successors, (15) [2023-02-14 14:43:17,455 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 649 states and 801 transitions. cyclomatic complexity: 169. Second operand has 14 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 7 states have call successors, (12), 2 states have call predecessors, (12), 6 states have return successors, (15), 9 states have call predecessors, (15), 7 states have call successors, (15) Result 1048 states and 1271 transitions. Complement of second has 55 states. [2023-02-14 14:43:17,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 2 stem states 11 non-accepting loop states 1 accepting loop states [2023-02-14 14:43:17,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 7 states have call successors, (12), 2 states have call predecessors, (12), 6 states have return successors, (15), 9 states have call predecessors, (15), 7 states have call successors, (15) [2023-02-14 14:43:17,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 74 transitions. [2023-02-14 14:43:17,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 74 transitions. Stem has 148 letters. Loop has 44 letters. [2023-02-14 14:43:17,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 14:43:17,458 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-14 14:43:17,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:43:17,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:43:17,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 971 conjuncts, 46 conjunts are in the unsatisfiable core [2023-02-14 14:43:17,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:43:18,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:43:18,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-14 14:43:18,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:43:18,514 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 30 proven. 27 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-02-14 14:43:18,514 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 11 loop predicates [2023-02-14 14:43:18,515 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 649 states and 801 transitions. cyclomatic complexity: 169 Second operand has 14 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 7 states have call successors, (12), 2 states have call predecessors, (12), 6 states have return successors, (15), 9 states have call predecessors, (15), 7 states have call successors, (15) [2023-02-14 14:43:18,771 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 649 states and 801 transitions. cyclomatic complexity: 169. Second operand has 14 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 7 states have call successors, (12), 2 states have call predecessors, (12), 6 states have return successors, (15), 9 states have call predecessors, (15), 7 states have call successors, (15) Result 2207 states and 2735 transitions. Complement of second has 80 states. [2023-02-14 14:43:18,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 2 stem states 10 non-accepting loop states 1 accepting loop states [2023-02-14 14:43:18,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 7 states have call successors, (12), 2 states have call predecessors, (12), 6 states have return successors, (15), 9 states have call predecessors, (15), 7 states have call successors, (15) [2023-02-14 14:43:18,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 94 transitions. [2023-02-14 14:43:18,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 94 transitions. Stem has 148 letters. Loop has 44 letters. [2023-02-14 14:43:18,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 14:43:18,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 94 transitions. Stem has 192 letters. Loop has 44 letters. [2023-02-14 14:43:18,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 14:43:18,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 94 transitions. Stem has 148 letters. Loop has 88 letters. [2023-02-14 14:43:18,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 14:43:18,777 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2207 states and 2735 transitions. [2023-02-14 14:43:18,791 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2023-02-14 14:43:18,808 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2207 states to 1670 states and 2079 transitions. [2023-02-14 14:43:18,809 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 322 [2023-02-14 14:43:18,809 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 326 [2023-02-14 14:43:18,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1670 states and 2079 transitions. [2023-02-14 14:43:18,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 14:43:18,809 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1670 states and 2079 transitions. [2023-02-14 14:43:18,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states and 2079 transitions. [2023-02-14 14:43:18,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 990. [2023-02-14 14:43:18,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 662 states have (on average 1.0996978851963746) internal successors, (728), 685 states have internal predecessors, (728), 166 states have call successors, (182), 117 states have call predecessors, (182), 162 states have return successors, (351), 187 states have call predecessors, (351), 166 states have call successors, (351) [2023-02-14 14:43:18,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1261 transitions. [2023-02-14 14:43:18,845 INFO L240 hiAutomatonCegarLoop]: Abstraction has 990 states and 1261 transitions. [2023-02-14 14:43:18,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 14:43:18,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-14 14:43:18,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-02-14 14:43:18,846 INFO L87 Difference]: Start difference. First operand 990 states and 1261 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 8 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 8 states have call predecessors, (24), 8 states have call successors, (24) [2023-02-14 14:43:18,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:43:18,988 INFO L93 Difference]: Finished difference Result 1189 states and 1576 transitions. [2023-02-14 14:43:18,988 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1189 states and 1576 transitions. [2023-02-14 14:43:18,996 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2023-02-14 14:43:19,004 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1189 states to 1128 states and 1490 transitions. [2023-02-14 14:43:19,004 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 259 [2023-02-14 14:43:19,005 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 259 [2023-02-14 14:43:19,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1128 states and 1490 transitions. [2023-02-14 14:43:19,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 14:43:19,006 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1128 states and 1490 transitions. [2023-02-14 14:43:19,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states and 1490 transitions. [2023-02-14 14:43:19,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 986. [2023-02-14 14:43:19,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 986 states, 659 states have (on average 1.1001517450682854) internal successors, (725), 682 states have internal predecessors, (725), 166 states have call successors, (181), 116 states have call predecessors, (181), 161 states have return successors, (350), 187 states have call predecessors, (350), 166 states have call successors, (350) [2023-02-14 14:43:19,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1256 transitions. [2023-02-14 14:43:19,032 INFO L240 hiAutomatonCegarLoop]: Abstraction has 986 states and 1256 transitions. [2023-02-14 14:43:19,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-14 14:43:19,032 INFO L428 stractBuchiCegarLoop]: Abstraction has 986 states and 1256 transitions. [2023-02-14 14:43:19,033 INFO L335 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2023-02-14 14:43:19,033 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 986 states and 1256 transitions. [2023-02-14 14:43:19,037 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2023-02-14 14:43:19,038 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 14:43:19,038 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 14:43:19,039 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [30, 30, 18, 12, 12, 12, 12, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-02-14 14:43:19,039 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 8, 5, 5, 5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:43:19,040 INFO L748 eck$LassoCheckResult]: Stem: 37729#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 37674#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 37675#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 37697#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 37685#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 37686#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 38221#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 38213#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 38214#$Ultimate##0 ~n := #in~n; 38220#L25 assume ~n <= 0;#res := 1; 38218#factFINAL assume true; 38212#factEXIT >#68#return; 38208#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 38210#$Ultimate##0 ~n := #in~n; 38219#L25 assume ~n <= 0;#res := 1; 38217#factFINAL assume true; 38207#factEXIT >#70#return; 38209#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 38210#$Ultimate##0 ~n := #in~n; 38219#L25 assume ~n <= 0;#res := 1; 38217#factFINAL assume true; 38207#factEXIT >#72#return; 38205#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 38204#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 38203#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 38201#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 38200#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 38193#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 38194#$Ultimate##0 ~n := #in~n; 38225#L25 assume !(~n <= 0); 38223#L26 call #t~ret0 := fact(~n - 1);< 38224#$Ultimate##0 ~n := #in~n; 38245#L25 assume ~n <= 0;#res := 1; 38246#factFINAL assume true; 38222#factEXIT >#66#return; 38215#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 38211#factFINAL assume true; 38192#factEXIT >#74#return; 38186#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 38187#$Ultimate##0 ~n := #in~n; 38333#L25 assume ~n <= 0;#res := 1; 38331#factFINAL assume true; 38325#factEXIT >#76#return; 38310#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 38311#$Ultimate##0 ~n := #in~n; 38318#L25 assume !(~n <= 0); 38315#L26 call #t~ret0 := fact(~n - 1);< 38317#$Ultimate##0 ~n := #in~n; 38351#L25 assume ~n <= 0;#res := 1; 38319#factFINAL assume true; 38314#factEXIT >#66#return; 38313#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 38312#factFINAL assume true; 38309#factEXIT >#78#return; 38306#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 37866#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 37862#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 37856#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 37852#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 37776#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 37777#$Ultimate##0 ~n := #in~n; 37823#L25 assume !(~n <= 0); 37821#L26 call #t~ret0 := fact(~n - 1);< 37841#$Ultimate##0 ~n := #in~n; 37836#L25 assume !(~n <= 0); 37820#L26 call #t~ret0 := fact(~n - 1);< 37829#$Ultimate##0 ~n := #in~n; 37833#L25 assume ~n <= 0;#res := 1; 37830#factFINAL assume true; 37831#factEXIT >#66#return; 37843#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37819#factFINAL assume true; 37822#factEXIT >#66#return; 37842#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37809#factFINAL assume true; 37810#factEXIT >#74#return; 37763#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 37764#$Ultimate##0 ~n := #in~n; 37766#L25 assume ~n <= 0;#res := 1; 37765#factFINAL assume true; 37762#factEXIT >#76#return; 37744#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 37745#$Ultimate##0 ~n := #in~n; 37756#L25 assume !(~n <= 0); 37750#L26 call #t~ret0 := fact(~n - 1);< 37754#$Ultimate##0 ~n := #in~n; 37757#L25 assume ~n <= 0;#res := 1; 37755#factFINAL assume true; 37753#factEXIT >#66#return; 37747#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37746#factFINAL assume true; 37743#factEXIT >#78#return; 37741#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 37739#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 37737#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 37734#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 37690#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 37691#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 38075#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 38117#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 37992#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 38114#$Ultimate##0 ~n := #in~n; 37990#L25 assume !(~n <= 0); 37993#L26 call #t~ret0 := fact(~n - 1);< 37682#$Ultimate##0 ~n := #in~n; 38128#L25 assume ~n <= 0;#res := 1; 38122#factFINAL assume true; 38119#factEXIT >#66#return; 38118#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 38116#factFINAL assume true; 38113#factEXIT >#68#return; 38103#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 38111#$Ultimate##0 ~n := #in~n; 38115#L25 assume ~n <= 0;#res := 1; 38112#factFINAL assume true; 38110#factEXIT >#70#return; 38095#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 38109#$Ultimate##0 ~n := #in~n; 38137#L25 assume !(~n <= 0); 37927#L26 call #t~ret0 := fact(~n - 1);< 37932#$Ultimate##0 ~n := #in~n; 37938#L25 assume ~n <= 0;#res := 1; 38138#factFINAL assume true; 38135#factEXIT >#66#return; 38130#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 38129#factFINAL assume true; 38126#factEXIT >#72#return; 38125#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 38124#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 38123#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 38071#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 38072#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 37681#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 38007#$Ultimate##0 ~n := #in~n; 38008#L25 assume !(~n <= 0); 37680#L26 call #t~ret0 := fact(~n - 1);< 37682#$Ultimate##0 ~n := #in~n; 38128#L25 assume ~n <= 0;#res := 1; 38122#factFINAL assume true; 38119#factEXIT >#66#return; 38120#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 38150#factFINAL assume true; 38149#factEXIT >#68#return; 37653#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 37658#$Ultimate##0 ~n := #in~n; 37715#L25 assume !(~n <= 0); 37926#L26 call #t~ret0 := fact(~n - 1);< 37932#$Ultimate##0 ~n := #in~n; 37938#L25 assume ~n <= 0;#res := 1; 38138#factFINAL assume true; 38135#factEXIT >#66#return; 38136#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 38623#factFINAL assume true; 38148#factEXIT >#70#return; 37652#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 37658#$Ultimate##0 ~n := #in~n; 37715#L25 assume ~n <= 0;#res := 1; 38166#factFINAL assume true; 37651#factEXIT >#72#return; 37654#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 38282#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 37959#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 37952#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 37941#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 37647#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 37648#$Ultimate##0 ~n := #in~n; 37935#L25 assume !(~n <= 0); 37928#L26 call #t~ret0 := fact(~n - 1);< 37932#$Ultimate##0 ~n := #in~n; 37936#L25 assume !(~n <= 0); 37929#L26 call #t~ret0 := fact(~n - 1);< 37934#$Ultimate##0 ~n := #in~n; 37939#L25 assume ~n <= 0;#res := 1; 37940#factFINAL assume true; 37937#factEXIT >#66#return; 37931#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37933#factFINAL assume true; 37925#factEXIT >#66#return; 37924#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37923#factFINAL assume true; 37922#factEXIT >#74#return; 37723#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 37725#$Ultimate##0 ~n := #in~n; 37882#L25 assume ~n <= 0;#res := 1; 37883#factFINAL assume true; 38069#factEXIT >#76#return; 37850#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 37864#$Ultimate##0 ~n := #in~n; 37865#L25 assume !(~n <= 0); 37665#L26 call #t~ret0 := fact(~n - 1);< 37861#$Ultimate##0 ~n := #in~n; 37708#L25 assume ~n <= 0;#res := 1; 37661#factFINAL assume true; 37668#factEXIT >#66#return; 37859#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37849#factFINAL assume true; 37851#factEXIT >#78#return; 37676#L30-8 [2023-02-14 14:43:19,040 INFO L750 eck$LassoCheckResult]: Loop: 37676#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 37677#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 37698#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 37905#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 37903#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 37900#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 37901#$Ultimate##0 ~n := #in~n; 37911#L25 assume !(~n <= 0); 37664#L26 call #t~ret0 := fact(~n - 1);< 37861#$Ultimate##0 ~n := #in~n; 37912#L25 assume !(~n <= 0); 37907#L26 call #t~ret0 := fact(~n - 1);< 37910#$Ultimate##0 ~n := #in~n; 37912#L25 assume !(~n <= 0); 37907#L26 call #t~ret0 := fact(~n - 1);< 37910#$Ultimate##0 ~n := #in~n; 37912#L25 assume !(~n <= 0); 37907#L26 call #t~ret0 := fact(~n - 1);< 37910#$Ultimate##0 ~n := #in~n; 37914#L25 assume ~n <= 0;#res := 1; 37921#factFINAL assume true; 37920#factEXIT >#66#return; 37919#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37918#factFINAL assume true; 37917#factEXIT >#66#return; 37916#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37915#factFINAL assume true; 37913#factEXIT >#66#return; 37908#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37909#factFINAL assume true; 37906#factEXIT >#66#return; 37904#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37902#factFINAL assume true; 37899#factEXIT >#74#return; 37868#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 37890#$Ultimate##0 ~n := #in~n; 37891#L25 assume ~n <= 0;#res := 1; 37874#factFINAL assume true; 37867#factEXIT >#76#return; 37730#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 37731#$Ultimate##0 ~n := #in~n; 37863#L25 assume !(~n <= 0); 37667#L26 call #t~ret0 := fact(~n - 1);< 37861#$Ultimate##0 ~n := #in~n; 37708#L25 assume ~n <= 0;#res := 1; 37661#factFINAL assume true; 37668#factEXIT >#66#return; 37854#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37855#factFINAL assume true; 37847#factEXIT >#78#return; 37676#L30-8 [2023-02-14 14:43:19,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:43:19,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1839695170, now seen corresponding path program 6 times [2023-02-14 14:43:19,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:43:19,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751144963] [2023-02-14 14:43:19,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:43:19,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:43:19,048 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 14:43:19,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [627156556] [2023-02-14 14:43:19,049 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-14 14:43:19,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 14:43:19,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:19,050 INFO L229 MonitoredProcess]: Starting monitored process 144 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 14:43:19,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (144)] Waiting until timeout for monitored process [2023-02-14 14:43:19,151 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2023-02-14 14:43:19,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 14:43:19,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-14 14:43:19,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:43:19,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1945 backedges. 367 proven. 4 refuted. 0 times theorem prover too weak. 1574 trivial. 0 not checked. [2023-02-14 14:43:19,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 14:43:19,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1945 backedges. 121 proven. 10 refuted. 0 times theorem prover too weak. 1814 trivial. 0 not checked. [2023-02-14 14:43:19,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:43:19,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751144963] [2023-02-14 14:43:19,422 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 14:43:19,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627156556] [2023-02-14 14:43:19,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627156556] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 14:43:19,422 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 14:43:19,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2023-02-14 14:43:19,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483621948] [2023-02-14 14:43:19,423 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 14:43:19,423 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-14 14:43:19,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:43:19,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1984687932, now seen corresponding path program 4 times [2023-02-14 14:43:19,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:43:19,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467752029] [2023-02-14 14:43:19,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:43:19,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:43:19,426 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 14:43:19,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1642595219] [2023-02-14 14:43:19,426 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-14 14:43:19,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 14:43:19,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:19,433 INFO L229 MonitoredProcess]: Starting monitored process 145 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 14:43:19,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (145)] Waiting until timeout for monitored process [2023-02-14 14:43:19,472 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-14 14:43:19,472 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 14:43:19,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-14 14:43:19,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:43:19,555 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 35 proven. 55 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-02-14 14:43:19,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 14:43:20,046 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 33 proven. 65 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-02-14 14:43:20,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:43:20,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467752029] [2023-02-14 14:43:20,047 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 14:43:20,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642595219] [2023-02-14 14:43:20,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642595219] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 14:43:20,047 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 14:43:20,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 19 [2023-02-14 14:43:20,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119133230] [2023-02-14 14:43:20,048 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 14:43:20,049 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-14 14:43:20,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 14:43:20,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-14 14:43:20,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2023-02-14 14:43:20,049 INFO L87 Difference]: Start difference. First operand 986 states and 1256 transitions. cyclomatic complexity: 297 Second operand has 20 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 12 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (15), 10 states have call predecessors, (15), 12 states have call successors, (15) [2023-02-14 14:43:20,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:43:20,674 INFO L93 Difference]: Finished difference Result 2130 states and 2989 transitions. [2023-02-14 14:43:20,674 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2130 states and 2989 transitions. [2023-02-14 14:43:20,688 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 43 [2023-02-14 14:43:20,706 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2130 states to 2071 states and 2920 transitions. [2023-02-14 14:43:20,706 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 448 [2023-02-14 14:43:20,707 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 448 [2023-02-14 14:43:20,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2071 states and 2920 transitions. [2023-02-14 14:43:20,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 14:43:20,707 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2071 states and 2920 transitions. [2023-02-14 14:43:20,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2071 states and 2920 transitions. [2023-02-14 14:43:20,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2071 to 1433. [2023-02-14 14:43:20,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1433 states, 922 states have (on average 1.0704989154013016) internal successors, (987), 951 states have internal predecessors, (987), 272 states have call successors, (297), 186 states have call predecessors, (297), 239 states have return successors, (695), 295 states have call predecessors, (695), 272 states have call successors, (695) [2023-02-14 14:43:20,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 1979 transitions. [2023-02-14 14:43:20,793 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1433 states and 1979 transitions. [2023-02-14 14:43:20,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-14 14:43:20,794 INFO L428 stractBuchiCegarLoop]: Abstraction has 1433 states and 1979 transitions. [2023-02-14 14:43:20,794 INFO L335 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2023-02-14 14:43:20,794 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1433 states and 1979 transitions. [2023-02-14 14:43:20,801 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2023-02-14 14:43:20,801 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 14:43:20,801 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 14:43:20,805 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [32, 32, 18, 14, 14, 14, 14, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-02-14 14:43:20,806 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [12, 12, 9, 9, 9, 9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:43:20,806 INFO L748 eck$LassoCheckResult]: Stem: 42369#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 42312#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 42313#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 42336#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 42370#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 42625#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 42623#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 42620#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 42621#$Ultimate##0 ~n := #in~n; 42624#L25 assume ~n <= 0;#res := 1; 42622#factFINAL assume true; 42619#factEXIT >#68#return; 42614#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 42616#$Ultimate##0 ~n := #in~n; 42618#L25 assume ~n <= 0;#res := 1; 42617#factFINAL assume true; 42613#factEXIT >#70#return; 42615#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 42616#$Ultimate##0 ~n := #in~n; 42618#L25 assume ~n <= 0;#res := 1; 42617#factFINAL assume true; 42613#factEXIT >#72#return; 42612#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 42611#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 42610#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 42609#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 42608#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 42606#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 42607#$Ultimate##0 ~n := #in~n; 42652#L25 assume !(~n <= 0); 42647#L26 call #t~ret0 := fact(~n - 1);< 42650#$Ultimate##0 ~n := #in~n; 42658#L25 assume ~n <= 0;#res := 1; 42705#factFINAL assume true; 42703#factEXIT >#66#return; 42704#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42772#factFINAL assume true; 42605#factEXIT >#74#return; 42518#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 42600#$Ultimate##0 ~n := #in~n; 42516#L25 assume ~n <= 0;#res := 1; 42520#factFINAL assume true; 42591#factEXIT >#76#return; 42506#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 42507#$Ultimate##0 ~n := #in~n; 42604#L25 assume !(~n <= 0); 42547#L26 call #t~ret0 := fact(~n - 1);< 42554#$Ultimate##0 ~n := #in~n; 42777#L25 assume ~n <= 0;#res := 1; 42776#factFINAL assume true; 42774#factEXIT >#66#return; 42775#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42780#factFINAL assume true; 42505#factEXIT >#78#return; 42503#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 42498#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 42495#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 42474#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 42471#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 42401#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 42426#$Ultimate##0 ~n := #in~n; 42431#L25 assume !(~n <= 0); 42432#L26 call #t~ret0 := fact(~n - 1);< 42470#$Ultimate##0 ~n := #in~n; 42465#L25 assume !(~n <= 0); 42439#L26 call #t~ret0 := fact(~n - 1);< 42449#$Ultimate##0 ~n := #in~n; 42462#L25 assume ~n <= 0;#res := 1; 42458#factFINAL assume true; 42459#factEXIT >#66#return; 42473#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42438#factFINAL assume true; 42440#factEXIT >#66#return; 42400#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42402#factFINAL assume true; 42425#factEXIT >#74#return; 42386#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 42387#$Ultimate##0 ~n := #in~n; 42389#L25 assume ~n <= 0;#res := 1; 42388#factFINAL assume true; 42384#factEXIT >#76#return; 42381#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 42424#$Ultimate##0 ~n := #in~n; 42422#L25 assume !(~n <= 0); 42411#L26 call #t~ret0 := fact(~n - 1);< 42420#$Ultimate##0 ~n := #in~n; 42455#L25 assume !(~n <= 0); 42413#L26 call #t~ret0 := fact(~n - 1);< 42452#$Ultimate##0 ~n := #in~n; 42457#L25 assume ~n <= 0;#res := 1; 42454#factFINAL assume true; 42451#factEXIT >#66#return; 42447#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42441#factFINAL assume true; 42442#factEXIT >#66#return; 42403#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42397#factFINAL assume true; 42380#factEXIT >#78#return; 42379#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 42378#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 42377#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 42374#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 42330#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 42324#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 42326#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 42893#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 42887#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 42889#$Ultimate##0 ~n := #in~n; 42904#L25 assume !(~n <= 0); 42897#L26 call #t~ret0 := fact(~n - 1);< 42899#$Ultimate##0 ~n := #in~n; 42906#L25 assume ~n <= 0;#res := 1; 42901#factFINAL assume true; 42895#factEXIT >#66#return; 42892#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42890#factFINAL assume true; 42886#factEXIT >#68#return; 42872#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 42882#$Ultimate##0 ~n := #in~n; 42884#L25 assume ~n <= 0;#res := 1; 42883#factFINAL assume true; 42866#factEXIT >#70#return; 42880#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 42917#$Ultimate##0 ~n := #in~n; 42942#L25 assume !(~n <= 0); 42484#L26 call #t~ret0 := fact(~n - 1);< 42863#$Ultimate##0 ~n := #in~n; 42943#L25 assume ~n <= 0;#res := 1; 42940#factFINAL assume true; 42937#factEXIT >#66#return; 42934#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42933#factFINAL assume true; 42931#factEXIT >#72#return; 42926#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 42924#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 42922#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 42920#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 42919#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 42902#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 42909#$Ultimate##0 ~n := #in~n; 42903#L25 assume !(~n <= 0); 42896#L26 call #t~ret0 := fact(~n - 1);< 42899#$Ultimate##0 ~n := #in~n; 42906#L25 assume ~n <= 0;#res := 1; 42901#factFINAL assume true; 42895#factEXIT >#66#return; 42898#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42966#factFINAL assume true; 42965#factEXIT >#68#return; 42941#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 42298#$Ultimate##0 ~n := #in~n; 42952#L25 assume !(~n <= 0); 42479#L26 call #t~ret0 := fact(~n - 1);< 42863#$Ultimate##0 ~n := #in~n; 42943#L25 assume ~n <= 0;#res := 1; 42940#factFINAL assume true; 42937#factEXIT >#66#return; 42938#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43712#factFINAL assume true; 42964#factEXIT >#70#return; 42297#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 42298#$Ultimate##0 ~n := #in~n; 42952#L25 assume ~n <= 0;#res := 1; 42981#factFINAL assume true; 42980#factEXIT >#72#return; 42879#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 42979#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 42977#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 42968#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 42864#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 42287#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 42288#$Ultimate##0 ~n := #in~n; 42491#L25 assume !(~n <= 0); 42481#L26 call #t~ret0 := fact(~n - 1);< 42863#$Ultimate##0 ~n := #in~n; 42836#L25 assume !(~n <= 0); 42483#L26 call #t~ret0 := fact(~n - 1);< 42835#$Ultimate##0 ~n := #in~n; 42832#L25 assume ~n <= 0;#res := 1; 42833#factFINAL assume true; 42823#factEXIT >#66#return; 42812#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42798#factFINAL assume true; 42478#factEXIT >#66#return; 42487#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42963#factFINAL assume true; 42961#factEXIT >#74#return; 42319#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 42911#$Ultimate##0 ~n := #in~n; 42907#L25 assume ~n <= 0;#res := 1; 42908#factFINAL assume true; 42957#factEXIT >#76#return; 42303#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 43092#$Ultimate##0 ~n := #in~n; 42992#L25 assume !(~n <= 0); 42815#L26 call #t~ret0 := fact(~n - 1);< 42974#$Ultimate##0 ~n := #in~n; 42813#L25 assume !(~n <= 0); 42817#L26 call #t~ret0 := fact(~n - 1);< 42851#$Ultimate##0 ~n := #in~n; 42858#L25 assume ~n <= 0;#res := 1; 42857#factFINAL assume true; 42850#factEXIT >#66#return; 42844#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42843#factFINAL assume true; 42837#factEXIT >#66#return; 42344#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42301#factFINAL assume true; 42304#factEXIT >#78#return; 42314#L30-8 [2023-02-14 14:43:20,806 INFO L750 eck$LassoCheckResult]: Loop: 42314#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 42315#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 42337#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 42367#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 42375#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 42376#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 42492#$Ultimate##0 ~n := #in~n; 42493#L25 assume !(~n <= 0); 42489#L26 call #t~ret0 := fact(~n - 1);< 42490#$Ultimate##0 ~n := #in~n; 42813#L25 assume !(~n <= 0); 42817#L26 call #t~ret0 := fact(~n - 1);< 42851#$Ultimate##0 ~n := #in~n; 42813#L25 assume !(~n <= 0); 42817#L26 call #t~ret0 := fact(~n - 1);< 42851#$Ultimate##0 ~n := #in~n; 42813#L25 assume !(~n <= 0); 42817#L26 call #t~ret0 := fact(~n - 1);< 42851#$Ultimate##0 ~n := #in~n; 42858#L25 assume ~n <= 0;#res := 1; 42857#factFINAL assume true; 42850#factEXIT >#66#return; 42844#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42843#factFINAL assume true; 42837#factEXIT >#66#return; 42834#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42828#factFINAL assume true; 42829#factEXIT >#66#return; 42928#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42959#factFINAL assume true; 42927#factEXIT >#66#return; 42925#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42923#factFINAL assume true; 42921#factEXIT >#74#return; 42363#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 42364#$Ultimate##0 ~n := #in~n; 42962#L25 assume !(~n <= 0); 42820#L26 call #t~ret0 := fact(~n - 1);< 42490#$Ultimate##0 ~n := #in~n; 43106#L25 assume ~n <= 0;#res := 1; 43103#factFINAL assume true; 43094#factEXIT >#66#return; 43096#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43122#factFINAL assume true; 42996#factEXIT >#76#return; 42371#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 42372#$Ultimate##0 ~n := #in~n; 43113#L25 assume !(~n <= 0); 42816#L26 call #t~ret0 := fact(~n - 1);< 42974#$Ultimate##0 ~n := #in~n; 42813#L25 assume !(~n <= 0); 42817#L26 call #t~ret0 := fact(~n - 1);< 42851#$Ultimate##0 ~n := #in~n; 42813#L25 assume !(~n <= 0); 42817#L26 call #t~ret0 := fact(~n - 1);< 42851#$Ultimate##0 ~n := #in~n; 42813#L25 assume !(~n <= 0); 42817#L26 call #t~ret0 := fact(~n - 1);< 42851#$Ultimate##0 ~n := #in~n; 42858#L25 assume ~n <= 0;#res := 1; 42857#factFINAL assume true; 42850#factEXIT >#66#return; 42844#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42843#factFINAL assume true; 42837#factEXIT >#66#return; 42834#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42828#factFINAL assume true; 42829#factEXIT >#66#return; 42928#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42959#factFINAL assume true; 42927#factEXIT >#66#return; 42930#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42987#factFINAL assume true; 42984#factEXIT >#78#return; 42314#L30-8 [2023-02-14 14:43:20,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:43:20,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1498400958, now seen corresponding path program 7 times [2023-02-14 14:43:20,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:43:20,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808211341] [2023-02-14 14:43:20,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:43:20,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:43:20,815 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 14:43:20,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [806038053] [2023-02-14 14:43:20,816 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-14 14:43:20,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 14:43:20,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:20,823 INFO L229 MonitoredProcess]: Starting monitored process 146 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 14:43:20,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (146)] Waiting until timeout for monitored process [2023-02-14 14:43:20,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:43:20,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-14 14:43:20,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:43:21,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2239 backedges. 520 proven. 4 refuted. 0 times theorem prover too weak. 1715 trivial. 0 not checked. [2023-02-14 14:43:21,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 14:43:21,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2239 backedges. 124 proven. 13 refuted. 0 times theorem prover too weak. 2102 trivial. 0 not checked. [2023-02-14 14:43:21,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:43:21,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808211341] [2023-02-14 14:43:21,187 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 14:43:21,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806038053] [2023-02-14 14:43:21,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806038053] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 14:43:21,188 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 14:43:21,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2023-02-14 14:43:21,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087946670] [2023-02-14 14:43:21,188 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 14:43:21,189 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-14 14:43:21,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:43:21,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1744919020, now seen corresponding path program 5 times [2023-02-14 14:43:21,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:43:21,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196352382] [2023-02-14 14:43:21,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:43:21,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:43:21,194 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 14:43:21,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1853927871] [2023-02-14 14:43:21,194 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-14 14:43:21,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 14:43:21,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:21,198 INFO L229 MonitoredProcess]: Starting monitored process 147 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 14:43:21,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (147)] Waiting until timeout for monitored process [2023-02-14 14:43:21,259 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2023-02-14 14:43:21,260 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 14:43:21,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-14 14:43:21,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:43:21,384 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 49 proven. 185 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2023-02-14 14:43:21,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 14:43:22,442 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 49 proven. 213 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2023-02-14 14:43:22,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:43:22,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196352382] [2023-02-14 14:43:22,442 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 14:43:22,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853927871] [2023-02-14 14:43:22,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853927871] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 14:43:22,442 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 14:43:22,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 21] total 24 [2023-02-14 14:43:22,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886696089] [2023-02-14 14:43:22,443 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 14:43:22,443 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-14 14:43:22,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 14:43:22,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-14 14:43:22,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2023-02-14 14:43:22,444 INFO L87 Difference]: Start difference. First operand 1433 states and 1979 transitions. cyclomatic complexity: 573 Second operand has 25 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 states have internal predecessors, (49), 14 states have call successors, (14), 1 states have call predecessors, (14), 10 states have return successors, (20), 12 states have call predecessors, (20), 14 states have call successors, (20) [2023-02-14 14:43:23,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:43:23,287 INFO L93 Difference]: Finished difference Result 2473 states and 3749 transitions. [2023-02-14 14:43:23,287 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2473 states and 3749 transitions. [2023-02-14 14:43:23,305 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 65 [2023-02-14 14:43:23,329 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2473 states to 2463 states and 3731 transitions. [2023-02-14 14:43:23,330 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 541 [2023-02-14 14:43:23,330 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 553 [2023-02-14 14:43:23,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2463 states and 3731 transitions. [2023-02-14 14:43:23,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 14:43:23,331 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2463 states and 3731 transitions. [2023-02-14 14:43:23,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2463 states and 3731 transitions. [2023-02-14 14:43:23,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2463 to 1667. [2023-02-14 14:43:23,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1667 states, 1062 states have (on average 1.0781544256120528) internal successors, (1145), 1073 states have internal predecessors, (1145), 346 states have call successors, (377), 244 states have call predecessors, (377), 259 states have return successors, (997), 349 states have call predecessors, (997), 346 states have call successors, (997) [2023-02-14 14:43:23,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 2519 transitions. [2023-02-14 14:43:23,395 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1667 states and 2519 transitions. [2023-02-14 14:43:23,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-14 14:43:23,396 INFO L428 stractBuchiCegarLoop]: Abstraction has 1667 states and 2519 transitions. [2023-02-14 14:43:23,396 INFO L335 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2023-02-14 14:43:23,396 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1667 states and 2519 transitions. [2023-02-14 14:43:23,403 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 [2023-02-14 14:43:23,404 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 14:43:23,404 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 14:43:23,408 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [37, 37, 19, 19, 19, 19, 18, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-02-14 14:43:23,408 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 10, 7, 7, 7, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:43:23,409 INFO L748 eck$LassoCheckResult]: Stem: 48025#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 47969#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 47970#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 47993#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 48026#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 48192#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 48190#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 48187#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 48188#$Ultimate##0 ~n := #in~n; 48191#L25 assume ~n <= 0;#res := 1; 48189#factFINAL assume true; 48186#factEXIT >#68#return; 48181#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 48183#$Ultimate##0 ~n := #in~n; 48185#L25 assume ~n <= 0;#res := 1; 48184#factFINAL assume true; 48180#factEXIT >#70#return; 48182#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 48183#$Ultimate##0 ~n := #in~n; 48185#L25 assume ~n <= 0;#res := 1; 48184#factFINAL assume true; 48180#factEXIT >#72#return; 48179#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 48178#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 48177#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 48176#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 48175#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 48173#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 48174#$Ultimate##0 ~n := #in~n; 48276#L25 assume !(~n <= 0); 48272#L26 call #t~ret0 := fact(~n - 1);< 48275#$Ultimate##0 ~n := #in~n; 48349#L25 assume ~n <= 0;#res := 1; 48347#factFINAL assume true; 48340#factEXIT >#66#return; 48341#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 48369#factFINAL assume true; 48172#factEXIT >#74#return; 48164#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 48167#$Ultimate##0 ~n := #in~n; 48395#L25 assume ~n <= 0;#res := 1; 48393#factFINAL assume true; 48385#factEXIT >#76#return; 48353#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 48379#$Ultimate##0 ~n := #in~n; 48352#L25 assume !(~n <= 0); 48216#L26 call #t~ret0 := fact(~n - 1);< 48226#$Ultimate##0 ~n := #in~n; 48465#L25 assume ~n <= 0;#res := 1; 48464#factFINAL assume true; 48462#factEXIT >#66#return; 48463#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 48466#factFINAL assume true; 48456#factEXIT >#78#return; 48455#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 48454#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 48453#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 48452#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 48049#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 48050#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 48088#$Ultimate##0 ~n := #in~n; 48089#L25 assume !(~n <= 0); 48073#L26 call #t~ret0 := fact(~n - 1);< 48077#$Ultimate##0 ~n := #in~n; 48113#L25 assume !(~n <= 0); 48074#L26 call #t~ret0 := fact(~n - 1);< 48094#$Ultimate##0 ~n := #in~n; 48115#L25 assume ~n <= 0;#res := 1; 48095#factFINAL assume true; 48096#factEXIT >#66#return; 48090#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 48091#factFINAL assume true; 48072#factEXIT >#66#return; 48075#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 48054#factFINAL assume true; 48055#factEXIT >#74#return; 48040#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 48042#$Ultimate##0 ~n := #in~n; 48044#L25 assume ~n <= 0;#res := 1; 48043#factFINAL assume true; 48038#factEXIT >#76#return; 48036#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 48037#$Ultimate##0 ~n := #in~n; 48069#L25 assume !(~n <= 0); 48062#L26 call #t~ret0 := fact(~n - 1);< 48078#$Ultimate##0 ~n := #in~n; 48108#L25 assume !(~n <= 0); 48060#L26 call #t~ret0 := fact(~n - 1);< 48106#$Ultimate##0 ~n := #in~n; 48109#L25 assume ~n <= 0;#res := 1; 48107#factFINAL assume true; 48104#factEXIT >#66#return; 48105#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 48097#factFINAL assume true; 48098#factEXIT >#66#return; 48066#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 48125#factFINAL assume true; 48035#factEXIT >#78#return; 48034#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 48033#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 48032#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 48031#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 47991#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 47981#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 47983#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 48536#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 47961#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 47962#$Ultimate##0 ~n := #in~n; 48572#L25 assume !(~n <= 0); 48567#L26 call #t~ret0 := fact(~n - 1);< 48570#$Ultimate##0 ~n := #in~n; 48573#L25 assume ~n <= 0;#res := 1; 48571#factFINAL assume true; 48566#factEXIT >#66#return; 48565#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 48564#factFINAL assume true; 48561#factEXIT >#68#return; 48493#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 48011#$Ultimate##0 ~n := #in~n; 48608#L25 assume ~n <= 0;#res := 1; 48486#factFINAL assume true; 48498#factEXIT >#70#return; 48507#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 48526#$Ultimate##0 ~n := #in~n; 48610#L25 assume !(~n <= 0); 48547#L26 call #t~ret0 := fact(~n - 1);< 48450#$Ultimate##0 ~n := #in~n; 48581#L25 assume ~n <= 0;#res := 1; 48580#factFINAL assume true; 48576#factEXIT >#66#return; 48575#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 48535#factFINAL assume true; 48532#factEXIT >#72#return; 48533#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 48588#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 48586#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 48584#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 47997#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 47998#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 48521#$Ultimate##0 ~n := #in~n; 48574#L25 assume !(~n <= 0); 48568#L26 call #t~ret0 := fact(~n - 1);< 48570#$Ultimate##0 ~n := #in~n; 48573#L25 assume ~n <= 0;#res := 1; 48571#factFINAL assume true; 48566#factEXIT >#66#return; 48569#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 48522#factFINAL assume true; 48519#factEXIT >#68#return; 48481#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 48518#$Ultimate##0 ~n := #in~n; 48583#L25 assume !(~n <= 0); 48551#L26 call #t~ret0 := fact(~n - 1);< 48450#$Ultimate##0 ~n := #in~n; 48581#L25 assume ~n <= 0;#res := 1; 48580#factFINAL assume true; 48576#factEXIT >#66#return; 48577#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 48658#factFINAL assume true; 48503#factEXIT >#70#return; 48482#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 48501#$Ultimate##0 ~n := #in~n; 48499#L25 assume ~n <= 0;#res := 1; 48500#factFINAL assume true; 48478#factEXIT >#72#return; 48477#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 48475#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 48476#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 48602#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 48029#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 48030#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 48563#$Ultimate##0 ~n := #in~n; 48562#L25 assume !(~n <= 0); 48449#L26 call #t~ret0 := fact(~n - 1);< 48450#$Ultimate##0 ~n := #in~n; 48603#L25 assume !(~n <= 0); 48546#L26 call #t~ret0 := fact(~n - 1);< 48637#$Ultimate##0 ~n := #in~n; 48603#L25 assume !(~n <= 0); 48546#L26 call #t~ret0 := fact(~n - 1);< 48637#$Ultimate##0 ~n := #in~n; 48603#L25 assume !(~n <= 0); 48546#L26 call #t~ret0 := fact(~n - 1);< 48637#$Ultimate##0 ~n := #in~n; 48603#L25 assume !(~n <= 0); 48546#L26 call #t~ret0 := fact(~n - 1);< 48637#$Ultimate##0 ~n := #in~n; 48641#L25 assume ~n <= 0;#res := 1; 48639#factFINAL assume true; 48635#factEXIT >#66#return; 48634#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 48633#factFINAL assume true; 48543#factEXIT >#66#return; 48552#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 48620#factFINAL assume true; 48619#factEXIT >#66#return; 48616#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 48615#factFINAL assume true; 48612#factEXIT >#66#return; 48594#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 48605#factFINAL assume true; 48591#factEXIT >#66#return; 48426#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 48423#factFINAL assume true; 48424#factEXIT >#74#return; 47976#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 48680#$Ultimate##0 ~n := #in~n; 48678#L25 assume ~n <= 0;#res := 1; 48679#factFINAL assume true; 48690#factEXIT >#76#return; 48685#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 48686#$Ultimate##0 ~n := #in~n; 48684#L25 assume !(~n <= 0); 48439#L26 call #t~ret0 := fact(~n - 1);< 48558#$Ultimate##0 ~n := #in~n; 48669#L25 assume !(~n <= 0); 48435#L26 call #t~ret0 := fact(~n - 1);< 48559#$Ultimate##0 ~n := #in~n; 48647#L25 assume !(~n <= 0); 48430#L26 call #t~ret0 := fact(~n - 1);< 48666#$Ultimate##0 ~n := #in~n; 48645#L25 assume !(~n <= 0); 48437#L26 call #t~ret0 := fact(~n - 1);< 48673#$Ultimate##0 ~n := #in~n; 48677#L25 assume ~n <= 0;#res := 1; 48676#factFINAL assume true; 48671#factEXIT >#66#return; 48670#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 48667#factFINAL assume true; 48663#factEXIT >#66#return; 48662#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 48659#factFINAL assume true; 48648#factEXIT >#66#return; 48653#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 48712#factFINAL assume true; 48711#factEXIT >#66#return; 48444#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 48927#factFINAL assume true; 48918#factEXIT >#78#return; 47971#L30-8 [2023-02-14 14:43:23,410 INFO L750 eck$LassoCheckResult]: Loop: 47971#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 47972#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 47994#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 48473#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 48474#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 47947#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 47948#$Ultimate##0 ~n := #in~n; 48451#L25 assume !(~n <= 0); 48436#L26 call #t~ret0 := fact(~n - 1);< 48560#$Ultimate##0 ~n := #in~n; 48645#L25 assume !(~n <= 0); 48437#L26 call #t~ret0 := fact(~n - 1);< 48673#$Ultimate##0 ~n := #in~n; 48645#L25 assume !(~n <= 0); 48437#L26 call #t~ret0 := fact(~n - 1);< 48673#$Ultimate##0 ~n := #in~n; 48645#L25 assume !(~n <= 0); 48437#L26 call #t~ret0 := fact(~n - 1);< 48673#$Ultimate##0 ~n := #in~n; 48677#L25 assume ~n <= 0;#res := 1; 48676#factFINAL assume true; 48671#factEXIT >#66#return; 48670#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 48667#factFINAL assume true; 48663#factEXIT >#66#return; 48662#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 48659#factFINAL assume true; 48648#factEXIT >#66#return; 48653#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 48712#factFINAL assume true; 48711#factEXIT >#66#return; 48710#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 48709#factFINAL assume true; 48656#factEXIT >#74#return; 48657#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 48021#$Ultimate##0 ~n := #in~n; 48695#L25 assume !(~n <= 0); 48441#L26 call #t~ret0 := fact(~n - 1);< 48560#$Ultimate##0 ~n := #in~n; 48645#L25 assume !(~n <= 0); 48437#L26 call #t~ret0 := fact(~n - 1);< 48673#$Ultimate##0 ~n := #in~n; 48677#L25 assume ~n <= 0;#res := 1; 48676#factFINAL assume true; 48671#factEXIT >#66#return; 48670#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 48667#factFINAL assume true; 48663#factEXIT >#66#return; 48448#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 48950#factFINAL assume true; 48703#factEXIT >#76#return; 48419#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 48899#$Ultimate##0 ~n := #in~n; 48900#L25 assume !(~n <= 0); 48649#L26 call #t~ret0 := fact(~n - 1);< 48888#$Ultimate##0 ~n := #in~n; 48891#L25 assume ~n <= 0;#res := 1; 48887#factFINAL assume true; 48883#factEXIT >#66#return; 48886#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 48946#factFINAL assume true; 48417#factEXIT >#78#return; 47971#L30-8 [2023-02-14 14:43:23,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:43:23,410 INFO L85 PathProgramCache]: Analyzing trace with hash -2002154614, now seen corresponding path program 8 times [2023-02-14 14:43:23,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:43:23,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567044816] [2023-02-14 14:43:23,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:43:23,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:43:23,420 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 14:43:23,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [35812135] [2023-02-14 14:43:23,421 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 14:43:23,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 14:43:23,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:23,424 INFO L229 MonitoredProcess]: Starting monitored process 148 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 14:43:23,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (148)] Waiting until timeout for monitored process [2023-02-14 14:43:23,544 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 14:43:23,545 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 14:43:23,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-14 14:43:23,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:43:23,669 INFO L134 CoverageAnalysis]: Checked inductivity of 3079 backedges. 1187 proven. 74 refuted. 0 times theorem prover too weak. 1818 trivial. 0 not checked. [2023-02-14 14:43:23,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 14:43:24,111 INFO L134 CoverageAnalysis]: Checked inductivity of 3079 backedges. 323 proven. 156 refuted. 0 times theorem prover too weak. 2600 trivial. 0 not checked. [2023-02-14 14:43:24,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:43:24,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567044816] [2023-02-14 14:43:24,112 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 14:43:24,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35812135] [2023-02-14 14:43:24,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35812135] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 14:43:24,112 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 14:43:24,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 15 [2023-02-14 14:43:24,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334583772] [2023-02-14 14:43:24,112 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 14:43:24,113 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-14 14:43:24,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:43:24,113 INFO L85 PathProgramCache]: Analyzing trace with hash -234544388, now seen corresponding path program 6 times [2023-02-14 14:43:24,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:43:24,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105620096] [2023-02-14 14:43:24,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:43:24,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:43:24,116 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 14:43:24,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [889154158] [2023-02-14 14:43:24,116 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-14 14:43:24,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 14:43:24,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:24,120 INFO L229 MonitoredProcess]: Starting monitored process 149 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 14:43:24,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (149)] Waiting until timeout for monitored process [2023-02-14 14:43:24,189 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2023-02-14 14:43:24,189 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 14:43:24,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-14 14:43:24,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:43:24,303 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 48 proven. 102 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-02-14 14:43:24,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 14:43:24,923 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 48 proven. 121 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2023-02-14 14:43:24,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:43:24,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105620096] [2023-02-14 14:43:24,924 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 14:43:24,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889154158] [2023-02-14 14:43:24,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889154158] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 14:43:24,924 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 14:43:24,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17] total 20 [2023-02-14 14:43:24,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508576938] [2023-02-14 14:43:24,924 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 14:43:24,925 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-14 14:43:24,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 14:43:24,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-14 14:43:24,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2023-02-14 14:43:24,925 INFO L87 Difference]: Start difference. First operand 1667 states and 2519 transitions. cyclomatic complexity: 879 Second operand has 21 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 12 states have call successors, (12), 1 states have call predecessors, (12), 8 states have return successors, (16), 10 states have call predecessors, (16), 12 states have call successors, (16) [2023-02-14 14:43:25,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:43:25,612 INFO L93 Difference]: Finished difference Result 2383 states and 3675 transitions. [2023-02-14 14:43:25,612 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2383 states and 3675 transitions. [2023-02-14 14:43:25,632 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 53 [2023-02-14 14:43:25,657 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2383 states to 2361 states and 3635 transitions. [2023-02-14 14:43:25,657 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 523 [2023-02-14 14:43:25,658 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 523 [2023-02-14 14:43:25,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2361 states and 3635 transitions. [2023-02-14 14:43:25,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 14:43:25,659 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2361 states and 3635 transitions. [2023-02-14 14:43:25,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2361 states and 3635 transitions. [2023-02-14 14:43:25,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2361 to 1691. [2023-02-14 14:43:25,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1691 states, 1078 states have (on average 1.0769944341372912) internal successors, (1161), 1089 states have internal predecessors, (1161), 346 states have call successors, (377), 244 states have call predecessors, (377), 267 states have return successors, (1043), 357 states have call predecessors, (1043), 346 states have call successors, (1043) [2023-02-14 14:43:25,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 1691 states and 2581 transitions. [2023-02-14 14:43:25,746 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1691 states and 2581 transitions. [2023-02-14 14:43:25,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-14 14:43:25,747 INFO L428 stractBuchiCegarLoop]: Abstraction has 1691 states and 2581 transitions. [2023-02-14 14:43:25,747 INFO L335 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2023-02-14 14:43:25,747 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1691 states and 2581 transitions. [2023-02-14 14:43:25,756 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 [2023-02-14 14:43:25,756 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 14:43:25,756 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 14:43:25,758 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [32, 32, 18, 14, 14, 14, 14, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-02-14 14:43:25,758 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [11, 11, 8, 8, 8, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:43:25,759 INFO L748 eck$LassoCheckResult]: Stem: 53936#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 53879#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 53880#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 53905#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 53937#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 54229#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 54226#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 54203#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 54204#$Ultimate##0 ~n := #in~n; 54225#L25 assume ~n <= 0;#res := 1; 54223#factFINAL assume true; 54202#factEXIT >#68#return; 54193#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 54195#$Ultimate##0 ~n := #in~n; 54205#L25 assume ~n <= 0;#res := 1; 54201#factFINAL assume true; 54192#factEXIT >#70#return; 54194#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 54195#$Ultimate##0 ~n := #in~n; 54205#L25 assume ~n <= 0;#res := 1; 54201#factFINAL assume true; 54192#factEXIT >#72#return; 54190#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 54188#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 54187#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 54186#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 54185#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 54182#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 54183#$Ultimate##0 ~n := #in~n; 54222#L25 assume !(~n <= 0); 54197#L26 call #t~ret0 := fact(~n - 1);< 54200#$Ultimate##0 ~n := #in~n; 54237#L25 assume ~n <= 0;#res := 1; 54260#factFINAL assume true; 54258#factEXIT >#66#return; 54259#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54333#factFINAL assume true; 54238#factEXIT >#74#return; 54069#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 54072#$Ultimate##0 ~n := #in~n; 54292#L25 assume ~n <= 0;#res := 1; 54290#factFINAL assume true; 54280#factEXIT >#76#return; 54274#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 54275#$Ultimate##0 ~n := #in~n; 54318#L25 assume !(~n <= 0); 54212#L26 call #t~ret0 := fact(~n - 1);< 54218#$Ultimate##0 ~n := #in~n; 54341#L25 assume ~n <= 0;#res := 1; 54340#factFINAL assume true; 54338#factEXIT >#66#return; 54339#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54343#factFINAL assume true; 54273#factEXIT >#78#return; 54262#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 54257#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 54256#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 54250#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 54038#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 53960#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 53961#$Ultimate##0 ~n := #in~n; 53998#L25 assume !(~n <= 0); 53982#L26 call #t~ret0 := fact(~n - 1);< 54034#$Ultimate##0 ~n := #in~n; 54029#L25 assume !(~n <= 0); 53983#L26 call #t~ret0 := fact(~n - 1);< 54033#$Ultimate##0 ~n := #in~n; 54026#L25 assume ~n <= 0;#res := 1; 54027#factFINAL assume true; 54041#factEXIT >#66#return; 54006#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54007#factFINAL assume true; 53981#factEXIT >#66#return; 53984#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 53963#factFINAL assume true; 53959#factEXIT >#74#return; 53953#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 53956#$Ultimate##0 ~n := #in~n; 53958#L25 assume ~n <= 0;#res := 1; 53957#factFINAL assume true; 53952#factEXIT >#76#return; 53950#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 53951#$Ultimate##0 ~n := #in~n; 53978#L25 assume !(~n <= 0); 53974#L26 call #t~ret0 := fact(~n - 1);< 53993#$Ultimate##0 ~n := #in~n; 54021#L25 assume !(~n <= 0); 53972#L26 call #t~ret0 := fact(~n - 1);< 54018#$Ultimate##0 ~n := #in~n; 54022#L25 assume ~n <= 0;#res := 1; 54019#factFINAL assume true; 54017#factEXIT >#66#return; 54016#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54015#factFINAL assume true; 53970#factEXIT >#66#return; 53967#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 53962#factFINAL assume true; 53949#factEXIT >#78#return; 53948#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 53947#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 53946#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 53943#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 53899#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 53893#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 53895#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 54504#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 54498#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 54500#$Ultimate##0 ~n := #in~n; 54514#L25 assume !(~n <= 0); 54507#L26 call #t~ret0 := fact(~n - 1);< 54510#$Ultimate##0 ~n := #in~n; 54516#L25 assume ~n <= 0;#res := 1; 54512#factFINAL assume true; 54506#factEXIT >#66#return; 54503#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54501#factFINAL assume true; 54497#factEXIT >#68#return; 54477#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 54487#$Ultimate##0 ~n := #in~n; 54493#L25 assume ~n <= 0;#res := 1; 54489#factFINAL assume true; 54467#factEXIT >#70#return; 54486#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 53876#$Ultimate##0 ~n := #in~n; 54552#L25 assume !(~n <= 0); 54404#L26 call #t~ret0 := fact(~n - 1);< 54432#$Ultimate##0 ~n := #in~n; 54542#L25 assume ~n <= 0;#res := 1; 54536#factFINAL assume true; 54534#factEXIT >#66#return; 54532#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54531#factFINAL assume true; 54528#factEXIT >#72#return; 54527#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 54526#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 54525#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 54524#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 54523#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 54513#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 54519#$Ultimate##0 ~n := #in~n; 54517#L25 assume !(~n <= 0); 54508#L26 call #t~ret0 := fact(~n - 1);< 54510#$Ultimate##0 ~n := #in~n; 54516#L25 assume ~n <= 0;#res := 1; 54512#factFINAL assume true; 54506#factEXIT >#66#return; 54509#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54580#factFINAL assume true; 54579#factEXIT >#68#return; 54541#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 53923#$Ultimate##0 ~n := #in~n; 54547#L25 assume !(~n <= 0); 54406#L26 call #t~ret0 := fact(~n - 1);< 54432#$Ultimate##0 ~n := #in~n; 54542#L25 assume ~n <= 0;#res := 1; 54536#factFINAL assume true; 54534#factEXIT >#66#return; 54535#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54581#factFINAL assume true; 54578#factEXIT >#70#return; 53863#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 53864#$Ultimate##0 ~n := #in~n; 54589#L25 assume ~n <= 0;#res := 1; 54588#factFINAL assume true; 54587#factEXIT >#72#return; 54481#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 54495#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 54492#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 54488#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 54451#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 53853#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 53854#$Ultimate##0 ~n := #in~n; 54388#L25 assume !(~n <= 0); 54389#L26 call #t~ret0 := fact(~n - 1);< 54432#$Ultimate##0 ~n := #in~n; 54439#L25 assume !(~n <= 0); 54405#L26 call #t~ret0 := fact(~n - 1);< 54426#$Ultimate##0 ~n := #in~n; 54441#L25 assume ~n <= 0;#res := 1; 54433#factFINAL assume true; 54415#factEXIT >#66#return; 54417#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54429#factFINAL assume true; 54402#factEXIT >#66#return; 54414#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54612#factFINAL assume true; 54609#factEXIT >#74#return; 53886#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 54601#$Ultimate##0 ~n := #in~n; 54599#L25 assume ~n <= 0;#res := 1; 54600#factFINAL assume true; 54606#factEXIT >#76#return; 54607#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 54830#$Ultimate##0 ~n := #in~n; 54834#L25 assume !(~n <= 0); 54371#L26 call #t~ret0 := fact(~n - 1);< 54494#$Ultimate##0 ~n := #in~n; 54463#L25 assume !(~n <= 0); 54378#L26 call #t~ret0 := fact(~n - 1);< 54457#$Ultimate##0 ~n := #in~n; 54462#L25 assume ~n <= 0;#res := 1; 54461#factFINAL assume true; 54455#factEXIT >#66#return; 54452#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54450#factFINAL assume true; 54443#factEXIT >#66#return; 54423#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54890#factFINAL assume true; 54885#factEXIT >#78#return; 53881#L30-8 [2023-02-14 14:43:25,759 INFO L750 eck$LassoCheckResult]: Loop: 53881#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 53882#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 53906#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 53934#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 53944#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 53945#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 54390#$Ultimate##0 ~n := #in~n; 54391#L25 assume !(~n <= 0); 54367#L26 call #t~ret0 := fact(~n - 1);< 54387#$Ultimate##0 ~n := #in~n; 54463#L25 assume !(~n <= 0); 54378#L26 call #t~ret0 := fact(~n - 1);< 54457#$Ultimate##0 ~n := #in~n; 54463#L25 assume !(~n <= 0); 54378#L26 call #t~ret0 := fact(~n - 1);< 54457#$Ultimate##0 ~n := #in~n; 54463#L25 assume !(~n <= 0); 54378#L26 call #t~ret0 := fact(~n - 1);< 54457#$Ultimate##0 ~n := #in~n; 54462#L25 assume ~n <= 0;#res := 1; 54461#factFINAL assume true; 54455#factEXIT >#66#return; 54452#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54450#factFINAL assume true; 54443#factEXIT >#66#return; 54442#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54434#factFINAL assume true; 54418#factEXIT >#66#return; 54399#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54400#factFINAL assume true; 54366#factEXIT >#66#return; 54380#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54613#factFINAL assume true; 54614#factEXIT >#74#return; 53930#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 53931#$Ultimate##0 ~n := #in~n; 54610#L25 assume ~n <= 0;#res := 1; 54608#factFINAL assume true; 54605#factEXIT >#76#return; 54394#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 54603#$Ultimate##0 ~n := #in~n; 54604#L25 assume !(~n <= 0); 54377#L26 call #t~ret0 := fact(~n - 1);< 54395#$Ultimate##0 ~n := #in~n; 54460#L25 assume !(~n <= 0); 54376#L26 call #t~ret0 := fact(~n - 1);< 54428#$Ultimate##0 ~n := #in~n; 54401#L25 assume !(~n <= 0); 54379#L26 call #t~ret0 := fact(~n - 1);< 54447#$Ultimate##0 ~n := #in~n; 54463#L25 assume !(~n <= 0); 54378#L26 call #t~ret0 := fact(~n - 1);< 54457#$Ultimate##0 ~n := #in~n; 54462#L25 assume ~n <= 0;#res := 1; 54461#factFINAL assume true; 54455#factEXIT >#66#return; 54452#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54450#factFINAL assume true; 54443#factEXIT >#66#return; 54442#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54434#factFINAL assume true; 54418#factEXIT >#66#return; 54399#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54400#factFINAL assume true; 54366#factEXIT >#66#return; 54381#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54618#factFINAL assume true; 54619#factEXIT >#78#return; 53881#L30-8 [2023-02-14 14:43:25,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:43:25,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1498400958, now seen corresponding path program 9 times [2023-02-14 14:43:25,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:43:25,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621670836] [2023-02-14 14:43:25,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:43:25,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:43:25,773 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 14:43:25,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1927366225] [2023-02-14 14:43:25,774 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-14 14:43:25,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 14:43:25,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:25,784 INFO L229 MonitoredProcess]: Starting monitored process 150 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 14:43:25,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (150)] Waiting until timeout for monitored process [2023-02-14 14:43:25,887 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-02-14 14:43:25,887 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 14:43:25,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-14 14:43:25,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:43:25,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2239 backedges. 260 proven. 3 refuted. 0 times theorem prover too weak. 1976 trivial. 0 not checked. [2023-02-14 14:43:25,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 14:43:26,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2239 backedges. 260 proven. 4 refuted. 0 times theorem prover too weak. 1975 trivial. 0 not checked. [2023-02-14 14:43:26,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:43:26,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621670836] [2023-02-14 14:43:26,158 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 14:43:26,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927366225] [2023-02-14 14:43:26,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927366225] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 14:43:26,159 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 14:43:26,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 9 [2023-02-14 14:43:26,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072145846] [2023-02-14 14:43:26,160 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 14:43:26,161 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-14 14:43:26,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:43:26,161 INFO L85 PathProgramCache]: Analyzing trace with hash 857296756, now seen corresponding path program 7 times [2023-02-14 14:43:26,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:43:26,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921965278] [2023-02-14 14:43:26,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:43:26,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:43:26,165 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 14:43:26,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1342502292] [2023-02-14 14:43:26,166 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-14 14:43:26,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 14:43:26,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:26,169 INFO L229 MonitoredProcess]: Starting monitored process 151 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 14:43:26,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (151)] Waiting until timeout for monitored process [2023-02-14 14:43:26,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:43:26,240 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:43:26,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:43:26,265 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:43:27,264 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 14:43:27,264 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 14:43:27,264 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 14:43:27,264 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 14:43:27,264 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-14 14:43:27,264 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:27,264 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 14:43:27,264 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 14:43:27,264 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration19_Loop [2023-02-14 14:43:27,265 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 14:43:27,265 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 14:43:27,266 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:27,268 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:27,269 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:27,271 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:27,300 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:27,417 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 14:43:27,417 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-14 14:43:27,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:27,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:27,421 INFO L229 MonitoredProcess]: Starting monitored process 152 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) [2023-02-14 14:43:27,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Waiting until timeout for monitored process [2023-02-14 14:43:27,423 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 14:43:27,423 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 14:43:27,453 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 14:43:27,453 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret10#1=0} Honda state: {ULTIMATE.start_main_#t~ret10#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-14 14:43:27,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Forceful destruction successful, exit code 0 [2023-02-14 14:43:27,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:27,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:27,458 INFO L229 MonitoredProcess]: Starting monitored process 153 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) [2023-02-14 14:43:27,465 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 14:43:27,465 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 14:43:27,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Waiting until timeout for monitored process [2023-02-14 14:43:27,482 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 14:43:27,483 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post8#1=0} Honda state: {ULTIMATE.start_main_#t~post8#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-14 14:43:27,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Forceful destruction successful, exit code 0 [2023-02-14 14:43:27,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:27,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:27,488 INFO L229 MonitoredProcess]: Starting monitored process 154 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) [2023-02-14 14:43:27,493 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 14:43:27,493 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 14:43:27,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Waiting until timeout for monitored process [2023-02-14 14:43:27,509 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 14:43:27,509 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#res#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#res#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-14 14:43:27,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Forceful destruction successful, exit code 0 [2023-02-14 14:43:27,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:27,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:27,516 INFO L229 MonitoredProcess]: Starting monitored process 155 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) [2023-02-14 14:43:27,566 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 14:43:27,566 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 14:43:27,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Waiting until timeout for monitored process [2023-02-14 14:43:27,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Forceful destruction successful, exit code 0 [2023-02-14 14:43:27,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:27,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:27,590 INFO L229 MonitoredProcess]: Starting monitored process 156 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) [2023-02-14 14:43:27,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Waiting until timeout for monitored process [2023-02-14 14:43:27,595 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-14 14:43:27,595 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 14:43:27,625 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-14 14:43:27,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Forceful destruction successful, exit code 0 [2023-02-14 14:43:27,629 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 14:43:27,629 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 14:43:27,629 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 14:43:27,629 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 14:43:27,629 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-14 14:43:27,629 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:27,629 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 14:43:27,629 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 14:43:27,629 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration19_Loop [2023-02-14 14:43:27,629 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 14:43:27,629 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 14:43:27,631 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:27,635 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:27,637 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:27,638 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:27,640 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:43:27,792 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 14:43:27,792 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-14 14:43:27,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:27,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:27,794 INFO L229 MonitoredProcess]: Starting monitored process 157 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) [2023-02-14 14:43:27,805 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 [2023-02-14 14:43:27,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Waiting until timeout for monitored process [2023-02-14 14:43:27,812 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:43:27,812 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:43:27,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:43:27,813 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:43:27,813 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:43:27,813 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 14:43:27,813 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:43:27,828 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:43:27,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Forceful destruction successful, exit code 0 [2023-02-14 14:43:27,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:27,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:27,834 INFO L229 MonitoredProcess]: Starting monitored process 158 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) [2023-02-14 14:43:27,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Waiting until timeout for monitored process [2023-02-14 14:43:27,837 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 [2023-02-14 14:43:27,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:43:27,844 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:43:27,844 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:43:27,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:43:27,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:43:27,845 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 14:43:27,845 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:43:27,859 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:43:27,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Forceful destruction successful, exit code 0 [2023-02-14 14:43:27,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:27,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:27,866 INFO L229 MonitoredProcess]: Starting monitored process 159 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) [2023-02-14 14:43:27,873 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 [2023-02-14 14:43:27,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:43:27,880 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:43:27,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:43:27,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:43:27,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:43:27,881 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 14:43:27,881 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:43:27,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Waiting until timeout for monitored process [2023-02-14 14:43:27,897 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:43:27,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Forceful destruction successful, exit code 0 [2023-02-14 14:43:27,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:27,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:27,903 INFO L229 MonitoredProcess]: Starting monitored process 160 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) [2023-02-14 14:43:27,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Waiting until timeout for monitored process [2023-02-14 14:43:27,908 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 [2023-02-14 14:43:27,915 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:43:27,916 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:43:27,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:43:27,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:43:27,916 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:43:27,917 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 14:43:27,917 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:43:27,933 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 14:43:27,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Forceful destruction successful, exit code 0 [2023-02-14 14:43:27,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:27,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:27,942 INFO L229 MonitoredProcess]: Starting monitored process 161 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) [2023-02-14 14:43:27,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Waiting until timeout for monitored process [2023-02-14 14:43:27,946 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 [2023-02-14 14:43:27,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 14:43:27,954 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 14:43:27,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 14:43:27,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 14:43:27,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 14:43:27,957 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 14:43:27,957 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 14:43:27,977 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-14 14:43:27,980 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-14 14:43:27,981 INFO L444 ModelExtractionUtils]: 8 out of 11 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-14 14:43:27,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:43:27,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:27,984 INFO L229 MonitoredProcess]: Starting monitored process 162 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) [2023-02-14 14:43:27,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Waiting until timeout for monitored process [2023-02-14 14:43:27,987 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-14 14:43:27,987 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-14 14:43:27,987 INFO L513 LassoAnalysis]: Proved termination. [2023-02-14 14:43:27,987 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 7 Supporting invariants [] [2023-02-14 14:43:27,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Forceful destruction successful, exit code 0 [2023-02-14 14:43:27,994 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-14 14:43:28,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:43:28,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:43:28,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 1386 conjuncts, 66 conjunts are in the unsatisfiable core [2023-02-14 14:43:28,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:43:28,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Ended with exit code 0 [2023-02-14 14:43:29,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:43:29,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 38 conjunts are in the unsatisfiable core [2023-02-14 14:43:29,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:43:29,446 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2023-02-14 14:43:29,446 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 11 loop predicates [2023-02-14 14:43:29,447 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1691 states and 2581 transitions. cyclomatic complexity: 917 Second operand has 14 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 6 states have call successors, (12), 2 states have call predecessors, (12), 7 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) [2023-02-14 14:43:29,726 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1691 states and 2581 transitions. cyclomatic complexity: 917. Second operand has 14 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 6 states have call successors, (12), 2 states have call predecessors, (12), 7 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) Result 2337 states and 3424 transitions. Complement of second has 53 states. [2023-02-14 14:43:29,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 2 stem states 10 non-accepting loop states 1 accepting loop states [2023-02-14 14:43:29,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 6 states have call successors, (12), 2 states have call predecessors, (12), 7 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) [2023-02-14 14:43:29,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 79 transitions. [2023-02-14 14:43:29,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 79 transitions. Stem has 209 letters. Loop has 68 letters. [2023-02-14 14:43:29,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 14:43:29,729 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-14 14:43:29,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:43:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:43:29,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 1386 conjuncts, 66 conjunts are in the unsatisfiable core [2023-02-14 14:43:29,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:43:30,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:43:30,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 38 conjunts are in the unsatisfiable core [2023-02-14 14:43:30,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:43:31,265 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2023-02-14 14:43:31,266 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 11 loop predicates [2023-02-14 14:43:31,266 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1691 states and 2581 transitions. cyclomatic complexity: 917 Second operand has 14 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 6 states have call successors, (12), 2 states have call predecessors, (12), 7 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) [2023-02-14 14:43:31,575 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1691 states and 2581 transitions. cyclomatic complexity: 917. Second operand has 14 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 6 states have call successors, (12), 2 states have call predecessors, (12), 7 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) Result 2338 states and 3403 transitions. Complement of second has 51 states. [2023-02-14 14:43:31,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 2 stem states 11 non-accepting loop states 1 accepting loop states [2023-02-14 14:43:31,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 6 states have call successors, (12), 2 states have call predecessors, (12), 7 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) [2023-02-14 14:43:31,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 78 transitions. [2023-02-14 14:43:31,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 78 transitions. Stem has 209 letters. Loop has 68 letters. [2023-02-14 14:43:31,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 14:43:31,578 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-14 14:43:31,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:43:31,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:43:31,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 1386 conjuncts, 66 conjunts are in the unsatisfiable core [2023-02-14 14:43:31,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:43:32,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:43:32,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 38 conjunts are in the unsatisfiable core [2023-02-14 14:43:32,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:43:33,129 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2023-02-14 14:43:33,129 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 11 loop predicates [2023-02-14 14:43:33,130 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1691 states and 2581 transitions. cyclomatic complexity: 917 Second operand has 14 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 6 states have call successors, (12), 2 states have call predecessors, (12), 7 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) [2023-02-14 14:43:33,426 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1691 states and 2581 transitions. cyclomatic complexity: 917. Second operand has 14 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 6 states have call successors, (12), 2 states have call predecessors, (12), 7 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) Result 4497 states and 6505 transitions. Complement of second has 71 states. [2023-02-14 14:43:33,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 2 stem states 10 non-accepting loop states 1 accepting loop states [2023-02-14 14:43:33,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 6 states have call successors, (12), 2 states have call predecessors, (12), 7 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) [2023-02-14 14:43:33,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 98 transitions. [2023-02-14 14:43:33,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 98 transitions. Stem has 209 letters. Loop has 68 letters. [2023-02-14 14:43:33,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 14:43:33,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 98 transitions. Stem has 277 letters. Loop has 68 letters. [2023-02-14 14:43:33,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 14:43:33,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 98 transitions. Stem has 209 letters. Loop has 136 letters. [2023-02-14 14:43:33,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 14:43:33,435 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4497 states and 6505 transitions. [2023-02-14 14:43:33,465 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 [2023-02-14 14:43:33,503 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4497 states to 3384 states and 4940 transitions. [2023-02-14 14:43:33,503 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 491 [2023-02-14 14:43:33,504 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 497 [2023-02-14 14:43:33,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3384 states and 4940 transitions. [2023-02-14 14:43:33,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 14:43:33,505 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3384 states and 4940 transitions. [2023-02-14 14:43:33,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3384 states and 4940 transitions. [2023-02-14 14:43:33,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3384 to 2775. [2023-02-14 14:43:33,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2775 states, 1775 states have (on average 1.0816901408450703) internal successors, (1920), 1781 states have internal predecessors, (1920), 545 states have call successors, (587), 427 states have call predecessors, (587), 455 states have return successors, (1586), 566 states have call predecessors, (1586), 545 states have call successors, (1586) [2023-02-14 14:43:33,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2775 states to 2775 states and 4093 transitions. [2023-02-14 14:43:33,604 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2775 states and 4093 transitions. [2023-02-14 14:43:33,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 14:43:33,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-14 14:43:33,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-02-14 14:43:33,605 INFO L87 Difference]: Start difference. First operand 2775 states and 4093 transitions. Second operand has 10 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 6 states have call successors, (16), 1 states have call predecessors, (16), 3 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2023-02-14 14:43:33,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:43:33,813 INFO L93 Difference]: Finished difference Result 2946 states and 4225 transitions. [2023-02-14 14:43:33,813 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2946 states and 4225 transitions. [2023-02-14 14:43:33,828 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 [2023-02-14 14:43:33,851 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2946 states to 2532 states and 3602 transitions. [2023-02-14 14:43:33,851 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 401 [2023-02-14 14:43:33,852 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 401 [2023-02-14 14:43:33,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2532 states and 3602 transitions. [2023-02-14 14:43:33,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 14:43:33,852 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2532 states and 3602 transitions. [2023-02-14 14:43:33,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2532 states and 3602 transitions. [2023-02-14 14:43:33,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2532 to 2325. [2023-02-14 14:43:33,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2325 states, 1485 states have (on average 1.0734006734006734) internal successors, (1594), 1499 states have internal predecessors, (1594), 451 states have call successors, (479), 335 states have call predecessors, (479), 389 states have return successors, (1292), 490 states have call predecessors, (1292), 451 states have call successors, (1292) [2023-02-14 14:43:33,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2325 states to 2325 states and 3365 transitions. [2023-02-14 14:43:33,940 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2325 states and 3365 transitions. [2023-02-14 14:43:33,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-14 14:43:33,941 INFO L428 stractBuchiCegarLoop]: Abstraction has 2325 states and 3365 transitions. [2023-02-14 14:43:33,941 INFO L335 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2023-02-14 14:43:33,941 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2325 states and 3365 transitions. [2023-02-14 14:43:33,948 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 [2023-02-14 14:43:33,949 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 14:43:33,949 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 14:43:33,952 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [36, 36, 18, 18, 18, 18, 18, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2023-02-14 14:43:33,952 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [13, 13, 10, 10, 10, 10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:43:33,952 INFO L748 eck$LassoCheckResult]: Stem: 74542#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 74482#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 74483#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 74507#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 74543#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 74799#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 74798#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 74786#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 74787#$Ultimate##0 ~n := #in~n; 74795#L25 assume ~n <= 0;#res := 1; 74794#factFINAL assume true; 74785#factEXIT >#68#return; 74782#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 74783#$Ultimate##0 ~n := #in~n; 74789#L25 assume ~n <= 0;#res := 1; 74788#factFINAL assume true; 74780#factEXIT >#70#return; 74781#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 74783#$Ultimate##0 ~n := #in~n; 74789#L25 assume ~n <= 0;#res := 1; 74788#factFINAL assume true; 74780#factEXIT >#72#return; 74779#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 74778#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 74776#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 74774#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 74769#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 74764#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 74765#$Ultimate##0 ~n := #in~n; 74793#L25 assume !(~n <= 0); 74791#L26 call #t~ret0 := fact(~n - 1);< 74792#$Ultimate##0 ~n := #in~n; 74797#L25 assume ~n <= 0;#res := 1; 74796#factFINAL assume true; 74790#factEXIT >#66#return; 74773#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74768#factFINAL assume true; 74763#factEXIT >#74#return; 74758#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 74759#$Ultimate##0 ~n := #in~n; 74995#L25 assume ~n <= 0;#res := 1; 74988#factFINAL assume true; 74981#factEXIT >#76#return; 74982#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 75055#$Ultimate##0 ~n := #in~n; 75071#L25 assume !(~n <= 0); 75065#L26 call #t~ret0 := fact(~n - 1);< 75066#$Ultimate##0 ~n := #in~n; 75072#L25 assume ~n <= 0;#res := 1; 75070#factFINAL assume true; 75064#factEXIT >#66#return; 75062#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75063#factFINAL assume true; 75053#factEXIT >#78#return; 74747#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 74745#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 74743#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 74740#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 74738#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 74622#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 74678#$Ultimate##0 ~n := #in~n; 74712#L25 assume !(~n <= 0); 74649#L26 call #t~ret0 := fact(~n - 1);< 74737#$Ultimate##0 ~n := #in~n; 74732#L25 assume !(~n <= 0); 74650#L26 call #t~ret0 := fact(~n - 1);< 74719#$Ultimate##0 ~n := #in~n; 74729#L25 assume ~n <= 0;#res := 1; 74730#factFINAL assume true; 74718#factEXIT >#66#return; 74713#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74714#factFINAL assume true; 74648#factEXIT >#66#return; 74651#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74621#factFINAL assume true; 74623#factEXIT >#74#return; 74577#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 74575#$Ultimate##0 ~n := #in~n; 74579#L25 assume ~n <= 0;#res := 1; 74576#factFINAL assume true; 74578#factEXIT >#76#return; 74552#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 74669#$Ultimate##0 ~n := #in~n; 74666#L25 assume !(~n <= 0); 74589#L26 call #t~ret0 := fact(~n - 1);< 74653#$Ultimate##0 ~n := #in~n; 74681#L25 assume !(~n <= 0); 74588#L26 call #t~ret0 := fact(~n - 1);< 74668#$Ultimate##0 ~n := #in~n; 74673#L25 assume ~n <= 0;#res := 1; 74670#factFINAL assume true; 74667#factEXIT >#66#return; 74665#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74664#factFINAL assume true; 74585#factEXIT >#66#return; 74580#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74581#factFINAL assume true; 74551#factEXIT >#78#return; 74550#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 74549#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 74548#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 74547#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 74505#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 74495#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 74496#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 75137#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 75121#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 75122#$Ultimate##0 ~n := #in~n; 75144#L25 assume !(~n <= 0); 75140#L26 call #t~ret0 := fact(~n - 1);< 75143#$Ultimate##0 ~n := #in~n; 75147#L25 assume ~n <= 0;#res := 1; 75145#factFINAL assume true; 75139#factEXIT >#66#return; 75138#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75136#factFINAL assume true; 75119#factEXIT >#68#return; 74612#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 74617#$Ultimate##0 ~n := #in~n; 75193#L25 assume ~n <= 0;#res := 1; 74602#factFINAL assume true; 74616#factEXIT >#70#return; 74470#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 74471#$Ultimate##0 ~n := #in~n; 75192#L25 assume !(~n <= 0); 75163#L26 call #t~ret0 := fact(~n - 1);< 75171#$Ultimate##0 ~n := #in~n; 75203#L25 assume ~n <= 0;#res := 1; 75170#factFINAL assume true; 75162#factEXIT >#66#return; 75161#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75134#factFINAL assume true; 75114#factEXIT >#72#return; 75116#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 75155#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 75153#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 75151#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 75149#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 74626#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 75148#$Ultimate##0 ~n := #in~n; 75146#L25 assume !(~n <= 0); 75141#L26 call #t~ret0 := fact(~n - 1);< 75143#$Ultimate##0 ~n := #in~n; 75147#L25 assume ~n <= 0;#res := 1; 75145#factFINAL assume true; 75139#factEXIT >#66#return; 75142#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75253#factFINAL assume true; 74625#factEXIT >#68#return; 74599#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 74529#$Ultimate##0 ~n := #in~n; 75172#L25 assume !(~n <= 0); 75164#L26 call #t~ret0 := fact(~n - 1);< 75171#$Ultimate##0 ~n := #in~n; 75203#L25 assume ~n <= 0;#res := 1; 75170#factFINAL assume true; 75162#factEXIT >#66#return; 75166#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75254#factFINAL assume true; 75244#factEXIT >#70#return; 74600#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 74601#$Ultimate##0 ~n := #in~n; 75118#L25 assume ~n <= 0;#res := 1; 75113#factFINAL assume true; 74596#factEXIT >#72#return; 74595#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 74593#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 74594#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 75228#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 75227#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 74960#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 75220#$Ultimate##0 ~n := #in~n; 75218#L25 assume !(~n <= 0); 75165#L26 call #t~ret0 := fact(~n - 1);< 75171#$Ultimate##0 ~n := #in~n; 75204#L25 assume !(~n <= 0); 75182#L26 call #t~ret0 := fact(~n - 1);< 75237#$Ultimate##0 ~n := #in~n; 75204#L25 assume !(~n <= 0); 75182#L26 call #t~ret0 := fact(~n - 1);< 75237#$Ultimate##0 ~n := #in~n; 75204#L25 assume !(~n <= 0); 75182#L26 call #t~ret0 := fact(~n - 1);< 75237#$Ultimate##0 ~n := #in~n; 75243#L25 assume ~n <= 0;#res := 1; 75250#factFINAL assume true; 75234#factEXIT >#66#return; 75233#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75232#factFINAL assume true; 75221#factEXIT >#66#return; 75219#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75217#factFINAL assume true; 75208#factEXIT >#66#return; 75212#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75207#factFINAL assume true; 75194#factEXIT >#66#return; 74962#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74959#factFINAL assume true; 74961#factEXIT >#74#return; 74489#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 75404#$Ultimate##0 ~n := #in~n; 75402#L25 assume !(~n <= 0); 74488#L26 call #t~ret0 := fact(~n - 1);< 74491#$Ultimate##0 ~n := #in~n; 75941#L25 assume !(~n <= 0); 75940#L26 call #t~ret0 := fact(~n - 1);< 75939#$Ultimate##0 ~n := #in~n; 75941#L25 assume !(~n <= 0); 75940#L26 call #t~ret0 := fact(~n - 1);< 75939#$Ultimate##0 ~n := #in~n; 75942#L25 assume ~n <= 0;#res := 1; 75979#factFINAL assume true; 75976#factEXIT >#66#return; 75977#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 76783#factFINAL assume true; 75978#factEXIT >#66#return; 75975#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75971#factFINAL assume true; 75972#factEXIT >#66#return; 76771#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 76769#factFINAL assume true; 76763#factEXIT >#76#return; 74560#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 75409#$Ultimate##0 ~n := #in~n; 75765#L25 assume !(~n <= 0); 75760#L26 call #t~ret0 := fact(~n - 1);< 75761#$Ultimate##0 ~n := #in~n; 75773#L25 assume ~n <= 0;#res := 1; 75772#factFINAL assume true; 75759#factEXIT >#66#return; 75758#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75694#factFINAL assume true; 74559#factEXIT >#78#return; 74561#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 74485#binomialCoefficient_returnLabel#2 [2023-02-14 14:43:33,952 INFO L750 eck$LassoCheckResult]: Loop: 74485#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 74508#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 74570#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 74557#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 74460#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 74461#$Ultimate##0 ~n := #in~n; 75280#L25 assume !(~n <= 0); 75256#L26 call #t~ret0 := fact(~n - 1);< 75276#$Ultimate##0 ~n := #in~n; 75312#L25 assume !(~n <= 0); 75261#L26 call #t~ret0 := fact(~n - 1);< 75307#$Ultimate##0 ~n := #in~n; 75312#L25 assume !(~n <= 0); 75261#L26 call #t~ret0 := fact(~n - 1);< 75307#$Ultimate##0 ~n := #in~n; 75312#L25 assume !(~n <= 0); 75261#L26 call #t~ret0 := fact(~n - 1);< 75307#$Ultimate##0 ~n := #in~n; 75312#L25 assume !(~n <= 0); 75261#L26 call #t~ret0 := fact(~n - 1);< 75307#$Ultimate##0 ~n := #in~n; 75310#L25 assume ~n <= 0;#res := 1; 75309#factFINAL assume true; 75305#factEXIT >#66#return; 75302#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75300#factFINAL assume true; 75295#factEXIT >#66#return; 75294#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75289#factFINAL assume true; 75284#factEXIT >#66#return; 75283#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75282#factFINAL assume true; 75281#factEXIT >#66#return; 75273#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75277#factFINAL assume true; 75255#factEXIT >#66#return; 75268#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75424#factFINAL assume true; 74624#factEXIT >#74#return; 74536#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 74537#$Ultimate##0 ~n := #in~n; 75813#L25 assume !(~n <= 0); 75257#L26 call #t~ret0 := fact(~n - 1);< 75276#$Ultimate##0 ~n := #in~n; 75343#L25 assume ~n <= 0;#res := 1; 75341#factFINAL assume true; 75334#factEXIT >#66#return; 75297#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75919#factFINAL assume true; 75807#factEXIT >#76#return; 75290#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 75804#$Ultimate##0 ~n := #in~n; 75757#L25 assume !(~n <= 0); 75266#L26 call #t~ret0 := fact(~n - 1);< 75291#$Ultimate##0 ~n := #in~n; 75312#L25 assume !(~n <= 0); 75261#L26 call #t~ret0 := fact(~n - 1);< 75307#$Ultimate##0 ~n := #in~n; 75312#L25 assume !(~n <= 0); 75261#L26 call #t~ret0 := fact(~n - 1);< 75307#$Ultimate##0 ~n := #in~n; 75312#L25 assume !(~n <= 0); 75261#L26 call #t~ret0 := fact(~n - 1);< 75307#$Ultimate##0 ~n := #in~n; 75310#L25 assume ~n <= 0;#res := 1; 75309#factFINAL assume true; 75305#factEXIT >#66#return; 75302#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75300#factFINAL assume true; 75295#factEXIT >#66#return; 75294#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75289#factFINAL assume true; 75284#factEXIT >#66#return; 75283#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75282#factFINAL assume true; 75281#factEXIT >#66#return; 75271#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75821#factFINAL assume true; 75810#factEXIT >#78#return; 74484#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 74485#binomialCoefficient_returnLabel#2 [2023-02-14 14:43:33,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:43:33,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1096641103, now seen corresponding path program 10 times [2023-02-14 14:43:33,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:43:33,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142481644] [2023-02-14 14:43:33,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:43:33,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:43:33,965 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 14:43:33,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1346181569] [2023-02-14 14:43:33,966 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-14 14:43:33,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 14:43:33,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:33,967 INFO L229 MonitoredProcess]: Starting monitored process 163 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 14:43:33,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (163)] Waiting until timeout for monitored process [2023-02-14 14:43:34,116 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-14 14:43:34,117 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 14:43:34,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-14 14:43:34,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:43:34,190 INFO L134 CoverageAnalysis]: Checked inductivity of 2901 backedges. 1186 proven. 23 refuted. 0 times theorem prover too weak. 1692 trivial. 0 not checked. [2023-02-14 14:43:34,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 14:43:34,541 INFO L134 CoverageAnalysis]: Checked inductivity of 2901 backedges. 354 proven. 105 refuted. 0 times theorem prover too weak. 2442 trivial. 0 not checked. [2023-02-14 14:43:34,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:43:34,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142481644] [2023-02-14 14:43:34,542 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 14:43:34,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346181569] [2023-02-14 14:43:34,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346181569] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 14:43:34,543 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 14:43:34,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 13 [2023-02-14 14:43:34,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659939994] [2023-02-14 14:43:34,543 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 14:43:34,543 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-14 14:43:34,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:43:34,544 INFO L85 PathProgramCache]: Analyzing trace with hash 353822510, now seen corresponding path program 8 times [2023-02-14 14:43:34,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:43:34,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908295456] [2023-02-14 14:43:34,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:43:34,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:43:34,549 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 14:43:34,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1935686974] [2023-02-14 14:43:34,549 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 14:43:34,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 14:43:34,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:43:34,551 INFO L229 MonitoredProcess]: Starting monitored process 164 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 14:43:34,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (164)] Waiting until timeout for monitored process [2023-02-14 14:43:34,667 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 14:43:34,667 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-02-14 14:43:34,667 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:43:34,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:43:34,711 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:43:48,123 WARN L233 SmtUtils]: Spent 12.48s on a formula simplification. DAG size of input: 90 DAG size of output: 85 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-02-14 14:44:00,547 WARN L233 SmtUtils]: Spent 12.33s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-02-14 14:44:19,404 WARN L233 SmtUtils]: Spent 12.79s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-02-14 14:44:39,664 WARN L233 SmtUtils]: Spent 18.63s on a formula simplification. DAG size of input: 37 DAG size of output: 1 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-02-14 14:44:52,754 WARN L233 SmtUtils]: Spent 12.47s on a formula simplification that was a NOOP. DAG size: 63 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-02-14 14:44:52,755 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 14:44:52,755 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 14:44:52,756 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 14:44:52,756 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 14:44:52,756 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-14 14:44:52,756 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 14:44:52,756 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 14:44:52,756 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 14:44:52,756 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration20_Loop [2023-02-14 14:44:52,756 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 14:44:52,756 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 14:44:52,757 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:44:52,758 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:44:52,760 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:44:52,762 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:44:52,763 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 14:45:05,442 WARN L233 SmtUtils]: Spent 12.68s on a formula simplification that was a NOOP. DAG size: 63 (called from [L 269] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.setFormulaAndSimplify) [2023-02-14 14:45:05,442 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true