./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 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-numeric/Binomial.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN --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 --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 09:35:43,332 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 09:35:43,334 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 09:35:43,370 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 09:35:43,371 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 09:35:43,374 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 09:35:43,380 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 09:35:43,383 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 09:35:43,385 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 09:35:43,390 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 09:35:43,391 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 09:35:43,393 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 09:35:43,394 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 09:35:43,396 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 09:35:43,398 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 09:35:43,400 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 09:35:43,402 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 09:35:43,403 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 09:35:43,404 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 09:35:43,408 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 09:35:43,410 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 09:35:43,413 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 09:35:43,414 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 09:35:43,415 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 09:35:43,423 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 09:35:43,426 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 09:35:43,426 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 09:35:43,427 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 09:35:43,428 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 09:35:43,430 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 09:35:43,431 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 09:35:43,432 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 09:35:43,433 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 09:35:43,435 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 09:35:43,436 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 09:35:43,437 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 09:35:43,438 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 09:35:43,438 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 09:35:43,438 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 09:35:43,440 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 09:35:43,441 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 09:35:43,441 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-11-20 09:35:43,474 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 09:35:43,474 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 09:35:43,475 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 09:35:43,475 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 09:35:43,477 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 09:35:43,477 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 09:35:43,477 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 09:35:43,477 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-20 09:35:43,477 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-20 09:35:43,478 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-20 09:35:43,479 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-20 09:35:43,479 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-20 09:35:43,479 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-20 09:35:43,480 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 09:35:43,480 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 09:35:43,480 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 09:35:43,480 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 09:35:43,480 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-20 09:35:43,481 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-20 09:35:43,481 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-20 09:35:43,481 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 09:35:43,481 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-20 09:35:43,481 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 09:35:43,482 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-20 09:35:43,482 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 09:35:43,482 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 09:35:43,482 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 09:35:43,482 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 09:35:43,484 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-20 09:35:43,484 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN 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 [2022-11-20 09:35:43,735 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 09:35:43,766 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 09:35:43,768 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 09:35:43,770 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 09:35:43,770 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 09:35:43,772 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/termination-numeric/Binomial.c [2022-11-20 09:35:46,762 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 09:35:46,965 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 09:35:46,966 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/sv-benchmarks/c/termination-numeric/Binomial.c [2022-11-20 09:35:46,972 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/data/154b278cf/c57bb378318747708261e62014174777/FLAG9ed9a1c4d [2022-11-20 09:35:46,987 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/data/154b278cf/c57bb378318747708261e62014174777 [2022-11-20 09:35:46,990 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 09:35:46,991 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 09:35:46,992 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 09:35:46,993 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 09:35:46,996 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 09:35:46,997 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:35:46" (1/1) ... [2022-11-20 09:35:46,998 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f43d162 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:35:46, skipping insertion in model container [2022-11-20 09:35:46,998 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:35:46" (1/1) ... [2022-11-20 09:35:47,006 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 09:35:47,018 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 09:35:47,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:35:47,178 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 09:35:47,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:35:47,204 INFO L208 MainTranslator]: Completed translation [2022-11-20 09:35:47,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:35:47 WrapperNode [2022-11-20 09:35:47,204 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 09:35:47,206 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 09:35:47,206 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 09:35:47,206 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 09:35:47,214 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:35:47" (1/1) ... [2022-11-20 09:35:47,218 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:35:47" (1/1) ... [2022-11-20 09:35:47,237 INFO L138 Inliner]: procedures = 6, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 55 [2022-11-20 09:35:47,237 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 09:35:47,238 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 09:35:47,238 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 09:35:47,238 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 09:35:47,247 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:35:47" (1/1) ... [2022-11-20 09:35:47,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:35:47" (1/1) ... [2022-11-20 09:35:47,249 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:35:47" (1/1) ... [2022-11-20 09:35:47,249 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:35:47" (1/1) ... [2022-11-20 09:35:47,252 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:35:47" (1/1) ... [2022-11-20 09:35:47,256 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:35:47" (1/1) ... [2022-11-20 09:35:47,257 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:35:47" (1/1) ... [2022-11-20 09:35:47,258 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:35:47" (1/1) ... [2022-11-20 09:35:47,259 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 09:35:47,260 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 09:35:47,260 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 09:35:47,260 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 09:35:47,261 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:35:47" (1/1) ... [2022-11-20 09:35:47,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:47,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:47,293 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:47,305 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-20 09:35:47,337 INFO L130 BoogieDeclarations]: Found specification of procedure fact [2022-11-20 09:35:47,337 INFO L138 BoogieDeclarations]: Found implementation of procedure fact [2022-11-20 09:35:47,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 09:35:47,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 09:35:47,396 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 09:35:47,398 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 09:35:47,650 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 09:35:47,657 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 09:35:47,658 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-20 09:35:47,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:35:47 BoogieIcfgContainer [2022-11-20 09:35:47,660 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 09:35:47,661 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-20 09:35:47,661 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-20 09:35:47,665 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-20 09:35:47,666 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-20 09:35:47,666 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.11 09:35:46" (1/3) ... [2022-11-20 09:35:47,667 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@17d7452a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 09:35:47, skipping insertion in model container [2022-11-20 09:35:47,667 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-20 09:35:47,667 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:35:47" (2/3) ... [2022-11-20 09:35:47,668 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@17d7452a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 09:35:47, skipping insertion in model container [2022-11-20 09:35:47,668 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-20 09:35:47,668 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:35:47" (3/3) ... [2022-11-20 09:35:47,670 INFO L332 chiAutomizerObserver]: Analyzing ICFG Binomial.c [2022-11-20 09:35:47,727 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-20 09:35:47,728 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-20 09:35:47,728 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-20 09:35:47,728 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-20 09:35:47,728 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-20 09:35:47,728 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-20 09:35:47,729 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-20 09:35:47,729 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-20 09:35:47,734 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) [2022-11-20 09:35:47,757 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2022-11-20 09:35:47,758 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 09:35:47,758 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 09:35:47,764 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-11-20 09:35:47,764 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-20 09:35:47,764 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-20 09:35:47,765 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) [2022-11-20 09:35:47,769 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2022-11-20 09:35:47,770 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 09:35:47,770 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 09:35:47,770 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-11-20 09:35:47,771 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-20 09:35:47,779 INFO L748 eck$LassoCheckResult]: Stem: 18#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 9#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; 17#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; 13#L41-3true [2022-11-20 09:35:47,779 INFO L750 eck$LassoCheckResult]: Loop: 13#L41-3true assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 22#L42-3true assume !(main_~k~0#1 <= main_~x~0#1); 14#L41-2true main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 13#L41-3true [2022-11-20 09:35:47,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:35:47,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 1 times [2022-11-20 09:35:47,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:35:47,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360927866] [2022-11-20 09:35:47,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:35:47,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:35:47,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:35:47,954 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:35:47,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:35:48,009 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:35:48,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:35:48,014 INFO L85 PathProgramCache]: Analyzing trace with hash 57812, now seen corresponding path program 1 times [2022-11-20 09:35:48,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:35:48,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004790493] [2022-11-20 09:35:48,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:35:48,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:35:48,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:35:48,038 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:35:48,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:35:48,052 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:35:48,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:35:48,066 INFO L85 PathProgramCache]: Analyzing trace with hash 553673357, now seen corresponding path program 1 times [2022-11-20 09:35:48,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:35:48,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115412856] [2022-11-20 09:35:48,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:35:48,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:35:48,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:35:48,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:35:48,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:35:48,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115412856] [2022-11-20 09:35:48,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115412856] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:35:48,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:35:48,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 09:35:48,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728746282] [2022-11-20 09:35:48,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:35:48,301 INFO L210 LassoAnalysis]: Preferences: [2022-11-20 09:35:48,301 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-20 09:35:48,301 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-20 09:35:48,302 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-20 09:35:48,302 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-20 09:35:48,302 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:48,302 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-20 09:35:48,302 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-20 09:35:48,303 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration1_Loop [2022-11-20 09:35:48,303 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-20 09:35:48,303 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-20 09:35:48,320 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:35:48,331 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:35:48,412 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-20 09:35:48,412 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-20 09:35:48,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:48,415 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:48,419 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:48,425 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-11-20 09:35:48,426 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-20 09:35:48,427 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 09:35:48,455 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-20 09:35:48,456 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: [] [2022-11-20 09:35:48,464 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-11-20 09:35:48,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:48,466 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:48,468 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:48,476 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-11-20 09:35:48,477 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-20 09:35:48,477 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 09:35:48,515 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:48,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:48,516 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:48,517 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:48,524 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-20 09:35:48,524 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 09:35:48,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-11-20 09:35:48,694 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-20 09:35:48,697 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:48,698 INFO L210 LassoAnalysis]: Preferences: [2022-11-20 09:35:48,698 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-20 09:35:48,698 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-20 09:35:48,698 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-20 09:35:48,699 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-20 09:35:48,699 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:48,699 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-20 09:35:48,699 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-20 09:35:48,699 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration1_Loop [2022-11-20 09:35:48,699 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-20 09:35:48,700 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-20 09:35:48,701 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:35:48,706 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:35:48,753 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-20 09:35:48,758 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-20 09:35:48,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:48,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:48,761 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:48,784 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:48,784 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-11-20 09:35:48,797 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 09:35:48,797 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:48,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:48,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:48,798 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 09:35:48,799 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 09:35:48,800 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:48,812 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:48,820 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:48,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:48,821 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:48,823 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:48,831 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:48,843 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-11-20 09:35:48,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 09:35:48,844 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:48,844 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:48,844 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:48,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 09:35:48,851 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 09:35:48,851 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:48,868 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-20 09:35:48,877 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-11-20 09:35:48,878 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 2 variables to zero. [2022-11-20 09:35:48,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:48,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:48,918 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:48,921 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-11-20 09:35:48,921 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-20 09:35:48,921 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-20 09:35:48,921 INFO L513 LassoAnalysis]: Proved termination. [2022-11-20 09:35:48,922 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 [] [2022-11-20 09:35:48,932 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:48,935 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-20 09:35:48,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:35:48,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:35:48,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-20 09:35:48,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:35:49,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:35:49,009 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 09:35:49,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:35:49,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:35:49,110 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 [2022-11-20 09:35:49,112 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) [2022-11-20 09:35:49,199 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. [2022-11-20 09:35:49,202 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 [2022-11-20 09:35:49,207 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) [2022-11-20 09:35:49,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2022-11-20 09:35:49,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 54 transitions. Stem has 4 letters. Loop has 3 letters. [2022-11-20 09:35:49,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 09:35:49,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 54 transitions. Stem has 7 letters. Loop has 3 letters. [2022-11-20 09:35:49,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 09:35:49,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 54 transitions. Stem has 4 letters. Loop has 6 letters. [2022-11-20 09:35:49,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 09:35:49,213 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 106 transitions. [2022-11-20 09:35:49,219 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2022-11-20 09:35:49,226 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 33 states and 48 transitions. [2022-11-20 09:35:49,227 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2022-11-20 09:35:49,228 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2022-11-20 09:35:49,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 48 transitions. [2022-11-20 09:35:49,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 09:35:49,229 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 48 transitions. [2022-11-20 09:35:49,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 48 transitions. [2022-11-20 09:35:49,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2022-11-20 09:35:49,260 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) [2022-11-20 09:35:49,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2022-11-20 09:35:49,262 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 42 transitions. [2022-11-20 09:35:49,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:35:49,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 09:35:49,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 09:35:49,266 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) [2022-11-20 09:35:49,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:35:49,346 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2022-11-20 09:35:49,346 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2022-11-20 09:35:49,348 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2022-11-20 09:35:49,349 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 28 states and 37 transitions. [2022-11-20 09:35:49,350 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2022-11-20 09:35:49,350 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2022-11-20 09:35:49,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 37 transitions. [2022-11-20 09:35:49,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:35:49,351 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 37 transitions. [2022-11-20 09:35:49,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 37 transitions. [2022-11-20 09:35:49,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2022-11-20 09:35:49,354 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) [2022-11-20 09:35:49,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2022-11-20 09:35:49,356 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 35 transitions. [2022-11-20 09:35:49,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 09:35:49,357 INFO L428 stractBuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2022-11-20 09:35:49,357 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-20 09:35:49,358 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2022-11-20 09:35:49,359 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2022-11-20 09:35:49,359 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 09:35:49,359 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 09:35:49,360 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-11-20 09:35:49,361 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:35:49,361 INFO L748 eck$LassoCheckResult]: Stem: 241#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 232#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; 233#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 240#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; 236#L41-3 [2022-11-20 09:35:49,362 INFO L750 eck$LassoCheckResult]: Loop: 236#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 237#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 242#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#factENTRY ~n := #in~n; 231#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#factENTRY ~n := #in~n; 231#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#factENTRY ~n := #in~n; 231#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; 234#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 235#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 243#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 239#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 236#L41-3 [2022-11-20 09:35:49,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:35:49,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 2 times [2022-11-20 09:35:49,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:35:49,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842696415] [2022-11-20 09:35:49,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:35:49,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:35:49,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:35:49,369 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:35:49,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:35:49,373 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:35:49,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:35:49,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1284911041, now seen corresponding path program 1 times [2022-11-20 09:35:49,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:35:49,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128850209] [2022-11-20 09:35:49,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:35:49,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:35:49,391 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:35:49,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1893977946] [2022-11-20 09:35:49,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:35:49,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:35:49,392 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:49,394 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:35:49,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 09:35:49,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:35:49,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 09:35:49,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:35:49,501 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-20 09:35:49,502 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:35:49,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:35:49,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128850209] [2022-11-20 09:35:49,502 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 09:35:49,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893977946] [2022-11-20 09:35:49,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893977946] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:35:49,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:35:49,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 09:35:49,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103398613] [2022-11-20 09:35:49,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:35:49,504 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 09:35:49,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:35:49,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:35:49,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:35:49,506 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) [2022-11-20 09:35:49,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:35:49,583 INFO L93 Difference]: Finished difference Result 34 states and 50 transitions. [2022-11-20 09:35:49,583 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 50 transitions. [2022-11-20 09:35:49,585 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2022-11-20 09:35:49,587 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 50 transitions. [2022-11-20 09:35:49,587 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2022-11-20 09:35:49,588 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2022-11-20 09:35:49,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 50 transitions. [2022-11-20 09:35:49,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:35:49,589 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 50 transitions. [2022-11-20 09:35:49,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 50 transitions. [2022-11-20 09:35:49,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2022-11-20 09:35:49,593 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) [2022-11-20 09:35:49,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2022-11-20 09:35:49,594 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 42 transitions. [2022-11-20 09:35:49,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 09:35:49,596 INFO L428 stractBuchiCegarLoop]: Abstraction has 28 states and 42 transitions. [2022-11-20 09:35:49,596 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-20 09:35:49,596 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 42 transitions. [2022-11-20 09:35:49,597 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2022-11-20 09:35:49,597 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 09:35:49,597 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 09:35:49,598 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-11-20 09:35:49,599 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] [2022-11-20 09:35:49,599 INFO L748 eck$LassoCheckResult]: Stem: 377#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 367#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; 368#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 376#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; 372#L41-3 [2022-11-20 09:35:49,599 INFO L750 eck$LassoCheckResult]: Loop: 372#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 373#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 378#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#factENTRY ~n := #in~n; 366#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#factENTRY ~n := #in~n; 366#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#factENTRY ~n := #in~n; 366#L25 assume !(~n <= 0); 360#L26 call #t~ret0 := fact(~n - 1);< 355#factENTRY ~n := #in~n; 366#L25 assume ~n <= 0;#res := 1; 365#factFINAL assume true; 356#factEXIT >#66#return; 364#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 379#factFINAL assume true; 381#factEXIT >#78#return; 369#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; 370#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 371#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 380#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 375#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 372#L41-3 [2022-11-20 09:35:49,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:35:49,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 3 times [2022-11-20 09:35:49,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:35:49,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079678683] [2022-11-20 09:35:49,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:35:49,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:35:49,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:35:49,605 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:35:49,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:35:49,609 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:35:49,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:35:49,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1183838151, now seen corresponding path program 1 times [2022-11-20 09:35:49,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:35:49,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029301405] [2022-11-20 09:35:49,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:35:49,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:35:49,623 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:35:49,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1454139724] [2022-11-20 09:35:49,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:35:49,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:35:49,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:49,667 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-11-20 09:35:49,668 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:35:49,670 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 09:35:49,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:35:49,730 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:35:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:35:49,769 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:35:49,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:35:49,770 INFO L85 PathProgramCache]: Analyzing trace with hash 2107943858, now seen corresponding path program 1 times [2022-11-20 09:35:49,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:35:49,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995066050] [2022-11-20 09:35:49,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:35:49,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:35:49,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:35:49,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:35:49,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995066050] [2022-11-20 09:35:49,808 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2022-11-20 09:35:49,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995353783] [2022-11-20 09:35:49,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:35:49,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:35:49,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:49,818 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:35:49,823 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 09:35:49,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:35:49,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 09:35:49,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:35:49,902 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-20 09:35:49,903 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:35:49,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995353783] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:35:49,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:35:49,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 09:35:49,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746016388] [2022-11-20 09:35:49,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:35:50,422 INFO L210 LassoAnalysis]: Preferences: [2022-11-20 09:35:50,422 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-20 09:35:50,422 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-20 09:35:50,423 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-20 09:35:50,423 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-20 09:35:50,423 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:50,423 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-20 09:35:50,423 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-20 09:35:50,423 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration3_Loop [2022-11-20 09:35:50,423 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-20 09:35:50,423 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-20 09:35:50,425 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:35:50,429 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:35:50,468 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:35:50,471 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:35:50,474 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:35:50,477 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:35:50,485 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:35:50,850 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-20 09:35:50,850 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-20 09:35:50,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:50,851 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:50,858 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:50,862 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-20 09:35:50,862 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 09:35:50,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-11-20 09:35:50,892 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-20 09:35:50,892 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: [] [2022-11-20 09:35:50,903 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:50,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:50,904 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:50,905 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:50,916 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-20 09:35:50,916 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 09:35:50,929 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-11-20 09:35:50,956 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:50,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:50,957 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:50,958 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:50,969 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-20 09:35:50,969 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 09:35:50,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-11-20 09:35:51,010 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-20 09:35:51,014 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:51,015 INFO L210 LassoAnalysis]: Preferences: [2022-11-20 09:35:51,015 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-20 09:35:51,015 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-20 09:35:51,015 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-20 09:35:51,015 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-20 09:35:51,015 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:51,015 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-20 09:35:51,015 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-20 09:35:51,015 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration3_Loop [2022-11-20 09:35:51,016 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-20 09:35:51,016 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-20 09:35:51,017 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:35:51,022 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:35:51,025 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:35:51,027 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:35:51,029 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:35:51,032 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:35:51,034 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:35:51,443 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-20 09:35:51,444 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-20 09:35:51,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:51,444 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:51,446 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:51,452 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-11-20 09:35:51,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 [2022-11-20 09:35:51,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 09:35:51,466 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:51,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:51,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:51,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 09:35:51,467 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 09:35:51,467 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:51,475 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:51,480 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:51,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:51,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:51,481 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:51,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-11-20 09:35:51,488 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:51,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 09:35:51,498 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:51,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:51,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:51,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 09:35:51,503 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 09:35:51,503 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:51,535 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:51,540 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:51,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:51,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:51,544 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:51,552 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-11-20 09:35:51,553 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:51,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 09:35:51,566 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:51,566 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:51,566 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:51,566 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 09:35:51,567 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 09:35:51,567 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:51,583 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:51,592 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:51,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:51,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:51,593 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:51,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-11-20 09:35:51,605 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:51,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 09:35:51,617 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:51,618 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:51,618 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:51,618 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 09:35:51,619 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 09:35:51,619 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:51,628 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:51,637 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:51,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:51,638 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:51,640 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:51,650 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:51,663 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 09:35:51,663 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:51,663 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:51,664 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:51,664 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 09:35:51,665 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 09:35:51,665 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:51,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-11-20 09:35:51,676 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:51,685 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:51,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:51,685 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:51,688 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:51,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-11-20 09:35:51,693 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:51,706 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 09:35:51,707 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:51,707 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:51,707 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:51,707 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 09:35:51,708 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 09:35:51,708 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:51,718 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:51,727 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:51,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:51,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:51,729 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:51,733 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-11-20 09:35:51,733 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:51,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 09:35:51,747 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:51,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:51,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:51,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 09:35:51,753 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 09:35:51,753 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:51,765 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:51,774 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:51,778 INFO L490 LassoAnalysis]: Using template '2-nested'. [2022-11-20 09:35:51,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:51,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:51,779 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:51,788 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:51,800 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 09:35:51,801 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:51,801 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:51,801 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:51,801 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-20 09:35:51,802 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-20 09:35:51,802 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:51,809 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-11-20 09:35:51,810 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:51,814 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:51,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:51,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:51,816 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:51,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-11-20 09:35:51,819 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:51,829 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 09:35:51,829 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:51,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:51,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:51,830 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-20 09:35:51,831 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-20 09:35:51,831 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:51,838 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:51,844 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:51,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:51,844 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:51,845 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:51,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-11-20 09:35:51,848 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:51,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 09:35:51,858 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:51,858 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:51,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:51,859 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-20 09:35:51,859 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-20 09:35:51,860 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:51,883 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:51,886 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:51,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:51,886 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:51,887 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:51,888 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-11-20 09:35:51,890 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:51,900 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 09:35:51,900 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:51,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:51,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:51,900 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-20 09:35:51,904 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-20 09:35:51,904 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:51,919 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:51,921 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:51,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:51,922 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:51,923 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:51,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-11-20 09:35:51,926 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:51,936 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 09:35:51,936 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:51,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:51,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:51,937 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-20 09:35:51,938 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-20 09:35:51,938 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:51,963 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:51,973 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:51,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:51,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:51,975 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:51,984 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:51,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-11-20 09:35:51,995 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 09:35:51,995 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:51,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:51,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:51,996 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-20 09:35:51,997 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-20 09:35:51,997 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:52,007 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:52,016 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:52,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:52,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:52,018 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:52,024 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:52,038 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-11-20 09:35:52,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 09:35:52,039 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:52,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:52,040 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:52,040 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-20 09:35:52,047 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-20 09:35:52,047 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:52,067 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:52,075 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:52,076 INFO L490 LassoAnalysis]: Using template '3-nested'. [2022-11-20 09:35:52,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:52,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:52,077 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:52,082 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:52,094 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-11-20 09:35:52,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 09:35:52,095 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:52,096 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:52,096 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:52,096 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-20 09:35:52,097 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-20 09:35:52,097 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:52,115 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:52,123 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:52,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:52,124 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:52,126 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:52,130 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:52,142 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 09:35:52,143 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:52,143 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:52,143 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:52,143 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-20 09:35:52,145 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-20 09:35:52,145 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:52,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-11-20 09:35:52,167 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:52,171 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:52,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:52,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:52,172 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:52,180 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:52,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 09:35:52,193 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:52,193 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:52,193 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:52,193 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-20 09:35:52,194 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-20 09:35:52,194 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:52,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-11-20 09:35:52,211 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:52,219 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:52,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:52,220 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:52,221 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:52,224 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:52,237 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 09:35:52,237 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:52,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:52,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:52,237 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-20 09:35:52,238 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-20 09:35:52,239 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:52,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-11-20 09:35:52,261 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:52,269 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:52,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:52,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:52,271 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:52,275 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:52,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 09:35:52,287 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:52,288 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:52,288 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:52,288 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-20 09:35:52,289 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-20 09:35:52,289 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:52,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-11-20 09:35:52,310 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:52,313 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:52,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:52,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:52,315 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:52,320 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:52,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-11-20 09:35:52,331 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 09:35:52,331 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:52,331 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:52,331 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:52,331 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-20 09:35:52,332 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-20 09:35:52,332 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:52,337 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:52,340 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2022-11-20 09:35:52,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:52,340 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:52,342 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:52,344 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-11-20 09:35:52,345 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:52,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 09:35:52,357 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:52,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:52,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:52,357 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-20 09:35:52,369 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-20 09:35:52,370 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:52,396 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:52,403 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:52,404 INFO L490 LassoAnalysis]: Using template '4-nested'. [2022-11-20 09:35:52,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:52,404 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:52,405 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:52,416 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:52,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 09:35:52,429 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:52,429 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:52,429 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:52,429 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-20 09:35:52,430 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-20 09:35:52,430 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:52,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-11-20 09:35:52,446 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:52,455 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:52,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:52,455 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:52,457 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:52,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-11-20 09:35:52,461 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:52,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 09:35:52,474 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:52,475 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:52,475 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:52,475 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-20 09:35:52,476 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-20 09:35:52,476 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:52,495 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:52,503 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:52,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:52,504 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:52,505 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:52,512 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:52,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-11-20 09:35:52,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 09:35:52,525 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:52,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:52,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:52,526 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-20 09:35:52,528 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-20 09:35:52,528 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:52,543 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:52,551 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:52,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:52,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:52,553 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:52,558 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:52,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 09:35:52,572 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:52,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:52,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:52,572 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-20 09:35:52,573 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-11-20 09:35:52,573 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-20 09:35:52,574 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:52,591 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:52,599 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:52,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:52,599 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:52,600 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:52,604 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:52,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 09:35:52,617 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:52,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:52,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:52,617 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-20 09:35:52,620 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-20 09:35:52,620 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:52,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-11-20 09:35:52,630 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:52,639 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:52,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:52,640 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:52,641 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:52,650 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:52,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 09:35:52,662 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:52,663 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:52,663 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:52,663 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-20 09:35:52,663 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-11-20 09:35:52,664 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-20 09:35:52,664 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:52,683 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:52,691 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:52,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:52,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:52,693 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:52,696 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:52,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-11-20 09:35:52,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 09:35:52,711 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:52,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:52,712 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:52,712 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-20 09:35:52,720 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-20 09:35:52,720 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:52,743 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:52,752 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:52,752 INFO L490 LassoAnalysis]: Using template '2-phase'. [2022-11-20 09:35:52,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:52,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:52,753 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:52,757 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:52,772 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-11-20 09:35:52,772 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-20 09:35:52,772 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-20 09:35:52,773 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:52,773 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:52,773 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:52,773 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-20 09:35:52,774 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-20 09:35:52,774 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:52,785 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:52,793 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:52,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:52,794 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:52,795 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:52,798 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:52,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-11-20 09:35:52,812 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-20 09:35:52,812 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-20 09:35:52,812 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:52,812 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:52,812 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:52,812 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-20 09:35:52,814 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-20 09:35:52,814 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:52,831 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:52,835 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:52,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:52,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:52,836 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:52,844 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:52,857 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-20 09:35:52,857 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-20 09:35:52,857 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:52,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:52,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:52,857 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-20 09:35:52,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-11-20 09:35:52,858 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-20 09:35:52,859 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:52,883 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:52,892 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:52,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:52,892 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:52,894 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:52,905 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:52,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-11-20 09:35:52,919 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-20 09:35:52,919 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-20 09:35:52,919 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:52,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:52,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:52,920 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-20 09:35:52,921 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-20 09:35:52,921 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:52,951 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:52,955 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:52,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:52,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:52,956 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:52,960 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:52,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-11-20 09:35:52,974 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-20 09:35:52,974 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-20 09:35:52,974 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:52,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:52,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:52,974 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-20 09:35:52,975 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-20 09:35:52,975 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:52,986 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:52,989 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:52,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:52,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:52,990 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:52,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 [2022-11-20 09:35:53,007 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-20 09:35:53,007 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-20 09:35:53,007 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:53,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:53,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:53,007 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-20 09:35:53,009 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-20 09:35:53,009 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:53,010 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-11-20 09:35:53,039 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:53,043 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:53,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:53,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:53,045 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35: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 [2022-11-20 09:35:53,062 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-20 09:35:53,063 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-20 09:35:53,063 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:53,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:53,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:53,063 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-20 09:35:53,064 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-11-20 09:35:53,080 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-20 09:35:53,080 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:53,097 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:53,100 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:53,101 INFO L490 LassoAnalysis]: Using template '3-phase'. [2022-11-20 09:35:53,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:53,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:53,102 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:53,106 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:53,118 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-20 09:35:53,119 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-11-20 09:35:53,119 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:53,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:53,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:53,119 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-20 09:35:53,120 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-20 09:35:53,121 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:53,123 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-11-20 09:35:53,147 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:53,151 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:53,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:53,151 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:53,152 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:53,156 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:53,169 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-20 09:35:53,169 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-11-20 09:35:53,169 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:53,169 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:53,169 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:53,170 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-20 09:35:53,171 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-20 09:35:53,171 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:53,173 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-11-20 09:35:53,191 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:53,195 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:53,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:53,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:53,197 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:53,200 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:53,213 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-20 09:35:53,213 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-11-20 09:35:53,214 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:53,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:53,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:53,214 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-20 09:35:53,215 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-20 09:35:53,216 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:53,217 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-11-20 09:35:53,247 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:53,251 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:53,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:53,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:53,252 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:53,256 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:53,269 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-20 09:35:53,269 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-11-20 09:35:53,269 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:53,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:53,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:53,270 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-20 09:35:53,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-11-20 09:35:53,271 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-20 09:35:53,271 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:53,287 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:53,291 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:53,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:53,291 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:53,292 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:53,296 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:53,309 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-20 09:35:53,309 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-11-20 09:35:53,309 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:53,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:53,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:53,309 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-20 09:35:53,311 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-20 09:35:53,311 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:53,321 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-11-20 09:35:53,322 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:53,325 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:53,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:53,326 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:53,327 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:53,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 [2022-11-20 09:35:53,343 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-20 09:35:53,343 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-11-20 09:35:53,343 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:53,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:53,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:53,344 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-20 09:35:53,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-11-20 09:35:53,345 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-20 09:35:53,345 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:53,363 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:53,366 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:53,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:53,367 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:53,368 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:53,371 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2022-11-20 09:35:53,372 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:53,383 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-20 09:35:53,383 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-11-20 09:35:53,384 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:53,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:53,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:53,384 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-20 09:35:53,393 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-20 09:35:53,393 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:53,419 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:53,423 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:53,423 INFO L490 LassoAnalysis]: Using template '4-phase'. [2022-11-20 09:35:53,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:53,423 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:53,424 INFO L229 MonitoredProcess]: Starting monitored process 56 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:53,432 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:53,444 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-20 09:35:53,445 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-20 09:35:53,445 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:53,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:53,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:53,445 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-20 09:35:53,447 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-20 09:35:53,447 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:53,448 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2022-11-20 09:35:53,475 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:53,479 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:53,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:53,479 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:53,480 INFO L229 MonitoredProcess]: Starting monitored process 57 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:53,484 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:53,497 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2022-11-20 09:35:53,497 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-20 09:35:53,497 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-20 09:35:53,497 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:53,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:53,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:53,498 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-20 09:35:53,499 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-20 09:35:53,500 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:53,519 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:53,523 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:53,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:53,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:53,524 INFO L229 MonitoredProcess]: Starting monitored process 58 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:53,528 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:53,541 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-20 09:35:53,541 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-20 09:35:53,541 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:53,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:53,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:53,542 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-20 09:35:53,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2022-11-20 09:35:53,543 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-20 09:35:53,543 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:53,562 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:53,565 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:53,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:53,566 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:53,567 INFO L229 MonitoredProcess]: Starting monitored process 59 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35: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 [2022-11-20 09:35:53,584 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-20 09:35:53,584 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-20 09:35:53,584 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:53,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:53,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:53,584 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-20 09:35:53,586 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2022-11-20 09:35:53,586 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-20 09:35:53,586 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:53,603 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:53,607 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:53,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:53,607 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:53,608 INFO L229 MonitoredProcess]: Starting monitored process 60 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:53,612 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:53,625 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-20 09:35:53,625 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-20 09:35:53,625 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:53,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:53,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:53,626 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-20 09:35:53,627 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2022-11-20 09:35:53,628 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-20 09:35:53,628 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:53,647 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:53,651 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:53,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:53,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:53,652 INFO L229 MonitoredProcess]: Starting monitored process 61 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:53,656 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:53,669 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-20 09:35:53,670 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-20 09:35:53,670 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:53,670 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2022-11-20 09:35:53,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:53,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:53,670 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-20 09:35:53,672 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-20 09:35:53,672 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:53,685 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:53,689 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:53,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:53,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:53,690 INFO L229 MonitoredProcess]: Starting monitored process 62 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:53,694 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:53,708 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2022-11-20 09:35:53,712 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-20 09:35:53,712 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-20 09:35:53,712 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:53,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:53,712 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:53,713 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-20 09:35:53,725 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-20 09:35:53,725 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:53,766 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:53,770 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:53,770 INFO L490 LassoAnalysis]: Using template '2-lex'. [2022-11-20 09:35:53,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:53,770 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:53,771 INFO L229 MonitoredProcess]: Starting monitored process 63 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:53,775 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:53,788 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-20 09:35:53,788 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-20 09:35:53,788 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:53,788 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:53,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:53,788 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-20 09:35:53,789 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-20 09:35:53,789 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:53,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2022-11-20 09:35:53,799 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:53,803 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:53,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:53,803 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:53,804 INFO L229 MonitoredProcess]: Starting monitored process 64 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:53,808 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:53,820 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-20 09:35:53,821 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-20 09:35:53,821 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:53,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:53,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:53,821 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-20 09:35:53,822 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-20 09:35:53,822 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:53,832 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:53,835 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2022-11-20 09:35:53,835 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:53,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:53,836 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:53,837 INFO L229 MonitoredProcess]: Starting monitored process 65 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:53,840 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:53,853 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-20 09:35:53,853 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-20 09:35:53,853 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:53,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:53,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:53,853 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-20 09:35:53,854 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-20 09:35:53,854 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:53,855 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2022-11-20 09:35:53,879 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:53,883 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:53,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:53,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:53,884 INFO L229 MonitoredProcess]: Starting monitored process 66 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:53,889 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:53,899 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2022-11-20 09:35:53,902 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-20 09:35:53,902 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-20 09:35:53,902 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:53,903 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:53,903 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:53,903 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-20 09:35:53,903 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-20 09:35:53,904 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:53,911 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:53,914 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2022-11-20 09:35:53,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:53,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:53,916 INFO L229 MonitoredProcess]: Starting monitored process 67 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:53,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2022-11-20 09:35:53,920 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:53,930 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-20 09:35:53,930 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-20 09:35:53,930 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:53,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:53,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:53,930 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-20 09:35:53,931 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-20 09:35:53,931 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:53,947 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:53,950 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:53,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:53,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:53,952 INFO L229 MonitoredProcess]: Starting monitored process 68 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:53,956 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:53,968 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-20 09:35:53,968 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-20 09:35:53,968 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:53,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:53,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:53,968 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-20 09:35:53,969 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-20 09:35:53,969 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:53,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2022-11-20 09:35:53,991 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:53,994 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:53,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:53,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:53,996 INFO L229 MonitoredProcess]: Starting monitored process 69 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:54,004 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:54,017 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2022-11-20 09:35:54,017 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-20 09:35:54,018 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-20 09:35:54,018 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:54,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:54,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:54,018 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-20 09:35:54,025 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-20 09:35:54,025 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:54,047 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:54,051 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:54,051 INFO L490 LassoAnalysis]: Using template '3-lex'. [2022-11-20 09:35:54,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:54,051 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:54,052 INFO L229 MonitoredProcess]: Starting monitored process 70 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:54,056 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:54,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2022-11-20 09:35:54,069 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-20 09:35:54,069 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-20 09:35:54,069 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:54,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:54,069 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:54,070 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-11-20 09:35:54,071 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-20 09:35:54,071 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:54,087 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:54,091 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:54,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:54,091 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:54,092 INFO L229 MonitoredProcess]: Starting monitored process 71 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:54,096 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:54,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2022-11-20 09:35:54,109 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-20 09:35:54,109 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-20 09:35:54,109 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:54,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:54,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:54,109 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-11-20 09:35:54,111 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-20 09:35:54,111 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:54,127 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:54,130 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:54,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:54,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:54,132 INFO L229 MonitoredProcess]: Starting monitored process 72 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:54,136 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:54,148 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2022-11-20 09:35:54,149 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-20 09:35:54,149 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-20 09:35:54,150 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:54,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:54,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:54,150 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-11-20 09:35:54,151 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-20 09:35:54,151 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:54,167 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:54,170 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:54,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:54,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:54,172 INFO L229 MonitoredProcess]: Starting monitored process 73 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:54,196 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:54,209 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-20 09:35:54,209 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-20 09:35:54,209 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:54,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:54,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:54,209 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-11-20 09:35:54,210 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2022-11-20 09:35:54,211 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-20 09:35:54,214 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:54,235 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:54,239 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:54,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:54,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:54,240 INFO L229 MonitoredProcess]: Starting monitored process 74 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:54,244 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:54,256 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-20 09:35:54,256 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-20 09:35:54,257 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:54,257 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:54,257 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:54,257 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-11-20 09:35:54,258 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-20 09:35:54,258 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:54,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2022-11-20 09:35:54,275 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:54,278 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:54,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:54,279 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:54,280 INFO L229 MonitoredProcess]: Starting monitored process 75 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:54,284 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:54,296 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-20 09:35:54,297 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-20 09:35:54,297 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:54,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:54,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:54,297 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-11-20 09:35:54,300 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-20 09:35:54,300 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:54,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2022-11-20 09:35:54,310 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:54,313 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2022-11-20 09:35:54,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:54,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:54,314 INFO L229 MonitoredProcess]: Starting monitored process 76 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:54,317 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2022-11-20 09:35:54,317 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:54,329 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-20 09:35:54,329 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-20 09:35:54,329 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:54,330 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:54,330 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:54,330 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-11-20 09:35:54,341 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-20 09:35:54,341 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:54,372 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:54,375 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:54,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:35:54,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 09:35:54,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 09:35:54,376 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) [2022-11-20 09:35:54,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:35:54,426 INFO L93 Difference]: Finished difference Result 35 states and 55 transitions. [2022-11-20 09:35:54,426 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 55 transitions. [2022-11-20 09:35:54,430 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 26 [2022-11-20 09:35:54,431 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 55 transitions. [2022-11-20 09:35:54,432 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2022-11-20 09:35:54,433 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2022-11-20 09:35:54,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 55 transitions. [2022-11-20 09:35:54,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:35:54,434 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 55 transitions. [2022-11-20 09:35:54,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 55 transitions. [2022-11-20 09:35:54,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2022-11-20 09:35:54,446 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) [2022-11-20 09:35:54,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2022-11-20 09:35:54,447 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 43 transitions. [2022-11-20 09:35:54,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 09:35:54,449 INFO L428 stractBuchiCegarLoop]: Abstraction has 29 states and 43 transitions. [2022-11-20 09:35:54,449 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-11-20 09:35:54,450 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 43 transitions. [2022-11-20 09:35:54,452 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2022-11-20 09:35:54,452 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 09:35:54,453 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 09:35:54,455 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-11-20 09:35:54,456 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] [2022-11-20 09:35:54,456 INFO L748 eck$LassoCheckResult]: Stem: 545#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 535#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; 536#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 544#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; 540#L41-3 [2022-11-20 09:35:54,457 INFO L750 eck$LassoCheckResult]: Loop: 540#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 541#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 546#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#factENTRY ~n := #in~n; 534#L25 assume !(~n <= 0); 527#L26 call #t~ret0 := fact(~n - 1);< 523#factENTRY ~n := #in~n; 534#L25 assume ~n <= 0;#res := 1; 533#factFINAL assume true; 525#factEXIT >#66#return; 531#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 547#factFINAL assume true; 550#factEXIT >#68#return; 528#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 523#factENTRY ~n := #in~n; 534#L25 assume !(~n <= 0); 527#L26 call #t~ret0 := fact(~n - 1);< 523#factENTRY ~n := #in~n; 534#L25 assume ~n <= 0;#res := 1; 533#factFINAL assume true; 525#factEXIT >#66#return; 531#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 547#factFINAL assume true; 550#factEXIT >#70#return; 524#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 523#factENTRY ~n := #in~n; 534#L25 assume !(~n <= 0); 527#L26 call #t~ret0 := fact(~n - 1);< 523#factENTRY ~n := #in~n; 534#L25 assume ~n <= 0;#res := 1; 533#factFINAL assume true; 525#factEXIT >#66#return; 531#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 547#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; 542#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 539#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 548#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 543#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 540#L41-3 [2022-11-20 09:35:54,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:35:54,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 4 times [2022-11-20 09:35:54,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:35:54,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139733267] [2022-11-20 09:35:54,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:35:54,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:35:54,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:35:54,466 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:35:54,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:35:54,476 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:35:54,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:35:54,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1909923709, now seen corresponding path program 1 times [2022-11-20 09:35:54,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:35:54,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213069519] [2022-11-20 09:35:54,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:35:54,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:35:54,491 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:35:54,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1914241737] [2022-11-20 09:35:54,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:35:54,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:35:54,497 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:54,500 INFO L229 MonitoredProcess]: Starting monitored process 77 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:35:54,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2022-11-20 09:35:54,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:35:54,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 09:35:54,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:35:54,646 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 47 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-20 09:35:54,646 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:35:54,742 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-20 09:35:54,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:35:54,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213069519] [2022-11-20 09:35:54,742 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 09:35:54,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914241737] [2022-11-20 09:35:54,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914241737] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:35:54,743 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:35:54,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-11-20 09:35:54,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503663776] [2022-11-20 09:35:54,743 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:35:54,744 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 09:35:54,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:35:54,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:35:54,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:35:54,745 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) [2022-11-20 09:35:54,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:35:54,927 INFO L93 Difference]: Finished difference Result 41 states and 62 transitions. [2022-11-20 09:35:54,927 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 62 transitions. [2022-11-20 09:35:54,929 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2022-11-20 09:35:54,930 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 62 transitions. [2022-11-20 09:35:54,930 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2022-11-20 09:35:54,931 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2022-11-20 09:35:54,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 62 transitions. [2022-11-20 09:35:54,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:35:54,932 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 62 transitions. [2022-11-20 09:35:54,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 62 transitions. [2022-11-20 09:35:54,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 31. [2022-11-20 09:35:54,936 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) [2022-11-20 09:35:54,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 48 transitions. [2022-11-20 09:35:54,937 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 48 transitions. [2022-11-20 09:35:54,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 09:35:54,940 INFO L428 stractBuchiCegarLoop]: Abstraction has 31 states and 48 transitions. [2022-11-20 09:35:54,940 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-11-20 09:35:54,940 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 48 transitions. [2022-11-20 09:35:54,941 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2022-11-20 09:35:54,941 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 09:35:54,941 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 09:35:54,942 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-11-20 09:35:54,942 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:35:54,942 INFO L748 eck$LassoCheckResult]: Stem: 871#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 861#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; 862#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 870#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; 866#L41-3 [2022-11-20 09:35:54,942 INFO L750 eck$LassoCheckResult]: Loop: 866#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 867#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 872#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#factENTRY ~n := #in~n; 860#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#factENTRY ~n := #in~n; 860#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#factENTRY ~n := #in~n; 860#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; 868#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 865#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 874#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 869#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 866#L41-3 [2022-11-20 09:35:54,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:35:54,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 5 times [2022-11-20 09:35:54,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:35:54,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867601201] [2022-11-20 09:35:54,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:35:54,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:35:54,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:35:54,947 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:35:54,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:35:54,950 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:35:54,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:35:54,951 INFO L85 PathProgramCache]: Analyzing trace with hash -743603515, now seen corresponding path program 1 times [2022-11-20 09:35:54,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:35:54,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669921321] [2022-11-20 09:35:54,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:35:54,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:35:54,966 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:35:54,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1313271156] [2022-11-20 09:35:54,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:35:54,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:35:54,967 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:54,975 INFO L229 MonitoredProcess]: Starting monitored process 78 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:35:54,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2022-11-20 09:35:55,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:35:55,028 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:35:55,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:35:55,045 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:35:55,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:35:55,046 INFO L85 PathProgramCache]: Analyzing trace with hash 343305470, now seen corresponding path program 1 times [2022-11-20 09:35:55,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:35:55,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701826173] [2022-11-20 09:35:55,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:35:55,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:35:55,063 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:35:55,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [642616185] [2022-11-20 09:35:55,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:35:55,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:35:55,064 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:55,066 INFO L229 MonitoredProcess]: Starting monitored process 79 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:35:55,068 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2022-11-20 09:35:55,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:35:55,107 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:35:55,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:35:55,127 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:35:55,451 INFO L210 LassoAnalysis]: Preferences: [2022-11-20 09:35:55,451 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-20 09:35:55,451 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-20 09:35:55,451 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-20 09:35:55,451 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-20 09:35:55,452 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:55,452 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-20 09:35:55,452 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-20 09:35:55,452 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration5_Loop [2022-11-20 09:35:55,452 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-20 09:35:55,452 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-20 09:35:55,454 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:35:55,459 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:35:55,480 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:35:55,483 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:35:55,485 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:35:55,488 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:35:55,491 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:35:55,493 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:35:55,605 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-20 09:35:55,605 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-20 09:35:55,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:55,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:55,613 INFO L229 MonitoredProcess]: Starting monitored process 80 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:55,620 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-20 09:35:55,620 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 09:35:55,634 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2022-11-20 09:35:55,639 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-20 09:35:55,639 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: [] [2022-11-20 09:35:55,643 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:55,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:55,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:55,644 INFO L229 MonitoredProcess]: Starting monitored process 81 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:55,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2022-11-20 09:35:55,648 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-20 09:35:55,648 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 09:35:55,665 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2022-11-20 09:35:55,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:55,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:55,666 INFO L229 MonitoredProcess]: Starting monitored process 82 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:55,676 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-20 09:35:55,677 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 09:35:55,679 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2022-11-20 09:35:56,231 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-20 09:35:56,235 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:56,236 INFO L210 LassoAnalysis]: Preferences: [2022-11-20 09:35:56,236 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-20 09:35:56,236 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-20 09:35:56,236 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-20 09:35:56,236 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-20 09:35:56,236 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:56,236 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-20 09:35:56,236 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-20 09:35:56,236 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration5_Loop [2022-11-20 09:35:56,236 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-20 09:35:56,236 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-20 09:35:56,238 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:35:56,245 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:35:56,270 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:35:56,273 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:35:56,276 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:35:56,280 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:35:56,282 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:35:56,284 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:35:56,397 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-20 09:35:56,397 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-20 09:35:56,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:56,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:56,399 INFO L229 MonitoredProcess]: Starting monitored process 83 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:56,408 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:56,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 09:35:56,421 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:56,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:56,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:56,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 09:35:56,422 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 09:35:56,422 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:56,424 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2022-11-20 09:35:56,435 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:35:56,438 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:56,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:56,439 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:56,440 INFO L229 MonitoredProcess]: Starting monitored process 84 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:56,445 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:35:56,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 09:35:56,457 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:35:56,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:35:56,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:35:56,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 09:35:56,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2022-11-20 09:35:56,460 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 09:35:56,460 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:35:56,470 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-20 09:35:56,494 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-11-20 09:35:56,494 INFO L444 ModelExtractionUtils]: 6 out of 9 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-11-20 09:35:56,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:35:56,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:56,498 INFO L229 MonitoredProcess]: Starting monitored process 85 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:35:56,499 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-20 09:35:56,499 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-20 09:35:56,499 INFO L513 LassoAnalysis]: Proved termination. [2022-11-20 09:35:56,499 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 [] [2022-11-20 09:35:56,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2022-11-20 09:35:56,510 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2022-11-20 09:35:56,511 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-20 09:35:56,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:35:56,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:35:56,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-20 09:35:56,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:35:56,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:35:56,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-20 09:35:56,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:35:56,762 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-20 09:35:56,763 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 [2022-11-20 09:35:56,764 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) [2022-11-20 09:35:57,095 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:57,161 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. [2022-11-20 09:35:57,162 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 [2022-11-20 09:35:57,163 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) [2022-11-20 09:35:57,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 71 transitions. [2022-11-20 09:35:57,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 71 transitions. Stem has 4 letters. Loop has 23 letters. [2022-11-20 09:35:57,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 09:35:57,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 71 transitions. Stem has 27 letters. Loop has 23 letters. [2022-11-20 09:35:57,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 09:35:57,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 71 transitions. Stem has 4 letters. Loop has 46 letters. [2022-11-20 09:35:57,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 09:35:57,170 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 190 transitions. [2022-11-20 09:35:57,178 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 35 [2022-11-20 09:35:57,187 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 122 states and 189 transitions. [2022-11-20 09:35:57,187 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2022-11-20 09:35:57,188 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2022-11-20 09:35:57,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 189 transitions. [2022-11-20 09:35:57,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 09:35:57,191 INFO L218 hiAutomatonCegarLoop]: Abstraction has 122 states and 189 transitions. [2022-11-20 09:35:57,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 189 transitions. [2022-11-20 09:35:57,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 117. [2022-11-20 09:35:57,218 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) [2022-11-20 09:35:57,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 180 transitions. [2022-11-20 09:35:57,223 INFO L240 hiAutomatonCegarLoop]: Abstraction has 117 states and 180 transitions. [2022-11-20 09:35:57,223 INFO L428 stractBuchiCegarLoop]: Abstraction has 117 states and 180 transitions. [2022-11-20 09:35:57,223 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-11-20 09:35:57,223 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 180 transitions. [2022-11-20 09:35:57,225 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 35 [2022-11-20 09:35:57,226 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 09:35:57,226 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 09:35:57,227 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-11-20 09:35:57,228 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] [2022-11-20 09:35:57,228 INFO L748 eck$LassoCheckResult]: Stem: 1203#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1181#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; 1182#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 1202#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; 1213#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1192#L42-3 [2022-11-20 09:35:57,229 INFO L750 eck$LassoCheckResult]: Loop: 1192#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1209#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; 1171#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1152#factENTRY ~n := #in~n; 1234#L25 assume !(~n <= 0); 1138#L26 call #t~ret0 := fact(~n - 1);< 1187#factENTRY ~n := #in~n; 1230#L25 assume ~n <= 0;#res := 1; 1229#factFINAL assume true; 1137#factEXIT >#66#return; 1141#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1232#factFINAL assume true; 1221#factEXIT >#68#return; 1210#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1152#factENTRY ~n := #in~n; 1234#L25 assume ~n <= 0;#res := 1; 1233#factFINAL assume true; 1228#factEXIT >#70#return; 1151#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1152#factENTRY ~n := #in~n; 1234#L25 assume !(~n <= 0); 1138#L26 call #t~ret0 := fact(~n - 1);< 1187#factENTRY ~n := #in~n; 1230#L25 assume ~n <= 0;#res := 1; 1229#factFINAL assume true; 1137#factEXIT >#66#return; 1141#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1232#factFINAL assume true; 1221#factEXIT >#72#return; 1220#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; 1218#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1216#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1214#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 1200#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 1191#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1192#L42-3 [2022-11-20 09:35:57,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:35:57,229 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 1 times [2022-11-20 09:35:57,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:35:57,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604389190] [2022-11-20 09:35:57,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:35:57,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:35:57,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:35:57,241 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:35:57,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:35:57,247 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:35:57,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:35:57,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1403101825, now seen corresponding path program 2 times [2022-11-20 09:35:57,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:35:57,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38845113] [2022-11-20 09:35:57,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:35:57,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:35:57,258 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:35:57,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [706525704] [2022-11-20 09:35:57,265 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 09:35:57,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:35:57,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:57,268 INFO L229 MonitoredProcess]: Starting monitored process 86 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:35:57,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Waiting until timeout for monitored process [2022-11-20 09:35:57,321 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 09:35:57,321 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:35:57,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-20 09:35:57,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:35:57,509 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-20 09:35:57,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:35:57,777 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-20 09:35:57,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:35:57,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38845113] [2022-11-20 09:35:57,778 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 09:35:57,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706525704] [2022-11-20 09:35:57,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706525704] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:35:57,778 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:35:57,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2022-11-20 09:35:57,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285360754] [2022-11-20 09:35:57,779 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:35:57,779 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 09:35:57,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:35:57,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-20 09:35:57,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2022-11-20 09:35:57,781 INFO L87 Difference]: Start difference. First operand 117 states and 180 transitions. cyclomatic complexity: 68 Second operand has 20 states, 15 states have (on average 2.066666666666667) internal successors, (31), 18 states have internal predecessors, (31), 8 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-20 09:35:58,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:35:58,710 INFO L93 Difference]: Finished difference Result 284 states and 438 transitions. [2022-11-20 09:35:58,710 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 284 states and 438 transitions. [2022-11-20 09:35:58,715 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 110 [2022-11-20 09:35:58,720 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 284 states to 271 states and 424 transitions. [2022-11-20 09:35:58,721 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 137 [2022-11-20 09:35:58,721 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 137 [2022-11-20 09:35:58,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 271 states and 424 transitions. [2022-11-20 09:35:58,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 09:35:58,722 INFO L218 hiAutomatonCegarLoop]: Abstraction has 271 states and 424 transitions. [2022-11-20 09:35:58,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states and 424 transitions. [2022-11-20 09:35:58,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 153. [2022-11-20 09:35:58,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 97 states have (on average 1.1546391752577319) internal successors, (112), 102 states have internal predecessors, (112), 46 states have call successors, (46), 6 states have call predecessors, (46), 10 states have return successors, (78), 44 states have call predecessors, (78), 46 states have call successors, (78) [2022-11-20 09:35:58,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 236 transitions. [2022-11-20 09:35:58,740 INFO L240 hiAutomatonCegarLoop]: Abstraction has 153 states and 236 transitions. [2022-11-20 09:35:58,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 09:35:58,741 INFO L428 stractBuchiCegarLoop]: Abstraction has 153 states and 236 transitions. [2022-11-20 09:35:58,741 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-11-20 09:35:58,742 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 153 states and 236 transitions. [2022-11-20 09:35:58,743 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 52 [2022-11-20 09:35:58,743 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 09:35:58,743 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 09:35:58,745 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-11-20 09:35:58,745 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [14, 14, 9, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:35:58,745 INFO L748 eck$LassoCheckResult]: Stem: 1867#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1844#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; 1845#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 1866#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; 1886#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1856#L42-3 [2022-11-20 09:35:58,745 INFO L750 eck$LassoCheckResult]: Loop: 1856#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1913#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; 1803#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1840#factENTRY ~n := #in~n; 1841#L25 assume !(~n <= 0); 1849#L26 call #t~ret0 := fact(~n - 1);< 1850#factENTRY ~n := #in~n; 1905#L25 assume ~n <= 0;#res := 1; 1904#factFINAL assume true; 1900#factEXIT >#66#return; 1903#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1909#factFINAL assume true; 1908#factEXIT >#68#return; 1796#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1840#factENTRY ~n := #in~n; 1841#L25 assume ~n <= 0;#res := 1; 1828#factFINAL assume true; 1795#factEXIT >#70#return; 1799#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1840#factENTRY ~n := #in~n; 1841#L25 assume ~n <= 0;#res := 1; 1828#factFINAL assume true; 1795#factEXIT >#72#return; 1808#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; 1859#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1885#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1877#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1868#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; 1805#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1840#factENTRY ~n := #in~n; 1841#L25 assume !(~n <= 0); 1849#L26 call #t~ret0 := fact(~n - 1);< 1850#factENTRY ~n := #in~n; 1905#L25 assume ~n <= 0;#res := 1; 1904#factFINAL assume true; 1900#factEXIT >#66#return; 1903#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1909#factFINAL assume true; 1908#factEXIT >#68#return; 1804#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1840#factENTRY ~n := #in~n; 1841#L25 assume !(~n <= 0); 1849#L26 call #t~ret0 := fact(~n - 1);< 1850#factENTRY ~n := #in~n; 1905#L25 assume ~n <= 0;#res := 1; 1904#factFINAL assume true; 1900#factEXIT >#66#return; 1903#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1909#factFINAL assume true; 1908#factEXIT >#70#return; 1801#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1840#factENTRY ~n := #in~n; 1841#L25 assume ~n <= 0;#res := 1; 1828#factFINAL assume true; 1795#factEXIT >#72#return; 1809#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; 1923#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1922#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1921#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1888#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; 1798#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1840#factENTRY ~n := #in~n; 1841#L25 assume !(~n <= 0); 1849#L26 call #t~ret0 := fact(~n - 1);< 1850#factENTRY ~n := #in~n; 1905#L25 assume ~n <= 0;#res := 1; 1904#factFINAL assume true; 1900#factEXIT >#66#return; 1903#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1909#factFINAL assume true; 1908#factEXIT >#74#return; 1802#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1840#factENTRY ~n := #in~n; 1841#L25 assume ~n <= 0;#res := 1; 1828#factFINAL assume true; 1795#factEXIT >#76#return; 1800#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1840#factENTRY ~n := #in~n; 1841#L25 assume !(~n <= 0); 1849#L26 call #t~ret0 := fact(~n - 1);< 1850#factENTRY ~n := #in~n; 1905#L25 assume ~n <= 0;#res := 1; 1904#factFINAL assume true; 1900#factEXIT >#66#return; 1903#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1909#factFINAL assume true; 1908#factEXIT >#78#return; 1907#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; 1906#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1889#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1887#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 1863#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 1855#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1856#L42-3 [2022-11-20 09:35:58,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:35:58,746 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 2 times [2022-11-20 09:35:58,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:35:58,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214456826] [2022-11-20 09:35:58,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:35:58,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:35:58,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:35:58,750 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:35:58,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:35:58,753 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:35:58,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:35:58,753 INFO L85 PathProgramCache]: Analyzing trace with hash 885226027, now seen corresponding path program 1 times [2022-11-20 09:35:58,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:35:58,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139975419] [2022-11-20 09:35:58,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:35:58,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:35:58,763 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:35:58,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [148852938] [2022-11-20 09:35:58,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:35:58,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:35:58,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:58,765 INFO L229 MonitoredProcess]: Starting monitored process 87 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:35:58,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Waiting until timeout for monitored process [2022-11-20 09:35:58,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:35:58,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-20 09:35:58,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:35:58,926 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 184 proven. 7 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2022-11-20 09:35:58,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:35:59,115 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 16 proven. 105 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2022-11-20 09:35:59,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:35:59,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139975419] [2022-11-20 09:35:59,116 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 09:35:59,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148852938] [2022-11-20 09:35:59,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148852938] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:35:59,116 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:35:59,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2022-11-20 09:35:59,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067109898] [2022-11-20 09:35:59,116 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:35:59,117 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 09:35:59,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:35:59,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 09:35:59,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-11-20 09:35:59,118 INFO L87 Difference]: Start difference. First operand 153 states and 236 transitions. cyclomatic complexity: 88 Second operand has 11 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 6 states have call successors, (19), 2 states have call predecessors, (19), 4 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) [2022-11-20 09:35:59,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:35:59,442 INFO L93 Difference]: Finished difference Result 285 states and 408 transitions. [2022-11-20 09:35:59,443 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 285 states and 408 transitions. [2022-11-20 09:35:59,447 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 105 [2022-11-20 09:35:59,454 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 285 states to 285 states and 408 transitions. [2022-11-20 09:35:59,454 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 140 [2022-11-20 09:35:59,455 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 140 [2022-11-20 09:35:59,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 285 states and 408 transitions. [2022-11-20 09:35:59,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 09:35:59,455 INFO L218 hiAutomatonCegarLoop]: Abstraction has 285 states and 408 transitions. [2022-11-20 09:35:59,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states and 408 transitions. [2022-11-20 09:35:59,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 165. [2022-11-20 09:35:59,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 105 states have (on average 1.1428571428571428) internal successors, (120), 106 states have internal predecessors, (120), 50 states have call successors, (50), 10 states have call predecessors, (50), 10 states have return successors, (82), 48 states have call predecessors, (82), 50 states have call successors, (82) [2022-11-20 09:35:59,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 252 transitions. [2022-11-20 09:35:59,469 INFO L240 hiAutomatonCegarLoop]: Abstraction has 165 states and 252 transitions. [2022-11-20 09:35:59,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 09:35:59,470 INFO L428 stractBuchiCegarLoop]: Abstraction has 165 states and 252 transitions. [2022-11-20 09:35:59,470 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-11-20 09:35:59,471 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 165 states and 252 transitions. [2022-11-20 09:35:59,472 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2022-11-20 09:35:59,472 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 09:35:59,472 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 09:35:59,474 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-11-20 09:35:59,474 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] [2022-11-20 09:35:59,475 INFO L748 eck$LassoCheckResult]: Stem: 2870#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2846#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; 2847#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 2869#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; 2891#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 2860#L42-3 [2022-11-20 09:35:59,475 INFO L750 eck$LassoCheckResult]: Loop: 2860#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 2923#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; 2903#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 2913#factENTRY ~n := #in~n; 2922#L25 assume !(~n <= 0); 2916#L26 call #t~ret0 := fact(~n - 1);< 2853#factENTRY ~n := #in~n; 2925#L25 assume ~n <= 0;#res := 1; 2924#factFINAL assume true; 2915#factEXIT >#66#return; 2914#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2912#factFINAL assume true; 2900#factEXIT >#68#return; 2904#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 2913#factENTRY ~n := #in~n; 2922#L25 assume ~n <= 0;#res := 1; 2921#factFINAL assume true; 2920#factEXIT >#70#return; 2908#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 2911#factENTRY ~n := #in~n; 2919#L25 assume !(~n <= 0); 2916#L26 call #t~ret0 := fact(~n - 1);< 2853#factENTRY ~n := #in~n; 2925#L25 assume ~n <= 0;#res := 1; 2924#factFINAL assume true; 2915#factEXIT >#66#return; 2914#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2912#factFINAL assume true; 2900#factEXIT >#72#return; 2910#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; 2929#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 2928#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 2927#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 2926#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; 2907#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 2913#factENTRY ~n := #in~n; 2922#L25 assume !(~n <= 0); 2916#L26 call #t~ret0 := fact(~n - 1);< 2853#factENTRY ~n := #in~n; 2925#L25 assume ~n <= 0;#res := 1; 2924#factFINAL assume true; 2915#factEXIT >#66#return; 2914#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2912#factFINAL assume true; 2900#factEXIT >#68#return; 2905#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 2913#factENTRY ~n := #in~n; 2922#L25 assume !(~n <= 0); 2916#L26 call #t~ret0 := fact(~n - 1);< 2853#factENTRY ~n := #in~n; 2925#L25 assume ~n <= 0;#res := 1; 2924#factFINAL assume true; 2915#factEXIT >#66#return; 2914#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2912#factFINAL assume true; 2900#factEXIT >#70#return; 2906#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 2913#factENTRY ~n := #in~n; 2922#L25 assume !(~n <= 0); 2916#L26 call #t~ret0 := fact(~n - 1);< 2853#factENTRY ~n := #in~n; 2925#L25 assume ~n <= 0;#res := 1; 2924#factFINAL assume true; 2915#factEXIT >#66#return; 2914#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2912#factFINAL assume true; 2900#factEXIT >#72#return; 2909#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; 2937#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 2936#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 2935#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 2894#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; 2896#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 2913#factENTRY ~n := #in~n; 2922#L25 assume !(~n <= 0); 2916#L26 call #t~ret0 := fact(~n - 1);< 2853#factENTRY ~n := #in~n; 2925#L25 assume ~n <= 0;#res := 1; 2924#factFINAL assume true; 2915#factEXIT >#66#return; 2914#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2912#factFINAL assume true; 2900#factEXIT >#74#return; 2901#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 2913#factENTRY ~n := #in~n; 2922#L25 assume !(~n <= 0); 2916#L26 call #t~ret0 := fact(~n - 1);< 2853#factENTRY ~n := #in~n; 2925#L25 assume ~n <= 0;#res := 1; 2924#factFINAL assume true; 2915#factEXIT >#66#return; 2914#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2912#factFINAL assume true; 2900#factEXIT >#76#return; 2902#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 2911#factENTRY ~n := #in~n; 2919#L25 assume !(~n <= 0); 2916#L26 call #t~ret0 := fact(~n - 1);< 2853#factENTRY ~n := #in~n; 2925#L25 assume ~n <= 0;#res := 1; 2924#factFINAL assume true; 2915#factEXIT >#66#return; 2914#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2912#factFINAL assume true; 2900#factEXIT >#78#return; 2899#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; 2898#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 2897#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 2893#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 2867#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 2859#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 2860#L42-3 [2022-11-20 09:35:59,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:35:59,475 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 3 times [2022-11-20 09:35:59,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:35:59,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950264509] [2022-11-20 09:35:59,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:35:59,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:35:59,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:35:59,479 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:35:59,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:35:59,483 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:35:59,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:35:59,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1877972557, now seen corresponding path program 2 times [2022-11-20 09:35:59,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:35:59,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97084314] [2022-11-20 09:35:59,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:35:59,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:35:59,493 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:35:59,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [165271405] [2022-11-20 09:35:59,494 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 09:35:59,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:35:59,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:59,498 INFO L229 MonitoredProcess]: Starting monitored process 88 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:35:59,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Waiting until timeout for monitored process [2022-11-20 09:35:59,581 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 09:35:59,581 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:35:59,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-20 09:35:59,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:35:59,735 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 355 proven. 48 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2022-11-20 09:35:59,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:36:00,061 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 61 proven. 115 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2022-11-20 09:36:00,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:36:00,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97084314] [2022-11-20 09:36:00,062 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 09:36:00,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165271405] [2022-11-20 09:36:00,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165271405] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:36:00,062 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:36:00,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 15 [2022-11-20 09:36:00,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340818387] [2022-11-20 09:36:00,063 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:36:00,065 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 09:36:00,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:36:00,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-20 09:36:00,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-11-20 09:36:00,066 INFO L87 Difference]: Start difference. First operand 165 states and 252 transitions. cyclomatic complexity: 92 Second operand has 15 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 15 states have internal predecessors, (44), 8 states have call successors, (20), 2 states have call predecessors, (20), 5 states have return successors, (20), 8 states have call predecessors, (20), 8 states have call successors, (20) [2022-11-20 09:36:00,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:36:00,517 INFO L93 Difference]: Finished difference Result 300 states and 489 transitions. [2022-11-20 09:36:00,517 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 300 states and 489 transitions. [2022-11-20 09:36:00,521 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 93 [2022-11-20 09:36:00,526 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 300 states to 288 states and 477 transitions. [2022-11-20 09:36:00,526 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 145 [2022-11-20 09:36:00,526 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 145 [2022-11-20 09:36:00,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 288 states and 477 transitions. [2022-11-20 09:36:00,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 09:36:00,527 INFO L218 hiAutomatonCegarLoop]: Abstraction has 288 states and 477 transitions. [2022-11-20 09:36:00,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states and 477 transitions. [2022-11-20 09:36:00,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 251. [2022-11-20 09:36:00,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 163 states have (on average 1.116564417177914) internal successors, (182), 162 states have internal predecessors, (182), 72 states have call successors, (72), 14 states have call predecessors, (72), 16 states have return successors, (178), 74 states have call predecessors, (178), 72 states have call successors, (178) [2022-11-20 09:36:00,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 432 transitions. [2022-11-20 09:36:00,542 INFO L240 hiAutomatonCegarLoop]: Abstraction has 251 states and 432 transitions. [2022-11-20 09:36:00,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 09:36:00,543 INFO L428 stractBuchiCegarLoop]: Abstraction has 251 states and 432 transitions. [2022-11-20 09:36:00,544 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-11-20 09:36:00,544 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 251 states and 432 transitions. [2022-11-20 09:36:00,546 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 85 [2022-11-20 09:36:00,546 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 09:36:00,546 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 09:36:00,547 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-11-20 09:36:00,548 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [16, 16, 9, 7, 7, 7, 7, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:36:00,548 INFO L748 eck$LassoCheckResult]: Stem: 4035#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 4010#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; 4011#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 4034#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; 4050#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 4023#L42-3 [2022-11-20 09:36:00,548 INFO L750 eck$LassoCheckResult]: Loop: 4023#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 4097#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; 4082#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 3964#factENTRY ~n := #in~n; 4156#L25 assume !(~n <= 0); 3970#L26 call #t~ret0 := fact(~n - 1);< 4016#factENTRY ~n := #in~n; 4150#L25 assume ~n <= 0;#res := 1; 4148#factFINAL assume true; 4141#factEXIT >#66#return; 4142#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4154#factFINAL assume true; 4080#factEXIT >#68#return; 4085#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 3964#factENTRY ~n := #in~n; 4156#L25 assume ~n <= 0;#res := 1; 4095#factFINAL assume true; 4090#factEXIT >#70#return; 3981#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 3982#factENTRY ~n := #in~n; 4044#L25 assume !(~n <= 0); 3970#L26 call #t~ret0 := fact(~n - 1);< 4016#factENTRY ~n := #in~n; 4150#L25 assume ~n <= 0;#res := 1; 4148#factFINAL assume true; 4141#factEXIT >#66#return; 4142#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4154#factFINAL assume true; 4080#factEXIT >#72#return; 4088#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; 4193#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 4192#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 4191#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 4190#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; 4084#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 3964#factENTRY ~n := #in~n; 4156#L25 assume !(~n <= 0); 3970#L26 call #t~ret0 := fact(~n - 1);< 4016#factENTRY ~n := #in~n; 4150#L25 assume ~n <= 0;#res := 1; 4148#factFINAL assume true; 4141#factEXIT >#66#return; 4142#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4154#factFINAL assume true; 4080#factEXIT >#68#return; 4047#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 3964#factENTRY ~n := #in~n; 4156#L25 assume !(~n <= 0); 3970#L26 call #t~ret0 := fact(~n - 1);< 4016#factENTRY ~n := #in~n; 4150#L25 assume ~n <= 0;#res := 1; 4148#factFINAL assume true; 4141#factEXIT >#66#return; 4142#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4154#factFINAL assume true; 4080#factEXIT >#70#return; 4006#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 4005#factENTRY ~n := #in~n; 4007#L25 assume ~n <= 0;#res := 1; 4095#factFINAL assume true; 4090#factEXIT >#72#return; 4089#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; 4211#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#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; 4188#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 4053#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; 3963#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 3964#factENTRY ~n := #in~n; 4156#L25 assume !(~n <= 0); 3970#L26 call #t~ret0 := fact(~n - 1);< 4016#factENTRY ~n := #in~n; 4150#L25 assume ~n <= 0;#res := 1; 4148#factFINAL assume true; 4141#factEXIT >#66#return; 4142#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4154#factFINAL assume true; 4080#factEXIT >#74#return; 4083#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 3964#factENTRY ~n := #in~n; 4156#L25 assume !(~n <= 0); 3970#L26 call #t~ret0 := fact(~n - 1);< 4016#factENTRY ~n := #in~n; 4150#L25 assume ~n <= 0;#res := 1; 4148#factFINAL assume true; 4141#factEXIT >#66#return; 4142#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4154#factFINAL assume true; 4080#factEXIT >#76#return; 4045#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 3982#factENTRY ~n := #in~n; 4044#L25 assume !(~n <= 0); 3970#L26 call #t~ret0 := fact(~n - 1);< 4016#factENTRY ~n := #in~n; 4150#L25 assume ~n <= 0;#res := 1; 4148#factFINAL assume true; 4141#factEXIT >#66#return; 4142#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4154#factFINAL assume true; 4080#factEXIT >#78#return; 4012#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; 4013#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 4054#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 4052#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 4031#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 4022#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 4023#L42-3 [2022-11-20 09:36:00,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:00,549 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 4 times [2022-11-20 09:36:00,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:00,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465462024] [2022-11-20 09:36:00,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:00,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:00,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:36:00,553 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:36:00,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:36:00,556 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:36:00,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:00,556 INFO L85 PathProgramCache]: Analyzing trace with hash -77194901, now seen corresponding path program 3 times [2022-11-20 09:36:00,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:00,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631271035] [2022-11-20 09:36:00,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:00,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:00,565 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:36:00,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1699219894] [2022-11-20 09:36:00,572 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 09:36:00,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:36:00,580 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:00,587 INFO L229 MonitoredProcess]: Starting monitored process 89 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:36:00,609 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Waiting until timeout for monitored process [2022-11-20 09:36:00,668 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-20 09:36:00,668 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:36:00,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-20 09:36:00,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:00,857 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 96 proven. 66 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-11-20 09:36:00,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:36:01,263 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 94 proven. 69 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2022-11-20 09:36:01,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:36:01,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631271035] [2022-11-20 09:36:01,264 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 09:36:01,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699219894] [2022-11-20 09:36:01,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699219894] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:36:01,264 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:36:01,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 22 [2022-11-20 09:36:01,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485534841] [2022-11-20 09:36:01,265 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:36:01,266 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 09:36:01,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:36:01,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-20 09:36:01,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2022-11-20 09:36:01,267 INFO L87 Difference]: Start difference. First operand 251 states and 432 transitions. cyclomatic complexity: 188 Second operand has 23 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 23 states have internal predecessors, (46), 11 states have call successors, (17), 1 states have call predecessors, (17), 4 states have return successors, (17), 6 states have call predecessors, (17), 11 states have call successors, (17) [2022-11-20 09:36:02,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:36:02,901 INFO L93 Difference]: Finished difference Result 673 states and 1222 transitions. [2022-11-20 09:36:02,901 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 673 states and 1222 transitions. [2022-11-20 09:36:02,915 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 248 [2022-11-20 09:36:02,925 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 673 states to 667 states and 1216 transitions. [2022-11-20 09:36:02,925 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 332 [2022-11-20 09:36:02,926 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 332 [2022-11-20 09:36:02,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 667 states and 1216 transitions. [2022-11-20 09:36:02,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 09:36:02,926 INFO L218 hiAutomatonCegarLoop]: Abstraction has 667 states and 1216 transitions. [2022-11-20 09:36:02,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states and 1216 transitions. [2022-11-20 09:36:02,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 292. [2022-11-20 09:36:02,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 187 states have (on average 1.1229946524064172) internal successors, (210), 184 states have internal predecessors, (210), 89 states have call successors, (89), 14 states have call predecessors, (89), 16 states have return successors, (221), 93 states have call predecessors, (221), 89 states have call successors, (221) [2022-11-20 09:36:02,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 520 transitions. [2022-11-20 09:36:02,951 INFO L240 hiAutomatonCegarLoop]: Abstraction has 292 states and 520 transitions. [2022-11-20 09:36:02,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-20 09:36:02,952 INFO L428 stractBuchiCegarLoop]: Abstraction has 292 states and 520 transitions. [2022-11-20 09:36:02,952 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-11-20 09:36:02,953 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 292 states and 520 transitions. [2022-11-20 09:36:02,955 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 89 [2022-11-20 09:36:02,955 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 09:36:02,955 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 09:36:02,957 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-11-20 09:36:02,957 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [20, 20, 11, 11, 11, 11, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:36:02,957 INFO L748 eck$LassoCheckResult]: Stem: 5663#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 5641#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; 5642#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 5662#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; 5681#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 5652#L42-3 [2022-11-20 09:36:02,958 INFO L750 eck$LassoCheckResult]: Loop: 5652#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 5733#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; 5692#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 5712#factENTRY ~n := #in~n; 5718#L25 assume !(~n <= 0); 5719#L26 call #t~ret0 := fact(~n - 1);< 5646#factENTRY ~n := #in~n; 5731#L25 assume !(~n <= 0); 5725#L26 call #t~ret0 := fact(~n - 1);< 5646#factENTRY ~n := #in~n; 5731#L25 assume ~n <= 0;#res := 1; 5730#factFINAL assume true; 5727#factEXIT >#66#return; 5726#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5732#factFINAL assume true; 5724#factEXIT >#66#return; 5722#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5721#factFINAL assume true; 5689#factEXIT >#68#return; 5702#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 5712#factENTRY ~n := #in~n; 5718#L25 assume ~n <= 0;#res := 1; 5715#factFINAL assume true; 5713#factEXIT >#70#return; 5699#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 5709#factENTRY ~n := #in~n; 5729#L25 assume !(~n <= 0); 5719#L26 call #t~ret0 := fact(~n - 1);< 5646#factENTRY ~n := #in~n; 5731#L25 assume ~n <= 0;#res := 1; 5730#factFINAL assume true; 5727#factEXIT >#66#return; 5723#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5710#factFINAL assume true; 5711#factEXIT >#72#return; 5717#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; 5825#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 5823#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 5822#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 5816#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; 5695#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 5712#factENTRY ~n := #in~n; 5718#L25 assume !(~n <= 0); 5719#L26 call #t~ret0 := fact(~n - 1);< 5646#factENTRY ~n := #in~n; 5731#L25 assume !(~n <= 0); 5725#L26 call #t~ret0 := fact(~n - 1);< 5646#factENTRY ~n := #in~n; 5731#L25 assume ~n <= 0;#res := 1; 5730#factFINAL assume true; 5727#factEXIT >#66#return; 5726#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5732#factFINAL assume true; 5724#factEXIT >#66#return; 5722#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5721#factFINAL assume true; 5689#factEXIT >#68#return; 5690#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 5712#factENTRY ~n := #in~n; 5718#L25 assume !(~n <= 0); 5719#L26 call #t~ret0 := fact(~n - 1);< 5646#factENTRY ~n := #in~n; 5731#L25 assume !(~n <= 0); 5725#L26 call #t~ret0 := fact(~n - 1);< 5646#factENTRY ~n := #in~n; 5731#L25 assume ~n <= 0;#res := 1; 5730#factFINAL assume true; 5727#factEXIT >#66#return; 5726#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5732#factFINAL assume true; 5724#factEXIT >#66#return; 5722#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5721#factFINAL assume true; 5689#factEXIT >#70#return; 5705#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 5716#factENTRY ~n := #in~n; 5720#L25 assume ~n <= 0;#res := 1; 5715#factFINAL assume true; 5713#factEXIT >#72#return; 5714#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; 5811#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 5752#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 5745#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 5683#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; 5703#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 5712#factENTRY ~n := #in~n; 5718#L25 assume !(~n <= 0); 5719#L26 call #t~ret0 := fact(~n - 1);< 5646#factENTRY ~n := #in~n; 5731#L25 assume !(~n <= 0); 5725#L26 call #t~ret0 := fact(~n - 1);< 5646#factENTRY ~n := #in~n; 5731#L25 assume ~n <= 0;#res := 1; 5730#factFINAL assume true; 5727#factEXIT >#66#return; 5726#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5732#factFINAL assume true; 5724#factEXIT >#66#return; 5722#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5721#factFINAL assume true; 5689#factEXIT >#74#return; 5700#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 5712#factENTRY ~n := #in~n; 5718#L25 assume ~n <= 0;#res := 1; 5715#factFINAL assume true; 5713#factEXIT >#76#return; 5693#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 5709#factENTRY ~n := #in~n; 5729#L25 assume !(~n <= 0); 5719#L26 call #t~ret0 := fact(~n - 1);< 5646#factENTRY ~n := #in~n; 5731#L25 assume !(~n <= 0); 5725#L26 call #t~ret0 := fact(~n - 1);< 5646#factENTRY ~n := #in~n; 5731#L25 assume ~n <= 0;#res := 1; 5730#factFINAL assume true; 5727#factEXIT >#66#return; 5726#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5732#factFINAL assume true; 5724#factEXIT >#66#return; 5722#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5721#factFINAL assume true; 5689#factEXIT >#78#return; 5688#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; 5687#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 5684#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 5682#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 5659#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 5651#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 5652#L42-3 [2022-11-20 09:36:02,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:02,958 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 5 times [2022-11-20 09:36:02,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:02,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570847973] [2022-11-20 09:36:02,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:02,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:02,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:36:02,962 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:36:02,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:36:02,966 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:36:02,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:02,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1233557403, now seen corresponding path program 4 times [2022-11-20 09:36:02,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:02,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791268737] [2022-11-20 09:36:02,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:02,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:02,976 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:36:02,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2030318095] [2022-11-20 09:36:02,977 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 09:36:02,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:36:02,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:02,980 INFO L229 MonitoredProcess]: Starting monitored process 90 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:36:02,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Waiting until timeout for monitored process [2022-11-20 09:36:03,067 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 09:36:03,067 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:36:03,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-20 09:36:03,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:03,170 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 408 proven. 29 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2022-11-20 09:36:03,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:36:03,621 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 24 proven. 290 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2022-11-20 09:36:03,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:36:03,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791268737] [2022-11-20 09:36:03,621 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 09:36:03,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030318095] [2022-11-20 09:36:03,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030318095] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:36:03,622 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:36:03,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 15 [2022-11-20 09:36:03,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263867103] [2022-11-20 09:36:03,622 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:36:03,623 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 09:36:03,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:36:03,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-20 09:36:03,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-11-20 09:36:03,624 INFO L87 Difference]: Start difference. First operand 292 states and 520 transitions. cyclomatic complexity: 236 Second operand has 15 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 10 states have call successors, (23), 2 states have call predecessors, (23), 6 states have return successors, (24), 8 states have call predecessors, (24), 10 states have call successors, (24) [2022-11-20 09:36:04,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:36:04,056 INFO L93 Difference]: Finished difference Result 527 states and 864 transitions. [2022-11-20 09:36:04,057 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 527 states and 864 transitions. [2022-11-20 09:36:04,063 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 174 [2022-11-20 09:36:04,069 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 527 states to 527 states and 864 transitions. [2022-11-20 09:36:04,070 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 230 [2022-11-20 09:36:04,070 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 230 [2022-11-20 09:36:04,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 527 states and 864 transitions. [2022-11-20 09:36:04,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 09:36:04,070 INFO L218 hiAutomatonCegarLoop]: Abstraction has 527 states and 864 transitions. [2022-11-20 09:36:04,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states and 864 transitions. [2022-11-20 09:36:04,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 325. [2022-11-20 09:36:04,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 199 states have (on average 1.1155778894472361) internal successors, (222), 194 states have internal predecessors, (222), 110 states have call successors, (110), 20 states have call predecessors, (110), 16 states have return successors, (254), 110 states have call predecessors, (254), 110 states have call successors, (254) [2022-11-20 09:36:04,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 586 transitions. [2022-11-20 09:36:04,088 INFO L240 hiAutomatonCegarLoop]: Abstraction has 325 states and 586 transitions. [2022-11-20 09:36:04,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 09:36:04,089 INFO L428 stractBuchiCegarLoop]: Abstraction has 325 states and 586 transitions. [2022-11-20 09:36:04,089 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-11-20 09:36:04,089 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 325 states and 586 transitions. [2022-11-20 09:36:04,092 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 97 [2022-11-20 09:36:04,092 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 09:36:04,092 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 09:36:04,093 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-11-20 09:36:04,094 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [19, 19, 10, 10, 10, 10, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:36:04,094 INFO L748 eck$LassoCheckResult]: Stem: 7294#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 7271#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; 7272#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 7293#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; 7308#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 7284#L42-3 [2022-11-20 09:36:04,094 INFO L750 eck$LassoCheckResult]: Loop: 7284#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 7358#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; 7321#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 7342#factENTRY ~n := #in~n; 7365#L25 assume !(~n <= 0); 7354#L26 call #t~ret0 := fact(~n - 1);< 7362#factENTRY ~n := #in~n; 7366#L25 assume ~n <= 0;#res := 1; 7363#factFINAL assume true; 7360#factEXIT >#66#return; 7359#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7340#factFINAL assume true; 7341#factEXIT >#68#return; 7329#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 7342#factENTRY ~n := #in~n; 7365#L25 assume ~n <= 0;#res := 1; 7346#factFINAL assume true; 7344#factEXIT >#70#return; 7330#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 7343#factENTRY ~n := #in~n; 7364#L25 assume !(~n <= 0); 7354#L26 call #t~ret0 := fact(~n - 1);< 7362#factENTRY ~n := #in~n; 7366#L25 assume ~n <= 0;#res := 1; 7363#factFINAL assume true; 7360#factEXIT >#66#return; 7359#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7340#factFINAL assume true; 7341#factEXIT >#72#return; 7348#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; 7400#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 7399#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 7383#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 7382#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; 7318#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 7342#factENTRY ~n := #in~n; 7365#L25 assume !(~n <= 0); 7354#L26 call #t~ret0 := fact(~n - 1);< 7362#factENTRY ~n := #in~n; 7366#L25 assume !(~n <= 0); 7353#L26 call #t~ret0 := fact(~n - 1);< 7362#factENTRY ~n := #in~n; 7366#L25 assume ~n <= 0;#res := 1; 7363#factFINAL assume true; 7360#factEXIT >#66#return; 7357#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7368#factFINAL assume true; 7352#factEXIT >#66#return; 7351#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7350#factFINAL assume true; 7317#factEXIT >#68#return; 7325#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 7342#factENTRY ~n := #in~n; 7365#L25 assume !(~n <= 0); 7354#L26 call #t~ret0 := fact(~n - 1);< 7362#factENTRY ~n := #in~n; 7366#L25 assume !(~n <= 0); 7353#L26 call #t~ret0 := fact(~n - 1);< 7362#factENTRY ~n := #in~n; 7366#L25 assume ~n <= 0;#res := 1; 7363#factFINAL assume true; 7360#factEXIT >#66#return; 7357#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7368#factFINAL assume true; 7352#factEXIT >#66#return; 7351#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7350#factFINAL assume true; 7317#factEXIT >#70#return; 7337#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 7347#factENTRY ~n := #in~n; 7349#L25 assume ~n <= 0;#res := 1; 7346#factFINAL assume true; 7344#factEXIT >#72#return; 7345#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; 7405#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 7403#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 7402#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 7309#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; 7311#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 7342#factENTRY ~n := #in~n; 7365#L25 assume !(~n <= 0); 7354#L26 call #t~ret0 := fact(~n - 1);< 7362#factENTRY ~n := #in~n; 7366#L25 assume !(~n <= 0); 7353#L26 call #t~ret0 := fact(~n - 1);< 7362#factENTRY ~n := #in~n; 7366#L25 assume ~n <= 0;#res := 1; 7363#factFINAL assume true; 7360#factEXIT >#66#return; 7357#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7368#factFINAL assume true; 7352#factEXIT >#66#return; 7351#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7350#factFINAL assume true; 7317#factEXIT >#74#return; 7326#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 7342#factENTRY ~n := #in~n; 7365#L25 assume ~n <= 0;#res := 1; 7346#factFINAL assume true; 7344#factEXIT >#76#return; 7331#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 7339#factENTRY ~n := #in~n; 7371#L25 assume !(~n <= 0); 7356#L26 call #t~ret0 := fact(~n - 1);< 7276#factENTRY ~n := #in~n; 7367#L25 assume !(~n <= 0); 7353#L26 call #t~ret0 := fact(~n - 1);< 7362#factENTRY ~n := #in~n; 7366#L25 assume ~n <= 0;#res := 1; 7363#factFINAL assume true; 7360#factEXIT >#66#return; 7357#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7368#factFINAL assume true; 7352#factEXIT >#66#return; 7351#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7350#factFINAL assume true; 7317#factEXIT >#78#return; 7316#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; 7315#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 7314#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 7313#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 7287#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 7283#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 7284#L42-3 [2022-11-20 09:36:04,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:04,095 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 6 times [2022-11-20 09:36:04,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:04,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813340896] [2022-11-20 09:36:04,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:04,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:04,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:36:04,098 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:36:04,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:36:04,102 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:36:04,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:04,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1601053981, now seen corresponding path program 5 times [2022-11-20 09:36:04,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:04,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205787177] [2022-11-20 09:36:04,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:04,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:04,112 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:36:04,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [380088721] [2022-11-20 09:36:04,113 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-20 09:36:04,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:36:04,113 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:04,119 INFO L229 MonitoredProcess]: Starting monitored process 91 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:36:04,131 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Waiting until timeout for monitored process [2022-11-20 09:36:04,205 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2022-11-20 09:36:04,205 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:36:04,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-20 09:36:04,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:04,333 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 468 proven. 71 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2022-11-20 09:36:04,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:36:04,743 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 68 proven. 193 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2022-11-20 09:36:04,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:36:04,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205787177] [2022-11-20 09:36:04,743 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 09:36:04,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380088721] [2022-11-20 09:36:04,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380088721] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:36:04,743 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:36:04,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 16 [2022-11-20 09:36:04,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485130380] [2022-11-20 09:36:04,744 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:36:04,744 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 09:36:04,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:36:04,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-20 09:36:04,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-11-20 09:36:04,745 INFO L87 Difference]: Start difference. First operand 325 states and 586 transitions. cyclomatic complexity: 269 Second operand has 16 states, 13 states have (on average 3.769230769230769) internal successors, (49), 16 states have internal predecessors, (49), 11 states have call successors, (21), 2 states have call predecessors, (21), 6 states have return successors, (21), 7 states have call predecessors, (21), 11 states have call successors, (21) [2022-11-20 09:36:05,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:36:05,376 INFO L93 Difference]: Finished difference Result 539 states and 948 transitions. [2022-11-20 09:36:05,376 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 539 states and 948 transitions. [2022-11-20 09:36:05,383 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 168 [2022-11-20 09:36:05,390 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 539 states to 539 states and 948 transitions. [2022-11-20 09:36:05,390 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 253 [2022-11-20 09:36:05,392 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 253 [2022-11-20 09:36:05,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 539 states and 948 transitions. [2022-11-20 09:36:05,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 09:36:05,393 INFO L218 hiAutomatonCegarLoop]: Abstraction has 539 states and 948 transitions. [2022-11-20 09:36:05,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states and 948 transitions. [2022-11-20 09:36:05,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 431. [2022-11-20 09:36:05,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 253 states have (on average 1.1304347826086956) internal successors, (286), 248 states have internal predecessors, (286), 162 states have call successors, (162), 26 states have call predecessors, (162), 16 states have return successors, (340), 156 states have call predecessors, (340), 162 states have call successors, (340) [2022-11-20 09:36:05,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 788 transitions. [2022-11-20 09:36:05,416 INFO L240 hiAutomatonCegarLoop]: Abstraction has 431 states and 788 transitions. [2022-11-20 09:36:05,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 09:36:05,419 INFO L428 stractBuchiCegarLoop]: Abstraction has 431 states and 788 transitions. [2022-11-20 09:36:05,419 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-11-20 09:36:05,419 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 431 states and 788 transitions. [2022-11-20 09:36:05,422 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 132 [2022-11-20 09:36:05,423 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 09:36:05,423 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 09:36:05,423 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:36:05,423 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-20 09:36:05,424 INFO L748 eck$LassoCheckResult]: Stem: 8914#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 8874#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; 8875#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 8913#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; 8899#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 8900#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 9046#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; 8970#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 9001#factENTRY ~n := #in~n; 9036#L25 assume !(~n <= 0); 9020#L26 call #t~ret0 := fact(~n - 1);< 9034#factENTRY [2022-11-20 09:36:05,424 INFO L750 eck$LassoCheckResult]: Loop: 9034#factENTRY ~n := #in~n; 9049#L25 assume !(~n <= 0); 9023#L26 call #t~ret0 := fact(~n - 1);< 9034#factENTRY [2022-11-20 09:36:05,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:05,424 INFO L85 PathProgramCache]: Analyzing trace with hash 271623377, now seen corresponding path program 1 times [2022-11-20 09:36:05,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:05,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132905236] [2022-11-20 09:36:05,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:05,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:05,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:05,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:36:05,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:36:05,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132905236] [2022-11-20 09:36:05,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132905236] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:36:05,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:36:05,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 09:36:05,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123566245] [2022-11-20 09:36:05,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:36:05,493 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-20 09:36:05,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:05,493 INFO L85 PathProgramCache]: Analyzing trace with hash 29980, now seen corresponding path program 1 times [2022-11-20 09:36:05,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:05,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170923578] [2022-11-20 09:36:05,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:05,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:05,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:36:05,496 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:36:05,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:36:05,498 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:36:05,524 INFO L210 LassoAnalysis]: Preferences: [2022-11-20 09:36:05,524 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-20 09:36:05,524 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-20 09:36:05,524 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-20 09:36:05,525 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-20 09:36:05,525 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:05,525 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-20 09:36:05,525 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-20 09:36:05,525 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration12_Loop [2022-11-20 09:36:05,525 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-20 09:36:05,525 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-20 09:36:05,526 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:05,528 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:05,534 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:05,537 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:05,561 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-20 09:36:05,561 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-20 09:36:05,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:05,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:05,567 INFO L229 MonitoredProcess]: Starting monitored process 92 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:05,572 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-20 09:36:05,572 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 09:36:05,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2022-11-20 09:36:05,595 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-20 09:36:05,595 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_#res=0} Honda state: {fact_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-11-20 09:36:05,598 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2022-11-20 09:36:05,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:05,599 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:05,600 INFO L229 MonitoredProcess]: Starting monitored process 93 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:05,608 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-20 09:36:05,608 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 09:36:05,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2022-11-20 09:36:05,647 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Forceful destruction successful, exit code 0 [2022-11-20 09:36:05,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:05,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:05,649 INFO L229 MonitoredProcess]: Starting monitored process 94 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:05,656 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-20 09:36:05,656 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 09:36:05,670 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2022-11-20 09:36:05,748 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-20 09:36:05,752 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Forceful destruction successful, exit code 0 [2022-11-20 09:36:05,752 INFO L210 LassoAnalysis]: Preferences: [2022-11-20 09:36:05,752 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-20 09:36:05,752 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-20 09:36:05,752 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-20 09:36:05,752 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-20 09:36:05,752 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:05,752 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-20 09:36:05,752 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-20 09:36:05,753 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration12_Loop [2022-11-20 09:36:05,753 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-20 09:36:05,753 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-20 09:36:05,753 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:05,756 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:05,762 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:05,764 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:05,786 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-20 09:36:05,786 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-20 09:36:05,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:05,787 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:05,788 INFO L229 MonitoredProcess]: Starting monitored process 95 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:05,791 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:36:05,803 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 09:36:05,803 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:36:05,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:36:05,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:36:05,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 09:36:05,804 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 09:36:05,804 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:36:05,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2022-11-20 09:36:05,812 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:36:05,814 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Ended with exit code 0 [2022-11-20 09:36:05,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:05,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:05,816 INFO L229 MonitoredProcess]: Starting monitored process 96 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:05,819 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:36:05,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2022-11-20 09:36:05,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 09:36:05,830 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:36:05,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:36:05,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:36:05,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 09:36:05,831 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 09:36:05,831 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:36:05,833 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-20 09:36:05,835 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-11-20 09:36:05,835 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-11-20 09:36:05,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:05,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:05,838 INFO L229 MonitoredProcess]: Starting monitored process 97 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:05,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2022-11-20 09:36:05,839 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-20 09:36:05,840 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-20 09:36:05,840 INFO L513 LassoAnalysis]: Proved termination. [2022-11-20 09:36:05,840 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fact_#in~n) = 1*fact_#in~n Supporting invariants [] [2022-11-20 09:36:05,842 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Forceful destruction successful, exit code 0 [2022-11-20 09:36:05,843 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-20 09:36:05,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:05,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:05,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 09:36:05,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:05,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:05,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 09:36:05,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:05,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:36:05,927 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 [2022-11-20 09:36:05,927 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 431 states and 788 transitions. cyclomatic complexity: 365 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) [2022-11-20 09:36:05,987 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 431 states and 788 transitions. cyclomatic complexity: 365. 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 531 states and 944 transitions. Complement of second has 13 states. [2022-11-20 09:36:05,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-11-20 09:36:05,989 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) [2022-11-20 09:36:05,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-11-20 09:36:05,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 11 letters. Loop has 3 letters. [2022-11-20 09:36:05,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 09:36:05,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 14 letters. Loop has 3 letters. [2022-11-20 09:36:05,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 09:36:05,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 11 letters. Loop has 6 letters. [2022-11-20 09:36:05,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 09:36:05,990 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 531 states and 944 transitions. [2022-11-20 09:36:05,998 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 140 [2022-11-20 09:36:06,006 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 531 states to 517 states and 928 transitions. [2022-11-20 09:36:06,006 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 234 [2022-11-20 09:36:06,007 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 237 [2022-11-20 09:36:06,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 517 states and 928 transitions. [2022-11-20 09:36:06,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 09:36:06,007 INFO L218 hiAutomatonCegarLoop]: Abstraction has 517 states and 928 transitions. [2022-11-20 09:36:06,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states and 928 transitions. [2022-11-20 09:36:06,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 511. [2022-11-20 09:36:06,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 303 states have (on average 1.1485148514851484) internal successors, (348), 300 states have internal predecessors, (348), 184 states have call successors, (184), 42 states have call predecessors, (184), 24 states have return successors, (386), 168 states have call predecessors, (386), 184 states have call successors, (386) [2022-11-20 09:36:06,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 918 transitions. [2022-11-20 09:36:06,029 INFO L240 hiAutomatonCegarLoop]: Abstraction has 511 states and 918 transitions. [2022-11-20 09:36:06,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:36:06,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 09:36:06,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:36:06,029 INFO L87 Difference]: Start difference. First operand 511 states and 918 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) [2022-11-20 09:36:06,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:36:06,097 INFO L93 Difference]: Finished difference Result 574 states and 1006 transitions. [2022-11-20 09:36:06,097 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 574 states and 1006 transitions. [2022-11-20 09:36:06,125 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 166 [2022-11-20 09:36:06,133 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 574 states to 574 states and 1006 transitions. [2022-11-20 09:36:06,134 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 267 [2022-11-20 09:36:06,134 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 267 [2022-11-20 09:36:06,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 574 states and 1006 transitions. [2022-11-20 09:36:06,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 09:36:06,135 INFO L218 hiAutomatonCegarLoop]: Abstraction has 574 states and 1006 transitions. [2022-11-20 09:36:06,135 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Forceful destruction successful, exit code 0 [2022-11-20 09:36:06,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states and 1006 transitions. [2022-11-20 09:36:06,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 569. [2022-11-20 09:36:06,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 341 states have (on average 1.1407624633431086) internal successors, (389), 336 states have internal predecessors, (389), 200 states have call successors, (200), 46 states have call predecessors, (200), 28 states have return successors, (410), 186 states have call predecessors, (410), 200 states have call successors, (410) [2022-11-20 09:36:06,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 999 transitions. [2022-11-20 09:36:06,159 INFO L240 hiAutomatonCegarLoop]: Abstraction has 569 states and 999 transitions. [2022-11-20 09:36:06,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 09:36:06,160 INFO L428 stractBuchiCegarLoop]: Abstraction has 569 states and 999 transitions. [2022-11-20 09:36:06,160 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-11-20 09:36:06,160 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 569 states and 999 transitions. [2022-11-20 09:36:06,165 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 163 [2022-11-20 09:36:06,165 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 09:36:06,165 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 09:36:06,166 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:36:06,166 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:36:06,166 INFO L748 eck$LassoCheckResult]: Stem: 11045#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 11009#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; 11010#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 11044#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; 11029#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 11030#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 11233#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; 11231#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 11232#factENTRY ~n := #in~n; 11236#L25 assume ~n <= 0;#res := 1; 11234#factFINAL assume true; 11230#factEXIT >#68#return; 11018#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 11078#factENTRY ~n := #in~n; 11252#L25 assume ~n <= 0;#res := 1; 11251#factFINAL assume true; 11218#factEXIT >#70#return; 11058#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 10954#factENTRY ~n := #in~n; 11254#L25 assume !(~n <= 0); 11174#L26 call #t~ret0 := fact(~n - 1);< 11187#factENTRY ~n := #in~n; 11185#L25 assume !(~n <= 0); 11173#L26 call #t~ret0 := fact(~n - 1);< 11184#factENTRY ~n := #in~n; 11186#L25 assume ~n <= 0;#res := 1; 11195#factFINAL assume true; 11192#factEXIT >#66#return; 11155#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 11183#factFINAL assume true; 11172#factEXIT >#66#return; 11049#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 11069#factFINAL assume true; 11223#factEXIT >#72#return; 11034#L30-3 [2022-11-20 09:36:06,167 INFO L750 eck$LassoCheckResult]: Loop: 11034#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; 11035#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 11290#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 11289#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 11264#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; 10958#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 10971#factENTRY ~n := #in~n; 11075#L25 assume ~n <= 0;#res := 1; 10973#factFINAL assume true; 10957#factEXIT >#68#return; 10960#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 11203#factENTRY ~n := #in~n; 11246#L25 assume !(~n <= 0); 11150#L26 call #t~ret0 := fact(~n - 1);< 11156#factENTRY ~n := #in~n; 11164#L25 assume ~n <= 0;#res := 1; 11157#factFINAL assume true; 11148#factEXIT >#66#return; 11154#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 11237#factFINAL assume true; 11235#factEXIT >#70#return; 11057#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 11205#factENTRY ~n := #in~n; 11207#L25 assume !(~n <= 0); 11149#L26 call #t~ret0 := fact(~n - 1);< 11177#factENTRY ~n := #in~n; 11194#L25 assume !(~n <= 0); 11151#L26 call #t~ret0 := fact(~n - 1);< 11177#factENTRY ~n := #in~n; 11194#L25 assume !(~n <= 0); 11151#L26 call #t~ret0 := fact(~n - 1);< 11177#factENTRY ~n := #in~n; 11194#L25 assume ~n <= 0;#res := 1; 11157#factFINAL assume true; 11148#factEXIT >#66#return; 11155#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 11183#factFINAL assume true; 11172#factEXIT >#66#return; 11155#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 11183#factFINAL assume true; 11172#factEXIT >#66#return; 11049#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 11069#factFINAL assume true; 11223#factEXIT >#72#return; 11034#L30-3 [2022-11-20 09:36:06,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:06,167 INFO L85 PathProgramCache]: Analyzing trace with hash 914152944, now seen corresponding path program 1 times [2022-11-20 09:36:06,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:06,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942993247] [2022-11-20 09:36:06,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:06,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:06,176 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:36:06,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1879040227] [2022-11-20 09:36:06,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:06,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:36:06,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:06,178 INFO L229 MonitoredProcess]: Starting monitored process 98 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:36:06,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Waiting until timeout for monitored process [2022-11-20 09:36:06,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:06,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-20 09:36:06,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:06,301 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-20 09:36:06,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:36:06,400 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-20 09:36:06,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:36:06,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942993247] [2022-11-20 09:36:06,401 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 09:36:06,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879040227] [2022-11-20 09:36:06,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879040227] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:36:06,401 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:36:06,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-11-20 09:36:06,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350898321] [2022-11-20 09:36:06,402 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:36:06,402 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-20 09:36:06,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:06,402 INFO L85 PathProgramCache]: Analyzing trace with hash -142265232, now seen corresponding path program 1 times [2022-11-20 09:36:06,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:06,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472926414] [2022-11-20 09:36:06,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:06,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:06,406 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:36:06,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2052892791] [2022-11-20 09:36:06,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:06,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:36:06,407 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:06,408 INFO L229 MonitoredProcess]: Starting monitored process 99 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:36:06,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Waiting until timeout for monitored process [2022-11-20 09:36:06,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:06,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-20 09:36:06,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:06,518 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 56 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-20 09:36:06,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:36:06,677 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 2 proven. 37 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-11-20 09:36:06,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:36:06,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472926414] [2022-11-20 09:36:06,677 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 09:36:06,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052892791] [2022-11-20 09:36:06,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052892791] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:36:06,678 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:36:06,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2022-11-20 09:36:06,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090388151] [2022-11-20 09:36:06,678 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:36:06,678 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 09:36:06,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:36:06,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 09:36:06,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-20 09:36:06,679 INFO L87 Difference]: Start difference. First operand 569 states and 999 transitions. cyclomatic complexity: 446 Second operand has 10 states, 7 states have (on average 3.0) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-20 09:36:06,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:36:06,935 INFO L93 Difference]: Finished difference Result 635 states and 1115 transitions. [2022-11-20 09:36:06,935 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 635 states and 1115 transitions. [2022-11-20 09:36:06,944 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 191 [2022-11-20 09:36:06,954 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 635 states to 635 states and 1115 transitions. [2022-11-20 09:36:06,954 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 293 [2022-11-20 09:36:06,954 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 293 [2022-11-20 09:36:06,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 635 states and 1115 transitions. [2022-11-20 09:36:06,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 09:36:06,955 INFO L218 hiAutomatonCegarLoop]: Abstraction has 635 states and 1115 transitions. [2022-11-20 09:36:06,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states and 1115 transitions. [2022-11-20 09:36:06,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 553. [2022-11-20 09:36:06,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 331 states have (on average 1.1389728096676737) internal successors, (377), 326 states have internal predecessors, (377), 194 states have call successors, (194), 46 states have call predecessors, (194), 28 states have return successors, (394), 180 states have call predecessors, (394), 194 states have call successors, (394) [2022-11-20 09:36:06,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 965 transitions. [2022-11-20 09:36:06,982 INFO L240 hiAutomatonCegarLoop]: Abstraction has 553 states and 965 transitions. [2022-11-20 09:36:06,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 09:36:06,983 INFO L428 stractBuchiCegarLoop]: Abstraction has 553 states and 965 transitions. [2022-11-20 09:36:06,983 INFO L335 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2022-11-20 09:36:06,983 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 553 states and 965 transitions. [2022-11-20 09:36:06,987 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 155 [2022-11-20 09:36:06,987 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 09:36:06,987 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 09:36:06,988 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:36:06,988 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:36:06,988 INFO L748 eck$LassoCheckResult]: Stem: 12701#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 12666#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; 12667#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 12700#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; 12686#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 12687#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 12919#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; 12917#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 12918#factENTRY ~n := #in~n; 12923#L25 assume ~n <= 0;#res := 1; 12922#factFINAL assume true; 12916#factEXIT >#68#return; 12673#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 12887#factENTRY ~n := #in~n; 12884#L25 assume ~n <= 0;#res := 1; 12885#factFINAL assume true; 12895#factEXIT >#70#return; 12709#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 12897#factENTRY ~n := #in~n; 12914#L25 assume ~n <= 0;#res := 1; 12885#factFINAL assume true; 12895#factEXIT >#72#return; 12896#L30-3 [2022-11-20 09:36:06,989 INFO L750 eck$LassoCheckResult]: Loop: 12896#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; 12911#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 12907#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 12906#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 12902#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; 12903#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 12921#factENTRY ~n := #in~n; 12925#L25 assume ~n <= 0;#res := 1; 12924#factFINAL assume true; 12920#factEXIT >#68#return; 12674#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 12887#factENTRY ~n := #in~n; 12884#L25 assume ~n <= 0;#res := 1; 12885#factFINAL assume true; 12895#factEXIT >#70#return; 12645#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 12646#factENTRY ~n := #in~n; 12915#L25 assume ~n <= 0;#res := 1; 12885#factFINAL assume true; 12895#factEXIT >#72#return; 12896#L30-3 [2022-11-20 09:36:06,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:06,989 INFO L85 PathProgramCache]: Analyzing trace with hash -455324880, now seen corresponding path program 1 times [2022-11-20 09:36:06,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:06,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389739454] [2022-11-20 09:36:06,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:06,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:06,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:36:06,996 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:36:07,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:36:07,003 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:36:07,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:07,004 INFO L85 PathProgramCache]: Analyzing trace with hash 467014384, now seen corresponding path program 1 times [2022-11-20 09:36:07,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:07,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126150791] [2022-11-20 09:36:07,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:07,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:07,007 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:36:07,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [991523383] [2022-11-20 09:36:07,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:07,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:36:07,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:07,011 INFO L229 MonitoredProcess]: Starting monitored process 100 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:36:07,039 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Waiting until timeout for monitored process [2022-11-20 09:36:07,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:36:07,062 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:36:07,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:36:07,075 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:36:07,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:07,076 INFO L85 PathProgramCache]: Analyzing trace with hash 448000159, now seen corresponding path program 1 times [2022-11-20 09:36:07,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:07,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193475258] [2022-11-20 09:36:07,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:07,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:07,083 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:36:07,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1593029059] [2022-11-20 09:36:07,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:07,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:36:07,084 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:07,091 INFO L229 MonitoredProcess]: Starting monitored process 101 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:36:07,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Waiting until timeout for monitored process [2022-11-20 09:36:07,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:07,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 09:36:07,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:07,201 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-20 09:36:07,201 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:36:07,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:36:07,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193475258] [2022-11-20 09:36:07,201 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 09:36:07,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593029059] [2022-11-20 09:36:07,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593029059] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:36:07,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:36:07,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 09:36:07,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876689314] [2022-11-20 09:36:07,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:36:07,535 INFO L210 LassoAnalysis]: Preferences: [2022-11-20 09:36:07,535 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-20 09:36:07,535 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-20 09:36:07,535 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-20 09:36:07,536 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-20 09:36:07,536 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:07,536 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-20 09:36:07,536 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-20 09:36:07,536 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration14_Loop [2022-11-20 09:36:07,536 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-20 09:36:07,536 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-20 09:36:07,537 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:07,540 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:07,543 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:07,561 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:07,563 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:07,566 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:07,568 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:07,664 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-20 09:36:07,664 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-20 09:36:07,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:07,664 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:07,672 INFO L229 MonitoredProcess]: Starting monitored process 102 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:07,673 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-20 09:36:07,673 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 09:36:07,686 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2022-11-20 09:36:07,695 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-20 09:36:07,696 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: [] [2022-11-20 09:36:07,699 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Forceful destruction successful, exit code 0 [2022-11-20 09:36:07,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:07,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:07,701 INFO L229 MonitoredProcess]: Starting monitored process 103 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:07,704 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-20 09:36:07,704 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 09:36:07,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2022-11-20 09:36:07,735 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-20 09:36:07,736 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=1} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-11-20 09:36:07,741 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Ended with exit code 0 [2022-11-20 09:36:07,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:07,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:07,743 INFO L229 MonitoredProcess]: Starting monitored process 104 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:07,746 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-20 09:36:07,746 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 09:36:07,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2022-11-20 09:36:07,772 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Forceful destruction successful, exit code 0 [2022-11-20 09:36:07,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:07,772 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:07,773 INFO L229 MonitoredProcess]: Starting monitored process 105 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:07,777 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-20 09:36:07,777 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 09:36:07,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2022-11-20 09:36:08,549 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-20 09:36:08,554 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Ended with exit code 0 [2022-11-20 09:36:08,554 INFO L210 LassoAnalysis]: Preferences: [2022-11-20 09:36:08,554 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-20 09:36:08,554 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-20 09:36:08,554 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-20 09:36:08,554 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-20 09:36:08,554 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:08,554 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-20 09:36:08,555 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-20 09:36:08,555 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration14_Loop [2022-11-20 09:36:08,555 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-20 09:36:08,555 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-20 09:36:08,556 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:08,558 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:08,576 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:08,579 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:08,581 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:08,584 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:08,587 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:08,678 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-20 09:36:08,678 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-20 09:36:08,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:08,678 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:08,679 INFO L229 MonitoredProcess]: Starting monitored process 106 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:08,681 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2022-11-20 09:36:08,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 [2022-11-20 09:36:08,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 09:36:08,692 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:36:08,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:36:08,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:36:08,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 09:36:08,693 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 09:36:08,693 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:36:08,694 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:36:08,696 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0 [2022-11-20 09:36:08,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:08,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:08,698 INFO L229 MonitoredProcess]: Starting monitored process 107 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:08,699 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2022-11-20 09:36:08,700 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:36:08,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 09:36:08,711 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:36:08,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:36:08,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:36:08,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 09:36:08,713 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 09:36:08,713 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:36:08,717 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-20 09:36:08,723 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2022-11-20 09:36:08,723 INFO L444 ModelExtractionUtils]: 5 out of 9 variables were initially zero. Simplification set additionally 2 variables to zero. [2022-11-20 09:36:08,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:08,724 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:08,725 INFO L229 MonitoredProcess]: Starting monitored process 108 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:08,727 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2022-11-20 09:36:08,727 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-20 09:36:08,727 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-20 09:36:08,728 INFO L513 LassoAnalysis]: Proved termination. [2022-11-20 09:36:08,728 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -1*ULTIMATE.start_main_~k~0#1 Supporting invariants [] [2022-11-20 09:36:08,730 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Ended with exit code 0 [2022-11-20 09:36:08,731 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-20 09:36:08,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:08,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:08,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 09:36:08,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:08,943 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Forceful destruction successful, exit code 0 [2022-11-20 09:36:08,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:08,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-20 09:36:08,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:09,090 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-20 09:36:09,090 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2022-11-20 09:36:09,090 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 553 states and 965 transitions. cyclomatic complexity: 426 Second operand has 10 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-20 09:36:09,330 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 553 states and 965 transitions. cyclomatic complexity: 426. Second operand has 10 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Result 972 states and 1483 transitions. Complement of second has 35 states. [2022-11-20 09:36:09,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2022-11-20 09:36:09,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-20 09:36:09,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 63 transitions. [2022-11-20 09:36:09,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 63 transitions. Stem has 22 letters. Loop has 20 letters. [2022-11-20 09:36:09,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 09:36:09,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 63 transitions. Stem has 42 letters. Loop has 20 letters. [2022-11-20 09:36:09,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 09:36:09,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 63 transitions. Stem has 22 letters. Loop has 40 letters. [2022-11-20 09:36:09,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 09:36:09,338 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 972 states and 1483 transitions. [2022-11-20 09:36:09,353 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 145 [2022-11-20 09:36:09,366 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 972 states to 902 states and 1405 transitions. [2022-11-20 09:36:09,366 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 307 [2022-11-20 09:36:09,367 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 310 [2022-11-20 09:36:09,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 902 states and 1405 transitions. [2022-11-20 09:36:09,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 09:36:09,367 INFO L218 hiAutomatonCegarLoop]: Abstraction has 902 states and 1405 transitions. [2022-11-20 09:36:09,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states and 1405 transitions. [2022-11-20 09:36:09,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 869. [2022-11-20 09:36:09,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 539 states have (on average 1.12987012987013) internal successors, (609), 538 states have internal predecessors, (609), 252 states have call successors, (260), 102 states have call predecessors, (260), 78 states have return successors, (498), 228 states have call predecessors, (498), 252 states have call successors, (498) [2022-11-20 09:36:09,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1367 transitions. [2022-11-20 09:36:09,404 INFO L240 hiAutomatonCegarLoop]: Abstraction has 869 states and 1367 transitions. [2022-11-20 09:36:09,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:36:09,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:36:09,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:36:09,405 INFO L87 Difference]: Start difference. First operand 869 states and 1367 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-20 09:36:09,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:36:09,444 INFO L93 Difference]: Finished difference Result 792 states and 1266 transitions. [2022-11-20 09:36:09,444 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 792 states and 1266 transitions. [2022-11-20 09:36:09,456 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 145 [2022-11-20 09:36:09,467 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 792 states to 792 states and 1266 transitions. [2022-11-20 09:36:09,467 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 288 [2022-11-20 09:36:09,467 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 288 [2022-11-20 09:36:09,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 792 states and 1266 transitions. [2022-11-20 09:36:09,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 09:36:09,468 INFO L218 hiAutomatonCegarLoop]: Abstraction has 792 states and 1266 transitions. [2022-11-20 09:36:09,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states and 1266 transitions. [2022-11-20 09:36:09,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 791. [2022-11-20 09:36:09,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 791 states, 489 states have (on average 1.1349693251533743) internal successors, (555), 492 states have internal predecessors, (555), 236 states have call successors, (240), 90 states have call predecessors, (240), 66 states have return successors, (470), 208 states have call predecessors, (470), 236 states have call successors, (470) [2022-11-20 09:36:09,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1265 transitions. [2022-11-20 09:36:09,504 INFO L240 hiAutomatonCegarLoop]: Abstraction has 791 states and 1265 transitions. [2022-11-20 09:36:09,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 09:36:09,505 INFO L428 stractBuchiCegarLoop]: Abstraction has 791 states and 1265 transitions. [2022-11-20 09:36:09,505 INFO L335 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2022-11-20 09:36:09,505 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 791 states and 1265 transitions. [2022-11-20 09:36:09,510 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 145 [2022-11-20 09:36:09,510 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 09:36:09,510 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 09:36:09,511 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] [2022-11-20 09:36:09,511 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:36:09,512 INFO L748 eck$LassoCheckResult]: Stem: 16204#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 16174#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; 16175#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 16203#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; 16187#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 16189#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 16429#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; 16157#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 16158#factENTRY ~n := #in~n; 16520#L25 assume ~n <= 0;#res := 1; 16517#factFINAL assume true; 16514#factEXIT >#68#return; 16217#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 16154#factENTRY ~n := #in~n; 16442#L25 assume ~n <= 0;#res := 1; 16441#factFINAL assume true; 16439#factEXIT >#70#return; 16153#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 16154#factENTRY ~n := #in~n; 16442#L25 assume ~n <= 0;#res := 1; 16441#factFINAL assume true; 16439#factEXIT >#72#return; 16440#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; 16449#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 16450#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 16620#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 16619#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; 16437#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 16604#factENTRY ~n := #in~n; 16603#L25 assume !(~n <= 0); 16597#L26 call #t~ret0 := fact(~n - 1);< 16601#factENTRY ~n := #in~n; 16602#L25 assume ~n <= 0;#res := 1; 16638#factFINAL assume true; 16629#factEXIT >#66#return; 16483#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 16627#factFINAL assume true; 16625#factEXIT >#74#return; 16624#L30-6 [2022-11-20 09:36:09,512 INFO L750 eck$LassoCheckResult]: Loop: 16624#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 16220#factENTRY ~n := #in~n; 16653#L25 assume !(~n <= 0); 16482#L26 call #t~ret0 := fact(~n - 1);< 16181#factENTRY ~n := #in~n; 16703#L25 assume ~n <= 0;#res := 1; 16702#factFINAL assume true; 16478#factEXIT >#66#return; 16483#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 16627#factFINAL assume true; 16625#factEXIT >#76#return; 16438#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 16628#factENTRY ~n := #in~n; 16634#L25 assume !(~n <= 0); 16480#L26 call #t~ret0 := fact(~n - 1);< 16484#factENTRY ~n := #in~n; 16704#L25 assume ~n <= 0;#res := 1; 16702#factFINAL assume true; 16478#factEXIT >#66#return; 16483#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 16627#factFINAL assume true; 16625#factEXIT >#78#return; 16383#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; 16448#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 16446#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 16445#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 16443#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; 16143#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 16144#factENTRY ~n := #in~n; 16654#L25 assume !(~n <= 0); 16480#L26 call #t~ret0 := fact(~n - 1);< 16484#factENTRY ~n := #in~n; 16704#L25 assume ~n <= 0;#res := 1; 16702#factFINAL assume true; 16478#factEXIT >#66#return; 16483#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 16627#factFINAL assume true; 16625#factEXIT >#74#return; 16624#L30-6 [2022-11-20 09:36:09,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:09,512 INFO L85 PathProgramCache]: Analyzing trace with hash -426322681, now seen corresponding path program 1 times [2022-11-20 09:36:09,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:09,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373934310] [2022-11-20 09:36:09,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:09,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:09,521 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:36:09,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [492405832] [2022-11-20 09:36:09,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:09,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:36:09,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:09,522 INFO L229 MonitoredProcess]: Starting monitored process 109 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:36:09,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Waiting until timeout for monitored process [2022-11-20 09:36:09,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:36:09,576 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:36:09,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:36:09,610 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:36:09,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:09,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1499491516, now seen corresponding path program 1 times [2022-11-20 09:36:09,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:09,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156712828] [2022-11-20 09:36:09,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:09,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:09,615 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:36:09,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [748567917] [2022-11-20 09:36:09,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:09,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:36:09,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:09,617 INFO L229 MonitoredProcess]: Starting monitored process 110 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:36:09,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (110)] Waiting until timeout for monitored process [2022-11-20 09:36:09,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:36:09,685 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:36:09,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:36:09,706 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:36:09,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:09,707 INFO L85 PathProgramCache]: Analyzing trace with hash 590695746, now seen corresponding path program 1 times [2022-11-20 09:36:09,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:09,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283795695] [2022-11-20 09:36:09,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:09,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:09,716 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:36:09,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [973710547] [2022-11-20 09:36:09,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:09,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:36:09,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:09,723 INFO L229 MonitoredProcess]: Starting monitored process 111 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:36:09,735 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (111)] Waiting until timeout for monitored process [2022-11-20 09:36:09,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:09,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 09:36:09,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:09,845 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 145 proven. 1 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-11-20 09:36:09,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:36:09,966 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 25 proven. 17 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2022-11-20 09:36:09,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:36:09,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283795695] [2022-11-20 09:36:09,966 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 09:36:09,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973710547] [2022-11-20 09:36:09,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973710547] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:36:09,967 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:36:09,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-11-20 09:36:09,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460230349] [2022-11-20 09:36:09,967 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:36:10,399 INFO L210 LassoAnalysis]: Preferences: [2022-11-20 09:36:10,399 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-20 09:36:10,399 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-20 09:36:10,399 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-20 09:36:10,400 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-20 09:36:10,400 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:10,400 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-20 09:36:10,400 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-20 09:36:10,400 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration15_Loop [2022-11-20 09:36:10,400 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-20 09:36:10,400 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-20 09:36:10,401 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:10,403 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:10,405 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:10,408 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:10,410 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:10,412 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:10,547 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-20 09:36:10,547 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-20 09:36:10,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:10,548 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:10,550 INFO L229 MonitoredProcess]: Starting monitored process 112 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:10,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2022-11-20 09:36:10,552 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-20 09:36:10,552 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 09:36:10,563 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-20 09:36:10,564 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: [] [2022-11-20 09:36:10,571 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2022-11-20 09:36:10,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:10,571 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:10,573 INFO L229 MonitoredProcess]: Starting monitored process 113 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:10,577 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2022-11-20 09:36:10,577 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-20 09:36:10,577 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 09:36:10,589 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-20 09:36:10,589 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: [] [2022-11-20 09:36:10,591 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Forceful destruction successful, exit code 0 [2022-11-20 09:36:10,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:10,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:10,593 INFO L229 MonitoredProcess]: Starting monitored process 114 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:10,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2022-11-20 09:36:10,596 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-20 09:36:10,596 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 09:36:10,607 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-20 09:36:10,607 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: [] [2022-11-20 09:36:10,610 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Ended with exit code 0 [2022-11-20 09:36:10,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:10,610 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:10,611 INFO L229 MonitoredProcess]: Starting monitored process 115 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:10,613 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2022-11-20 09:36:10,613 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-20 09:36:10,613 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 09:36:10,625 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-20 09:36:10,625 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: [] [2022-11-20 09:36:10,627 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Ended with exit code 0 [2022-11-20 09:36:10,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:10,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:10,628 INFO L229 MonitoredProcess]: Starting monitored process 116 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:10,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2022-11-20 09:36:10,631 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-20 09:36:10,631 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 09:36:10,652 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-20 09:36:10,652 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: [] [2022-11-20 09:36:10,654 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Forceful destruction successful, exit code 0 [2022-11-20 09:36:10,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:10,655 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:10,656 INFO L229 MonitoredProcess]: Starting monitored process 117 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:10,656 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2022-11-20 09:36:10,658 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-20 09:36:10,658 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 09:36:10,674 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Ended with exit code 0 [2022-11-20 09:36:10,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:10,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:10,676 INFO L229 MonitoredProcess]: Starting monitored process 118 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:10,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2022-11-20 09:36:10,678 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-20 09:36:10,678 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 09:36:11,265 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-20 09:36:11,269 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Ended with exit code 0 [2022-11-20 09:36:11,269 INFO L210 LassoAnalysis]: Preferences: [2022-11-20 09:36:11,269 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-20 09:36:11,269 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-20 09:36:11,269 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-20 09:36:11,269 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-20 09:36:11,269 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:11,269 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-20 09:36:11,269 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-20 09:36:11,270 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration15_Loop [2022-11-20 09:36:11,270 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-20 09:36:11,270 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-20 09:36:11,271 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:11,274 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:11,280 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:11,282 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:11,284 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:11,312 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:11,441 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-20 09:36:11,441 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-20 09:36:11,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:11,442 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:11,443 INFO L229 MonitoredProcess]: Starting monitored process 119 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:11,445 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2022-11-20 09:36:11,445 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:36:11,455 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 09:36:11,455 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:36:11,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:36:11,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:36:11,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 09:36:11,456 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 09:36:11,456 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:36:11,457 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:36:11,461 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Ended with exit code 0 [2022-11-20 09:36:11,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:11,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:11,463 INFO L229 MonitoredProcess]: Starting monitored process 120 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:11,465 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2022-11-20 09:36:11,465 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:36:11,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 09:36:11,475 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:36:11,475 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:36:11,475 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:36:11,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 09:36:11,475 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 09:36:11,475 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:36:11,477 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:36:11,479 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Forceful destruction successful, exit code 0 [2022-11-20 09:36:11,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:11,483 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:11,483 INFO L229 MonitoredProcess]: Starting monitored process 121 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:11,485 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2022-11-20 09:36:11,486 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:36:11,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 09:36:11,496 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:36:11,496 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:36:11,496 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:36:11,496 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 09:36:11,497 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 09:36:11,497 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:36:11,499 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:36:11,501 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Ended with exit code 0 [2022-11-20 09:36:11,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:11,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:11,502 INFO L229 MonitoredProcess]: Starting monitored process 122 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:11,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2022-11-20 09:36:11,505 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:36:11,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 09:36:11,514 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:36:11,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:36:11,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:36:11,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 09:36:11,515 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 09:36:11,515 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:36:11,516 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:36:11,519 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Forceful destruction successful, exit code 0 [2022-11-20 09:36:11,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:11,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:11,520 INFO L229 MonitoredProcess]: Starting monitored process 123 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:11,522 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2022-11-20 09:36:11,523 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:36:11,533 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 09:36:11,533 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:36:11,533 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:36:11,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:36:11,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 09:36:11,536 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 09:36:11,536 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:36:11,541 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-20 09:36:11,546 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-11-20 09:36:11,546 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-11-20 09:36:11,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:11,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:11,549 INFO L229 MonitoredProcess]: Starting monitored process 124 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:11,549 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2022-11-20 09:36:11,550 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-20 09:36:11,550 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-20 09:36:11,550 INFO L513 LassoAnalysis]: Proved termination. [2022-11-20 09:36:11,550 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 1 Supporting invariants [] [2022-11-20 09:36:11,552 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Ended with exit code 0 [2022-11-20 09:36:11,553 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-20 09:36:11,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:11,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:11,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-20 09:36:11,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:11,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:11,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-20 09:36:11,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:12,071 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-20 09:36:12,071 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2022-11-20 09:36:12,072 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 791 states and 1265 transitions. cyclomatic complexity: 494 Second operand has 10 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 7 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2022-11-20 09:36:12,340 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 791 states and 1265 transitions. cyclomatic complexity: 494. Second operand has 10 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 7 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) Result 1424 states and 2124 transitions. Complement of second has 41 states. [2022-11-20 09:36:12,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2022-11-20 09:36:12,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 7 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2022-11-20 09:36:12,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 64 transitions. [2022-11-20 09:36:12,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 64 transitions. Stem has 38 letters. Loop has 38 letters. [2022-11-20 09:36:12,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 09:36:12,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 64 transitions. Stem has 76 letters. Loop has 38 letters. [2022-11-20 09:36:12,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 09:36:12,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 64 transitions. Stem has 38 letters. Loop has 76 letters. [2022-11-20 09:36:12,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 09:36:12,346 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1424 states and 2124 transitions. [2022-11-20 09:36:12,361 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 144 [2022-11-20 09:36:12,376 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1424 states to 1210 states and 1826 transitions. [2022-11-20 09:36:12,376 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 337 [2022-11-20 09:36:12,377 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 338 [2022-11-20 09:36:12,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1210 states and 1826 transitions. [2022-11-20 09:36:12,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 09:36:12,378 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1210 states and 1826 transitions. [2022-11-20 09:36:12,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states and 1826 transitions. [2022-11-20 09:36:12,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 1154. [2022-11-20 09:36:12,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 717 states have (on average 1.1311018131101813) internal successors, (811), 732 states have internal predecessors, (811), 305 states have call successors, (318), 144 states have call predecessors, (318), 132 states have return successors, (592), 277 states have call predecessors, (592), 305 states have call successors, (592) [2022-11-20 09:36:12,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1721 transitions. [2022-11-20 09:36:12,422 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1154 states and 1721 transitions. [2022-11-20 09:36:12,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:36:12,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:36:12,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:36:12,423 INFO L87 Difference]: Start difference. First operand 1154 states and 1721 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) [2022-11-20 09:36:12,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:36:12,573 INFO L93 Difference]: Finished difference Result 1142 states and 1666 transitions. [2022-11-20 09:36:12,573 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1142 states and 1666 transitions. [2022-11-20 09:36:12,584 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 143 [2022-11-20 09:36:12,596 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1142 states to 1058 states and 1546 transitions. [2022-11-20 09:36:12,596 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 312 [2022-11-20 09:36:12,596 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 312 [2022-11-20 09:36:12,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1058 states and 1546 transitions. [2022-11-20 09:36:12,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 09:36:12,597 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1058 states and 1546 transitions. [2022-11-20 09:36:12,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states and 1546 transitions. [2022-11-20 09:36:12,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 1052. [2022-11-20 09:36:12,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 659 states have (on average 1.1062215477996966) internal successors, (729), 668 states have internal predecessors, (729), 275 states have call successors, (288), 126 states have call predecessors, (288), 118 states have return successors, (522), 257 states have call predecessors, (522), 275 states have call successors, (522) [2022-11-20 09:36:12,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1539 transitions. [2022-11-20 09:36:12,634 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1052 states and 1539 transitions. [2022-11-20 09:36:12,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 09:36:12,635 INFO L428 stractBuchiCegarLoop]: Abstraction has 1052 states and 1539 transitions. [2022-11-20 09:36:12,635 INFO L335 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2022-11-20 09:36:12,635 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1052 states and 1539 transitions. [2022-11-20 09:36:12,641 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 143 [2022-11-20 09:36:12,641 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 09:36:12,642 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 09:36:12,642 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 5, 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, 1] [2022-11-20 09:36:12,642 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-20 09:36:12,642 INFO L748 eck$LassoCheckResult]: Stem: 21470#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 21440#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; 21441#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 21469#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; 21489#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 21650#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 21649#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; 21431#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 21432#factENTRY ~n := #in~n; 21654#L25 assume ~n <= 0;#res := 1; 21653#factFINAL assume true; 21652#factEXIT >#68#return; 21481#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 21424#factENTRY ~n := #in~n; 21693#L25 assume ~n <= 0;#res := 1; 21690#factFINAL assume true; 21687#factEXIT >#70#return; 21423#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 21424#factENTRY ~n := #in~n; 21693#L25 assume ~n <= 0;#res := 1; 21690#factFINAL assume true; 21687#factEXIT >#72#return; 21461#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; 21462#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 21467#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 21478#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 21479#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; 21413#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 21414#factENTRY ~n := #in~n; 21929#L25 assume !(~n <= 0); 21446#L26 call #t~ret0 := fact(~n - 1);< 21447#factENTRY ~n := #in~n; 21964#L25 assume ~n <= 0;#res := 1; 21963#factFINAL assume true; 21962#factEXIT >#66#return; 21960#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 21958#factFINAL assume true; 21957#factEXIT >#74#return; 21955#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 21485#factENTRY ~n := #in~n; 21961#L25 assume ~n <= 0;#res := 1; 21959#factFINAL assume true; 21954#factEXIT >#76#return; 21671#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 21949#factENTRY ~n := #in~n; 21945#L25 assume !(~n <= 0); 21912#L26 call #t~ret0 := fact(~n - 1);< 21925#factENTRY [2022-11-20 09:36:12,643 INFO L750 eck$LassoCheckResult]: Loop: 21925#factENTRY ~n := #in~n; 21970#L25 assume !(~n <= 0); 21909#L26 call #t~ret0 := fact(~n - 1);< 21925#factENTRY [2022-11-20 09:36:12,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:12,643 INFO L85 PathProgramCache]: Analyzing trace with hash 172884444, now seen corresponding path program 1 times [2022-11-20 09:36:12,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:12,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484516011] [2022-11-20 09:36:12,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:12,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:12,653 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:36:12,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1885374730] [2022-11-20 09:36:12,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:12,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:36:12,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:12,656 INFO L229 MonitoredProcess]: Starting monitored process 125 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:36:12,663 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Waiting until timeout for monitored process [2022-11-20 09:36:12,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:36:12,719 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:36:12,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:36:12,745 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:36:12,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:12,745 INFO L85 PathProgramCache]: Analyzing trace with hash 29980, now seen corresponding path program 2 times [2022-11-20 09:36:12,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:12,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814099594] [2022-11-20 09:36:12,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:12,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:12,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:36:12,748 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:36:12,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:36:12,749 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:36:12,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:12,750 INFO L85 PathProgramCache]: Analyzing trace with hash 734683489, now seen corresponding path program 2 times [2022-11-20 09:36:12,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:12,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227585666] [2022-11-20 09:36:12,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:12,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:12,756 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:36:12,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1954890770] [2022-11-20 09:36:12,756 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 09:36:12,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:36:12,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:12,762 INFO L229 MonitoredProcess]: Starting monitored process 126 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:36:12,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (126)] Waiting until timeout for monitored process [2022-11-20 09:36:12,818 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 09:36:12,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:36:12,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-20 09:36:12,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:12,984 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Forceful destruction successful, exit code 0 [2022-11-20 09:36:12,987 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-20 09:36:12,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:36:13,106 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-20 09:36:13,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:36:13,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227585666] [2022-11-20 09:36:13,107 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 09:36:13,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954890770] [2022-11-20 09:36:13,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954890770] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:36:13,107 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:36:13,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2022-11-20 09:36:13,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065086262] [2022-11-20 09:36:13,108 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:36:13,135 INFO L210 LassoAnalysis]: Preferences: [2022-11-20 09:36:13,136 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-20 09:36:13,136 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-20 09:36:13,136 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-20 09:36:13,136 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-20 09:36:13,136 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:13,136 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-20 09:36:13,136 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-20 09:36:13,136 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration16_Loop [2022-11-20 09:36:13,136 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-20 09:36:13,136 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-20 09:36:13,137 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:13,139 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:13,145 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:13,147 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:13,174 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-20 09:36:13,174 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-20 09:36:13,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:13,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:13,176 INFO L229 MonitoredProcess]: Starting monitored process 127 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:13,180 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2022-11-20 09:36:13,181 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-20 09:36:13,181 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 09:36:13,203 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-20 09:36:13,204 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_#t~ret0=0} Honda state: {fact_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-11-20 09:36:13,207 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Forceful destruction successful, exit code 0 [2022-11-20 09:36:13,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:13,207 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:13,209 INFO L229 MonitoredProcess]: Starting monitored process 128 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:13,216 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-20 09:36:13,216 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 09:36:13,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2022-11-20 09:36:13,250 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Forceful destruction successful, exit code 0 [2022-11-20 09:36:13,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:13,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:13,252 INFO L229 MonitoredProcess]: Starting monitored process 129 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:13,256 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-20 09:36:13,256 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 09:36:13,268 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2022-11-20 09:36:13,300 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-20 09:36:13,303 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Forceful destruction successful, exit code 0 [2022-11-20 09:36:13,304 INFO L210 LassoAnalysis]: Preferences: [2022-11-20 09:36:13,304 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-20 09:36:13,304 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-20 09:36:13,304 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-20 09:36:13,304 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-20 09:36:13,304 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:13,304 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-20 09:36:13,304 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-20 09:36:13,304 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration16_Loop [2022-11-20 09:36:13,304 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-20 09:36:13,304 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-20 09:36:13,305 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:13,307 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:13,313 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:13,315 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:13,338 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-20 09:36:13,338 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-20 09:36:13,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:13,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:13,340 INFO L229 MonitoredProcess]: Starting monitored process 130 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:13,343 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:36:13,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 09:36:13,356 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:36:13,356 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:36:13,356 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:36:13,356 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 09:36:13,356 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 09:36:13,357 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:36:13,357 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2022-11-20 09:36:13,367 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:36:13,370 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Forceful destruction successful, exit code 0 [2022-11-20 09:36:13,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:13,371 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:13,372 INFO L229 MonitoredProcess]: Starting monitored process 131 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:13,375 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:36:13,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 09:36:13,388 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:36:13,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:36:13,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:36:13,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 09:36:13,389 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 09:36:13,389 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:36:13,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2022-11-20 09:36:13,412 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-20 09:36:13,415 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-11-20 09:36:13,415 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-11-20 09:36:13,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:13,416 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:13,419 INFO L229 MonitoredProcess]: Starting monitored process 132 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:13,422 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-20 09:36:13,422 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-20 09:36:13,422 INFO L513 LassoAnalysis]: Proved termination. [2022-11-20 09:36:13,422 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fact_#in~n) = 1*fact_#in~n Supporting invariants [] [2022-11-20 09:36:13,424 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2022-11-20 09:36:13,426 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Forceful destruction successful, exit code 0 [2022-11-20 09:36:13,426 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-20 09:36:13,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:13,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:13,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-20 09:36:13,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:13,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:13,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 09:36:13,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:13,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:36:13,775 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 [2022-11-20 09:36:13,775 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1052 states and 1539 transitions. cyclomatic complexity: 517 Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-20 09:36:13,875 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1052 states and 1539 transitions. cyclomatic complexity: 517. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Result 1172 states and 1679 transitions. Complement of second has 13 states. [2022-11-20 09:36:13,876 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 [2022-11-20 09:36:13,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-20 09:36:13,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-11-20 09:36:13,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 47 letters. Loop has 3 letters. [2022-11-20 09:36:13,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 09:36:13,877 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-11-20 09:36:13,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:13,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:13,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-20 09:36:13,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:14,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:14,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 09:36:14,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:14,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:36:14,218 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 [2022-11-20 09:36:14,219 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1052 states and 1539 transitions. cyclomatic complexity: 517 Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-20 09:36:14,313 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1052 states and 1539 transitions. cyclomatic complexity: 517. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Result 1172 states and 1679 transitions. Complement of second has 13 states. [2022-11-20 09:36:14,314 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 [2022-11-20 09:36:14,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-20 09:36:14,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-11-20 09:36:14,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 47 letters. Loop has 3 letters. [2022-11-20 09:36:14,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 09:36:14,315 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-11-20 09:36:14,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:14,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:14,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-20 09:36:14,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:14,675 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Forceful destruction successful, exit code 0 [2022-11-20 09:36:14,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:14,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 09:36:14,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:14,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:36:14,732 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 [2022-11-20 09:36:14,732 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1052 states and 1539 transitions. cyclomatic complexity: 517 Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-20 09:36:14,845 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1052 states and 1539 transitions. cyclomatic complexity: 517. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Result 1340 states and 1873 transitions. Complement of second has 16 states. [2022-11-20 09:36:14,846 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 [2022-11-20 09:36:14,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-20 09:36:14,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-11-20 09:36:14,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 47 letters. Loop has 3 letters. [2022-11-20 09:36:14,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 09:36:14,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 50 letters. Loop has 3 letters. [2022-11-20 09:36:14,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 09:36:14,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 47 letters. Loop has 6 letters. [2022-11-20 09:36:14,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 09:36:14,848 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1340 states and 1873 transitions. [2022-11-20 09:36:14,859 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 137 [2022-11-20 09:36:14,871 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1340 states to 1128 states and 1651 transitions. [2022-11-20 09:36:14,871 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 303 [2022-11-20 09:36:14,872 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 312 [2022-11-20 09:36:14,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1128 states and 1651 transitions. [2022-11-20 09:36:14,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 09:36:14,873 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1128 states and 1651 transitions. [2022-11-20 09:36:14,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states and 1651 transitions. [2022-11-20 09:36:14,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 1046. [2022-11-20 09:36:14,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 657 states have (on average 1.1095890410958904) internal successors, (729), 660 states have internal predecessors, (729), 269 states have call successors, (282), 128 states have call predecessors, (282), 120 states have return successors, (510), 257 states have call predecessors, (510), 269 states have call successors, (510) [2022-11-20 09:36:14,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1521 transitions. [2022-11-20 09:36:14,909 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1046 states and 1521 transitions. [2022-11-20 09:36:14,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:36:14,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 09:36:14,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-11-20 09:36:14,910 INFO L87 Difference]: Start difference. First operand 1046 states and 1521 transitions. Second operand has 13 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 7 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-11-20 09:36:15,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:36:15,338 INFO L93 Difference]: Finished difference Result 1506 states and 2221 transitions. [2022-11-20 09:36:15,338 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1506 states and 2221 transitions. [2022-11-20 09:36:15,350 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 233 [2022-11-20 09:36:15,364 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1506 states to 1473 states and 2175 transitions. [2022-11-20 09:36:15,365 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 479 [2022-11-20 09:36:15,365 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 479 [2022-11-20 09:36:15,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1473 states and 2175 transitions. [2022-11-20 09:36:15,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 09:36:15,366 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1473 states and 2175 transitions. [2022-11-20 09:36:15,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states and 2175 transitions. [2022-11-20 09:36:15,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 1055. [2022-11-20 09:36:15,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1055 states, 662 states have (on average 1.1102719033232629) internal successors, (735), 665 states have internal predecessors, (735), 283 states have call successors, (295), 120 states have call predecessors, (295), 110 states have return successors, (531), 269 states have call predecessors, (531), 283 states have call successors, (531) [2022-11-20 09:36:15,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 1561 transitions. [2022-11-20 09:36:15,406 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1055 states and 1561 transitions. [2022-11-20 09:36:15,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 09:36:15,407 INFO L428 stractBuchiCegarLoop]: Abstraction has 1055 states and 1561 transitions. [2022-11-20 09:36:15,407 INFO L335 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2022-11-20 09:36:15,408 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1055 states and 1561 transitions. [2022-11-20 09:36:15,413 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 157 [2022-11-20 09:36:15,413 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 09:36:15,413 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 09:36:15,414 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:36:15,414 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:36:15,414 INFO L748 eck$LassoCheckResult]: Stem: 29616#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 29588#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; 29589#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 29615#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; 29636#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 29815#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 29813#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; 29579#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 29580#factENTRY ~n := #in~n; 29852#L25 assume ~n <= 0;#res := 1; 29851#factFINAL assume true; 29850#factEXIT >#68#return; 29628#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 29570#factENTRY ~n := #in~n; 29814#L25 assume ~n <= 0;#res := 1; 29812#factFINAL assume true; 29809#factEXIT >#70#return; 29569#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 29570#factENTRY ~n := #in~n; 29814#L25 assume ~n <= 0;#res := 1; 29812#factFINAL assume true; 29809#factEXIT >#72#return; 29810#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; 29879#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 30021#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 30016#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 30013#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; 30008#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 30009#factENTRY ~n := #in~n; 30024#L25 assume ~n <= 0;#res := 1; 30025#factFINAL assume true; 30043#factEXIT >#74#return; 29563#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 29583#factENTRY ~n := #in~n; 29584#L25 assume ~n <= 0;#res := 1; 29622#factFINAL assume true; 29562#factEXIT >#76#return; 29564#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 29637#factENTRY ~n := #in~n; 30052#L25 assume !(~n <= 0); 29594#L26 call #t~ret0 := fact(~n - 1);< 29595#factENTRY ~n := #in~n; 30061#L25 assume ~n <= 0;#res := 1; 30060#factFINAL assume true; 30059#factEXIT >#66#return; 30058#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 30057#factFINAL assume true; 30056#factEXIT >#78#return; 29840#L30-8 [2022-11-20 09:36:15,415 INFO L750 eck$LassoCheckResult]: Loop: 29840#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; 30055#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 30054#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 30051#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 29843#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; 29838#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 29842#factENTRY ~n := #in~n; 29886#L25 assume !(~n <= 0); 29873#L26 call #t~ret0 := fact(~n - 1);< 29875#factENTRY ~n := #in~n; 29880#L25 assume !(~n <= 0); 29871#L26 call #t~ret0 := fact(~n - 1);< 29878#factENTRY ~n := #in~n; 29882#L25 assume ~n <= 0;#res := 1; 29884#factFINAL assume true; 29881#factEXIT >#66#return; 29874#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 29877#factFINAL assume true; 29869#factEXIT >#66#return; 29867#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 29865#factFINAL assume true; 29837#factEXIT >#74#return; 29841#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 29860#factENTRY ~n := #in~n; 29864#L25 assume ~n <= 0;#res := 1; 29861#factFINAL assume true; 29859#factEXIT >#76#return; 29839#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 29858#factENTRY ~n := #in~n; 29885#L25 assume !(~n <= 0); 29870#L26 call #t~ret0 := fact(~n - 1);< 29883#factENTRY ~n := #in~n; 29880#L25 assume !(~n <= 0); 29871#L26 call #t~ret0 := fact(~n - 1);< 29878#factENTRY ~n := #in~n; 29882#L25 assume ~n <= 0;#res := 1; 29884#factFINAL assume true; 29881#factEXIT >#66#return; 29874#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 29877#factFINAL assume true; 29869#factEXIT >#66#return; 29867#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 29865#factFINAL assume true; 29837#factEXIT >#78#return; 29840#L30-8 [2022-11-20 09:36:15,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:15,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1440088363, now seen corresponding path program 1 times [2022-11-20 09:36:15,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:15,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388145470] [2022-11-20 09:36:15,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:15,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:15,421 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:36:15,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2116148897] [2022-11-20 09:36:15,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:15,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:36:15,422 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:15,423 INFO L229 MonitoredProcess]: Starting monitored process 133 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:36:15,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (133)] Waiting until timeout for monitored process [2022-11-20 09:36:15,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:15,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 09:36:15,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:15,532 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-20 09:36:15,532 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:36:15,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:36:15,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388145470] [2022-11-20 09:36:15,533 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 09:36:15,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116148897] [2022-11-20 09:36:15,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116148897] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:36:15,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:36:15,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:36:15,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741120580] [2022-11-20 09:36:15,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:36:15,536 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-20 09:36:15,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:15,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1514306572, now seen corresponding path program 2 times [2022-11-20 09:36:15,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:15,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019435155] [2022-11-20 09:36:15,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:15,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:15,540 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:36:15,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1583821134] [2022-11-20 09:36:15,540 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 09:36:15,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:36:15,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:15,544 INFO L229 MonitoredProcess]: Starting monitored process 134 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:36:15,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (134)] Waiting until timeout for monitored process [2022-11-20 09:36:15,600 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 09:36:15,600 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-20 09:36:15,600 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:36:15,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:36:15,623 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:36:16,265 INFO L210 LassoAnalysis]: Preferences: [2022-11-20 09:36:16,265 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-20 09:36:16,266 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-20 09:36:16,266 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-20 09:36:16,266 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-20 09:36:16,266 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:16,266 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-20 09:36:16,266 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-20 09:36:16,266 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration17_Loop [2022-11-20 09:36:16,266 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-20 09:36:16,266 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-20 09:36:16,267 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:16,269 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:16,271 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:16,273 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:16,303 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:16,417 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-20 09:36:16,418 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-20 09:36:16,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:16,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:16,421 INFO L229 MonitoredProcess]: Starting monitored process 135 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:16,423 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-20 09:36:16,423 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 09:36:16,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2022-11-20 09:36:16,439 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-20 09:36:16,440 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: [] [2022-11-20 09:36:16,442 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Ended with exit code 0 [2022-11-20 09:36:16,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:16,442 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:16,443 INFO L229 MonitoredProcess]: Starting monitored process 136 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:16,445 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2022-11-20 09:36:16,446 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-20 09:36:16,446 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 09:36:16,457 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-20 09:36:16,457 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: [] [2022-11-20 09:36:16,461 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Forceful destruction successful, exit code 0 [2022-11-20 09:36:16,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:16,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:16,464 INFO L229 MonitoredProcess]: Starting monitored process 137 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:16,472 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-20 09:36:16,472 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 09:36:16,485 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2022-11-20 09:36:16,490 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-20 09:36:16,490 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: [] [2022-11-20 09:36:16,493 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Ended with exit code 0 [2022-11-20 09:36:16,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:16,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:16,494 INFO L229 MonitoredProcess]: Starting monitored process 138 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:16,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2022-11-20 09:36:16,497 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-20 09:36:16,497 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 09:36:16,514 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Forceful destruction successful, exit code 0 [2022-11-20 09:36:16,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:16,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:16,515 INFO L229 MonitoredProcess]: Starting monitored process 139 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:16,517 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2022-11-20 09:36:16,517 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-20 09:36:16,517 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 09:36:16,567 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-20 09:36:16,571 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Forceful destruction successful, exit code 0 [2022-11-20 09:36:16,571 INFO L210 LassoAnalysis]: Preferences: [2022-11-20 09:36:16,571 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-20 09:36:16,571 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-20 09:36:16,571 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-20 09:36:16,571 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-20 09:36:16,571 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:16,572 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-20 09:36:16,572 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-20 09:36:16,572 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration17_Loop [2022-11-20 09:36:16,572 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-20 09:36:16,572 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-20 09:36:16,573 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:16,575 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:16,578 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:16,581 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:16,583 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:16,759 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-20 09:36:16,759 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-20 09:36:16,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:16,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:16,764 INFO L229 MonitoredProcess]: Starting monitored process 140 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:16,767 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:36:16,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 09:36:16,780 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:36:16,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:36:16,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:36:16,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 09:36:16,781 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 09:36:16,781 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:36:16,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2022-11-20 09:36:16,791 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:36:16,795 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Forceful destruction successful, exit code 0 [2022-11-20 09:36:16,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:16,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:16,798 INFO L229 MonitoredProcess]: Starting monitored process 141 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:16,801 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:36:16,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 09:36:16,813 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:36:16,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:36:16,813 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:36:16,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 09:36:16,814 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 09:36:16,814 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:36:16,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2022-11-20 09:36:16,828 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:36:16,832 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Forceful destruction successful, exit code 0 [2022-11-20 09:36:16,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:16,832 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:16,833 INFO L229 MonitoredProcess]: Starting monitored process 142 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:16,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 [2022-11-20 09:36:16,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 09:36:16,849 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:36:16,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:36:16,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:36:16,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 09:36:16,850 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 09:36:16,850 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:36:16,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Waiting until timeout for monitored process [2022-11-20 09:36:16,859 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:36:16,862 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Forceful destruction successful, exit code 0 [2022-11-20 09:36:16,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:16,862 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:16,863 INFO L229 MonitoredProcess]: Starting monitored process 143 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:16,867 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:36:16,876 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Waiting until timeout for monitored process [2022-11-20 09:36:16,879 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 09:36:16,879 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:36:16,879 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:36:16,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:36:16,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 09:36:16,880 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 09:36:16,880 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:36:16,903 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:36:16,906 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Ended with exit code 0 [2022-11-20 09:36:16,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:16,907 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:16,908 INFO L229 MonitoredProcess]: Starting monitored process 144 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:16,909 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Waiting until timeout for monitored process [2022-11-20 09:36:16,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 [2022-11-20 09:36:16,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 09:36:16,921 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:36:16,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:36:16,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:36:16,921 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 09:36:16,923 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 09:36:16,923 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:36:16,929 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-20 09:36:16,932 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-11-20 09:36:16,932 INFO L444 ModelExtractionUtils]: 8 out of 11 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-11-20 09:36:16,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:16,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:16,935 INFO L229 MonitoredProcess]: Starting monitored process 145 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:16,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Waiting until timeout for monitored process [2022-11-20 09:36:16,936 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-20 09:36:16,936 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-20 09:36:16,936 INFO L513 LassoAnalysis]: Proved termination. [2022-11-20 09:36:16,937 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 [] [2022-11-20 09:36:16,939 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Ended with exit code 0 [2022-11-20 09:36:16,940 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-20 09:36:16,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:17,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:17,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-20 09:36:17,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:17,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:17,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-20 09:36:17,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:17,578 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 09:36:17,579 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 9 loop predicates [2022-11-20 09:36:17,579 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1055 states and 1561 transitions. cyclomatic complexity: 526 Second operand has 12 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 6 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2022-11-20 09:36:17,870 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1055 states and 1561 transitions. cyclomatic complexity: 526. Second operand has 12 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 6 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) Result 1879 states and 2586 transitions. Complement of second has 45 states. [2022-11-20 09:36:17,871 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 [2022-11-20 09:36:17,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 6 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2022-11-20 09:36:17,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 72 transitions. [2022-11-20 09:36:17,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 72 transitions. Stem has 48 letters. Loop has 44 letters. [2022-11-20 09:36:17,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 09:36:17,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 72 transitions. Stem has 92 letters. Loop has 44 letters. [2022-11-20 09:36:17,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 09:36:17,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 72 transitions. Stem has 48 letters. Loop has 88 letters. [2022-11-20 09:36:17,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 09:36:17,874 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1879 states and 2586 transitions. [2022-11-20 09:36:17,888 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 157 [2022-11-20 09:36:17,901 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1879 states to 1535 states and 2156 transitions. [2022-11-20 09:36:17,901 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 378 [2022-11-20 09:36:17,902 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 381 [2022-11-20 09:36:17,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1535 states and 2156 transitions. [2022-11-20 09:36:17,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 09:36:17,902 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1535 states and 2156 transitions. [2022-11-20 09:36:17,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1535 states and 2156 transitions. [2022-11-20 09:36:17,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1535 to 1392. [2022-11-20 09:36:17,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1392 states, 883 states have (on average 1.0951302378255945) internal successors, (967), 883 states have internal predecessors, (967), 333 states have call successors, (353), 171 states have call predecessors, (353), 176 states have return successors, (656), 337 states have call predecessors, (656), 333 states have call successors, (656) [2022-11-20 09:36:17,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 1976 transitions. [2022-11-20 09:36:17,945 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1392 states and 1976 transitions. [2022-11-20 09:36:17,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:36:17,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:36:17,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:36:17,945 INFO L87 Difference]: Start difference. First operand 1392 states and 1976 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-20 09:36:18,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:36:18,096 INFO L93 Difference]: Finished difference Result 1259 states and 1709 transitions. [2022-11-20 09:36:18,096 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1259 states and 1709 transitions. [2022-11-20 09:36:18,105 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 162 [2022-11-20 09:36:18,114 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1259 states to 1053 states and 1473 transitions. [2022-11-20 09:36:18,115 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 357 [2022-11-20 09:36:18,115 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 357 [2022-11-20 09:36:18,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1053 states and 1473 transitions. [2022-11-20 09:36:18,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 09:36:18,116 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1053 states and 1473 transitions. [2022-11-20 09:36:18,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states and 1473 transitions. [2022-11-20 09:36:18,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 1003. [2022-11-20 09:36:18,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 648 states have (on average 1.103395061728395) internal successors, (715), 634 states have internal predecessors, (715), 243 states have call successors, (251), 114 states have call predecessors, (251), 112 states have return successors, (427), 254 states have call predecessors, (427), 243 states have call successors, (427) [2022-11-20 09:36:18,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1393 transitions. [2022-11-20 09:36:18,146 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1003 states and 1393 transitions. [2022-11-20 09:36:18,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 09:36:18,147 INFO L428 stractBuchiCegarLoop]: Abstraction has 1003 states and 1393 transitions. [2022-11-20 09:36:18,147 INFO L335 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2022-11-20 09:36:18,147 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1003 states and 1393 transitions. [2022-11-20 09:36:18,151 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 141 [2022-11-20 09:36:18,152 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 09:36:18,152 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 09:36:18,153 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 6, 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, 1] [2022-11-20 09:36:18,153 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [9, 9, 6, 6, 6, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:36:18,153 INFO L748 eck$LassoCheckResult]: Stem: 35713#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 35680#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; 35681#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 35712#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; 35695#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 35696#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 35923#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; 35671#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 35672#factENTRY ~n := #in~n; 35934#L25 assume ~n <= 0;#res := 1; 35933#factFINAL assume true; 35930#factEXIT >#68#return; 35723#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 35662#factENTRY ~n := #in~n; 35914#L25 assume ~n <= 0;#res := 1; 35913#factFINAL assume true; 35911#factEXIT >#70#return; 35661#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 35662#factENTRY ~n := #in~n; 35914#L25 assume ~n <= 0;#res := 1; 35913#factFINAL assume true; 35911#factEXIT >#72#return; 35912#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; 35997#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 35981#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 35977#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 35972#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; 35964#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 35968#factENTRY ~n := #in~n; 35996#L25 assume !(~n <= 0); 35979#L26 call #t~ret0 := fact(~n - 1);< 35980#factENTRY ~n := #in~n; 35995#L25 assume ~n <= 0;#res := 1; 35994#factFINAL assume true; 35978#factEXIT >#66#return; 35973#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 35969#factFINAL assume true; 35963#factEXIT >#74#return; 35725#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 35726#factENTRY ~n := #in~n; 36013#L25 assume ~n <= 0;#res := 1; 36012#factFINAL assume true; 36011#factEXIT >#76#return; 35687#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 36010#factENTRY ~n := #in~n; 36009#L25 assume !(~n <= 0); 35686#L26 call #t~ret0 := fact(~n - 1);< 35688#factENTRY ~n := #in~n; 36099#L25 assume ~n <= 0;#res := 1; 36097#factFINAL assume true; 36079#factEXIT >#66#return; 36076#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 36074#factFINAL assume true; 36063#factEXIT >#78#return; 36058#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; 35692#L30-9 [2022-11-20 09:36:18,153 INFO L750 eck$LassoCheckResult]: Loop: 35692#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 35693#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 35720#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 35714#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; 35649#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 35650#factENTRY ~n := #in~n; 36006#L25 assume !(~n <= 0); 35655#L26 call #t~ret0 := fact(~n - 1);< 35988#factENTRY ~n := #in~n; 35998#L25 assume !(~n <= 0); 35985#L26 call #t~ret0 := fact(~n - 1);< 35993#factENTRY ~n := #in~n; 35998#L25 assume !(~n <= 0); 35985#L26 call #t~ret0 := fact(~n - 1);< 35993#factENTRY ~n := #in~n; 36001#L25 assume ~n <= 0;#res := 1; 36008#factFINAL assume true; 36007#factEXIT >#66#return; 36004#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 36002#factFINAL assume true; 35999#factEXIT >#66#return; 35987#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 35990#factFINAL assume true; 35982#factEXIT >#66#return; 35974#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 35970#factFINAL assume true; 35965#factEXIT >#74#return; 35967#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 35976#factENTRY ~n := #in~n; 36003#L25 assume ~n <= 0;#res := 1; 35989#factFINAL assume true; 35975#factEXIT >#76#return; 35966#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 35971#factENTRY ~n := #in~n; 36005#L25 assume !(~n <= 0); 35983#L26 call #t~ret0 := fact(~n - 1);< 35992#factENTRY ~n := #in~n; 35998#L25 assume !(~n <= 0); 35985#L26 call #t~ret0 := fact(~n - 1);< 35993#factENTRY ~n := #in~n; 35998#L25 assume !(~n <= 0); 35985#L26 call #t~ret0 := fact(~n - 1);< 35993#factENTRY ~n := #in~n; 36001#L25 assume ~n <= 0;#res := 1; 36008#factFINAL assume true; 36007#factEXIT >#66#return; 36004#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 36002#factFINAL assume true; 35999#factEXIT >#66#return; 35987#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 35990#factFINAL assume true; 35982#factEXIT >#66#return; 35974#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 35970#factFINAL assume true; 35965#factEXIT >#78#return; 35926#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; 35692#L30-9 [2022-11-20 09:36:18,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:18,154 INFO L85 PathProgramCache]: Analyzing trace with hash 970322272, now seen corresponding path program 1 times [2022-11-20 09:36:18,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:18,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637428413] [2022-11-20 09:36:18,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:18,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:18,160 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:36:18,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1798338418] [2022-11-20 09:36:18,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:18,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:36:18,161 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:18,162 INFO L229 MonitoredProcess]: Starting monitored process 146 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:36:18,189 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (146)] Waiting until timeout for monitored process [2022-11-20 09:36:18,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:36:18,234 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:36:18,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:36:18,271 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:36:18,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:18,271 INFO L85 PathProgramCache]: Analyzing trace with hash -856179490, now seen corresponding path program 3 times [2022-11-20 09:36:18,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:18,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093579633] [2022-11-20 09:36:18,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:18,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:18,308 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:36:18,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1737814282] [2022-11-20 09:36:18,309 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 09:36:18,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:36:18,309 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:18,315 INFO L229 MonitoredProcess]: Starting monitored process 147 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:36:18,322 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Forceful destruction successful, exit code 0 [2022-11-20 09:36:18,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (147)] Waiting until timeout for monitored process [2022-11-20 09:36:18,386 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-11-20 09:36:18,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-20 09:36:18,386 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:36:18,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:36:18,423 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:36:18,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:18,423 INFO L85 PathProgramCache]: Analyzing trace with hash -768211651, now seen corresponding path program 2 times [2022-11-20 09:36:18,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:18,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562031118] [2022-11-20 09:36:18,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:18,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:18,432 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:36:18,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [220480117] [2022-11-20 09:36:18,432 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 09:36:18,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:36:18,433 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:18,435 INFO L229 MonitoredProcess]: Starting monitored process 148 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:36:18,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (148)] Waiting until timeout for monitored process [2022-11-20 09:36:18,522 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 09:36:18,522 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:36:18,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-20 09:36:18,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:18,634 INFO L134 CoverageAnalysis]: Checked inductivity of 611 backedges. 372 proven. 13 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2022-11-20 09:36:18,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:36:19,019 INFO L134 CoverageAnalysis]: Checked inductivity of 611 backedges. 102 proven. 80 refuted. 0 times theorem prover too weak. 429 trivial. 0 not checked. [2022-11-20 09:36:19,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:36:19,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562031118] [2022-11-20 09:36:19,020 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 09:36:19,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220480117] [2022-11-20 09:36:19,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220480117] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:36:19,020 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:36:19,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 13 [2022-11-20 09:36:19,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529611941] [2022-11-20 09:36:19,020 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:36:20,583 INFO L210 LassoAnalysis]: Preferences: [2022-11-20 09:36:20,584 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-20 09:36:20,584 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-20 09:36:20,584 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-20 09:36:20,584 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-20 09:36:20,584 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:20,584 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-20 09:36:20,584 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-20 09:36:20,585 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration18_Loop [2022-11-20 09:36:20,585 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-20 09:36:20,585 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-20 09:36:20,586 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:20,588 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:20,752 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:20,754 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:20,756 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:20,759 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:21,095 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-20 09:36:21,096 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-20 09:36:21,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:21,096 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:21,103 INFO L229 MonitoredProcess]: Starting monitored process 149 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:21,105 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-20 09:36:21,105 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 09:36:21,118 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Waiting until timeout for monitored process [2022-11-20 09:36:21,131 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-20 09:36:21,132 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: [] [2022-11-20 09:36:21,135 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Forceful destruction successful, exit code 0 [2022-11-20 09:36:21,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:21,136 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:21,137 INFO L229 MonitoredProcess]: Starting monitored process 150 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:21,140 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Waiting until timeout for monitored process [2022-11-20 09:36:21,140 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-20 09:36:21,140 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 09:36:21,158 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Forceful destruction successful, exit code 0 [2022-11-20 09:36:21,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:21,158 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:21,159 INFO L229 MonitoredProcess]: Starting monitored process 151 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:21,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Waiting until timeout for monitored process [2022-11-20 09:36:21,162 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-20 09:36:21,162 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 09:36:21,185 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-20 09:36:21,187 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Ended with exit code 0 [2022-11-20 09:36:21,188 INFO L210 LassoAnalysis]: Preferences: [2022-11-20 09:36:21,188 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-20 09:36:21,188 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-20 09:36:21,188 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-20 09:36:21,188 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-20 09:36:21,188 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:21,188 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-20 09:36:21,188 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-20 09:36:21,188 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration18_Loop [2022-11-20 09:36:21,188 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-20 09:36:21,188 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-20 09:36:21,189 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:21,191 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:21,193 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:21,195 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:21,197 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:21,335 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:21,714 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-20 09:36:21,715 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-20 09:36:21,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:21,715 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:21,716 INFO L229 MonitoredProcess]: Starting monitored process 152 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:21,722 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Waiting until timeout for monitored process [2022-11-20 09:36:21,722 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:36:21,733 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 09:36:21,733 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:36:21,733 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:36:21,733 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:36:21,733 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 09:36:21,734 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 09:36:21,734 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:36:21,735 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:36:21,737 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Ended with exit code 0 [2022-11-20 09:36:21,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:21,738 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:21,739 INFO L229 MonitoredProcess]: Starting monitored process 153 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:21,741 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Waiting until timeout for monitored process [2022-11-20 09:36:21,742 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:36:21,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 09:36:21,753 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:36:21,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:36:21,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:36:21,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 09:36:21,753 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 09:36:21,753 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:36:21,755 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:36:21,757 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Ended with exit code 0 [2022-11-20 09:36:21,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:21,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:21,759 INFO L229 MonitoredProcess]: Starting monitored process 154 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:21,761 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Waiting until timeout for monitored process [2022-11-20 09:36:21,761 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:36:21,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 09:36:21,772 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:36:21,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:36:21,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:36:21,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 09:36:21,773 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 09:36:21,773 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:36:21,774 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:36:21,776 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Ended with exit code 0 [2022-11-20 09:36:21,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:21,777 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:21,778 INFO L229 MonitoredProcess]: Starting monitored process 155 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:21,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Waiting until timeout for monitored process [2022-11-20 09:36:21,780 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:36:21,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 09:36:21,790 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:36:21,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:36:21,791 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:36:21,791 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 09:36:21,791 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 09:36:21,791 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:36:21,792 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:36:21,795 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Ended with exit code 0 [2022-11-20 09:36:21,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:21,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:21,797 INFO L229 MonitoredProcess]: Starting monitored process 156 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:21,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Waiting until timeout for monitored process [2022-11-20 09:36:21,799 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:36:21,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 09:36:21,810 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:36:21,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:36:21,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:36:21,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 09:36:21,814 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 09:36:21,814 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:36:21,819 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-20 09:36:21,832 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-11-20 09:36:21,832 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-11-20 09:36:21,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:21,832 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:21,835 INFO L229 MonitoredProcess]: Starting monitored process 157 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:21,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Waiting until timeout for monitored process [2022-11-20 09:36:21,836 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-20 09:36:21,836 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-20 09:36:21,836 INFO L513 LassoAnalysis]: Proved termination. [2022-11-20 09:36:21,836 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 5 Supporting invariants [] [2022-11-20 09:36:21,839 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Forceful destruction successful, exit code 0 [2022-11-20 09:36:21,840 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-20 09:36:21,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:21,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:21,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-20 09:36:21,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:22,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:22,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-20 09:36:22,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:22,619 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-11-20 09:36:22,619 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 10 loop predicates [2022-11-20 09:36:22,620 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1003 states and 1393 transitions. cyclomatic complexity: 409 Second operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 6 states have call successors, (12), 2 states have call predecessors, (12), 6 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2022-11-20 09:36:22,975 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1003 states and 1393 transitions. cyclomatic complexity: 409. Second operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 6 states have call successors, (12), 2 states have call predecessors, (12), 6 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) Result 2027 states and 2691 transitions. Complement of second has 51 states. [2022-11-20 09:36:22,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 9 non-accepting loop states 1 accepting loop states [2022-11-20 09:36:22,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 6 states have call successors, (12), 2 states have call predecessors, (12), 6 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2022-11-20 09:36:22,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 78 transitions. [2022-11-20 09:36:22,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 78 transitions. Stem has 55 letters. Loop has 56 letters. [2022-11-20 09:36:22,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 09:36:22,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 78 transitions. Stem has 111 letters. Loop has 56 letters. [2022-11-20 09:36:22,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 09:36:22,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 78 transitions. Stem has 55 letters. Loop has 112 letters. [2022-11-20 09:36:22,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 09:36:22,986 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2027 states and 2691 transitions. [2022-11-20 09:36:23,002 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 141 [2022-11-20 09:36:23,017 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2027 states to 1586 states and 2132 transitions. [2022-11-20 09:36:23,018 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 379 [2022-11-20 09:36:23,018 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 382 [2022-11-20 09:36:23,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1586 states and 2132 transitions. [2022-11-20 09:36:23,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 09:36:23,019 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1586 states and 2132 transitions. [2022-11-20 09:36:23,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states and 2132 transitions. [2022-11-20 09:36:23,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1255. [2022-11-20 09:36:23,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 816 states have (on average 1.0943627450980393) internal successors, (893), 800 states have internal predecessors, (893), 276 states have call successors, (292), 149 states have call predecessors, (292), 163 states have return successors, (539), 305 states have call predecessors, (539), 276 states have call successors, (539) [2022-11-20 09:36:23,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1724 transitions. [2022-11-20 09:36:23,062 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1255 states and 1724 transitions. [2022-11-20 09:36:23,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:36:23,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 09:36:23,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-11-20 09:36:23,063 INFO L87 Difference]: Start difference. First operand 1255 states and 1724 transitions. Second operand has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 13 states have internal predecessors, (43), 9 states have call successors, (17), 2 states have call predecessors, (17), 5 states have return successors, (18), 7 states have call predecessors, (18), 9 states have call successors, (18) [2022-11-20 09:36:23,513 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Forceful destruction successful, exit code 0 [2022-11-20 09:36:23,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:36:23,602 INFO L93 Difference]: Finished difference Result 1910 states and 2952 transitions. [2022-11-20 09:36:23,602 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1910 states and 2952 transitions. [2022-11-20 09:36:23,619 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 275 [2022-11-20 09:36:23,642 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1910 states to 1895 states and 2933 transitions. [2022-11-20 09:36:23,642 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 578 [2022-11-20 09:36:23,643 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 578 [2022-11-20 09:36:23,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1895 states and 2933 transitions. [2022-11-20 09:36:23,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 09:36:23,643 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1895 states and 2933 transitions. [2022-11-20 09:36:23,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1895 states and 2933 transitions. [2022-11-20 09:36:23,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1895 to 1462. [2022-11-20 09:36:23,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1462 states, 956 states have (on average 1.094142259414226) internal successors, (1046), 940 states have internal predecessors, (1046), 335 states have call successors, (351), 149 states have call predecessors, (351), 171 states have return successors, (777), 372 states have call predecessors, (777), 335 states have call successors, (777) [2022-11-20 09:36:23,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 1462 states and 2174 transitions. [2022-11-20 09:36:23,709 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1462 states and 2174 transitions. [2022-11-20 09:36:23,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 09:36:23,710 INFO L428 stractBuchiCegarLoop]: Abstraction has 1462 states and 2174 transitions. [2022-11-20 09:36:23,710 INFO L335 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2022-11-20 09:36:23,710 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1462 states and 2174 transitions. [2022-11-20 09:36:23,716 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 192 [2022-11-20 09:36:23,716 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 09:36:23,717 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 09:36:23,718 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [13, 13, 9, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:36:23,718 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [11, 11, 8, 8, 8, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:36:23,718 INFO L748 eck$LassoCheckResult]: Stem: 43013#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 42981#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; 42982#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 43012#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; 42996#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 42997#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 43243#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; 42965#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 42966#factENTRY ~n := #in~n; 43239#L25 assume ~n <= 0;#res := 1; 43238#factFINAL assume true; 43237#factEXIT >#68#return; 43024#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 42962#factENTRY ~n := #in~n; 43266#L25 assume ~n <= 0;#res := 1; 43265#factFINAL assume true; 43264#factEXIT >#70#return; 42961#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 42962#factENTRY ~n := #in~n; 43266#L25 assume ~n <= 0;#res := 1; 43265#factFINAL assume true; 43264#factEXIT >#72#return; 43263#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; 43261#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 43262#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 43291#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 43241#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; 43242#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 43284#factENTRY ~n := #in~n; 43297#L25 assume !(~n <= 0); 43293#L26 call #t~ret0 := fact(~n - 1);< 43294#factENTRY ~n := #in~n; 43298#L25 assume ~n <= 0;#res := 1; 43296#factFINAL assume true; 43292#factEXIT >#66#return; 43289#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43285#factFINAL assume true; 43280#factEXIT >#74#return; 43281#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 43288#factENTRY ~n := #in~n; 43640#L25 assume ~n <= 0;#res := 1; 43639#factFINAL assume true; 43638#factEXIT >#76#return; 43616#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 43617#factENTRY ~n := #in~n; 43658#L25 assume !(~n <= 0); 43655#L26 call #t~ret0 := fact(~n - 1);< 43656#factENTRY ~n := #in~n; 43659#L25 assume ~n <= 0;#res := 1; 43657#factFINAL assume true; 43654#factEXIT >#66#return; 43653#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43652#factFINAL assume true; 43650#factEXIT >#78#return; 43651#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; 43670#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 43669#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 43667#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 43664#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; 43399#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 43400#factENTRY ~n := #in~n; 43410#L25 assume !(~n <= 0); 43405#L26 call #t~ret0 := fact(~n - 1);< 43407#factENTRY ~n := #in~n; 43412#L25 assume ~n <= 0;#res := 1; 43408#factFINAL assume true; 43403#factEXIT >#66#return; 43402#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43401#factFINAL assume true; 43397#factEXIT >#74#return; 42976#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 43392#factENTRY ~n := #in~n; 43395#L25 assume ~n <= 0;#res := 1; 43394#factFINAL assume true; 43390#factEXIT >#76#return; 42970#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 43268#factENTRY ~n := #in~n; 43325#L25 assume !(~n <= 0); 42954#L26 call #t~ret0 := fact(~n - 1);< 43309#factENTRY ~n := #in~n; 43020#L25 assume ~n <= 0;#res := 1; 43021#factFINAL assume true; 42953#factEXIT >#66#return; 42956#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42969#factFINAL assume true; 42971#factEXIT >#78#return; 43267#L30-8 [2022-11-20 09:36:23,718 INFO L750 eck$LassoCheckResult]: Loop: 43267#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; 43260#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 43255#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 43244#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 43245#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; 42949#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 42950#factENTRY ~n := #in~n; 43328#L25 assume !(~n <= 0); 42955#L26 call #t~ret0 := fact(~n - 1);< 43309#factENTRY ~n := #in~n; 43316#L25 assume !(~n <= 0); 43306#L26 call #t~ret0 := fact(~n - 1);< 43314#factENTRY ~n := #in~n; 43316#L25 assume !(~n <= 0); 43306#L26 call #t~ret0 := fact(~n - 1);< 43314#factENTRY ~n := #in~n; 43316#L25 assume !(~n <= 0); 43306#L26 call #t~ret0 := fact(~n - 1);< 43314#factENTRY ~n := #in~n; 43319#L25 assume ~n <= 0;#res := 1; 43331#factFINAL assume true; 43330#factEXIT >#66#return; 43329#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43324#factFINAL assume true; 43323#factEXIT >#66#return; 43321#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43320#factFINAL assume true; 43317#factEXIT >#66#return; 43308#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43311#factFINAL assume true; 43303#factEXIT >#66#return; 43301#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43299#factFINAL assume true; 43282#factEXIT >#74#return; 43026#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 43027#factENTRY ~n := #in~n; 43315#L25 assume ~n <= 0;#res := 1; 43310#factFINAL assume true; 43302#factEXIT >#76#return; 43283#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 43300#factENTRY ~n := #in~n; 43322#L25 assume !(~n <= 0); 43304#L26 call #t~ret0 := fact(~n - 1);< 43313#factENTRY ~n := #in~n; 43316#L25 assume !(~n <= 0); 43306#L26 call #t~ret0 := fact(~n - 1);< 43314#factENTRY ~n := #in~n; 43316#L25 assume !(~n <= 0); 43306#L26 call #t~ret0 := fact(~n - 1);< 43314#factENTRY ~n := #in~n; 43316#L25 assume !(~n <= 0); 43306#L26 call #t~ret0 := fact(~n - 1);< 43314#factENTRY ~n := #in~n; 43319#L25 assume ~n <= 0;#res := 1; 43331#factFINAL assume true; 43330#factEXIT >#66#return; 43329#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43324#factFINAL assume true; 43323#factEXIT >#66#return; 43321#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43320#factFINAL assume true; 43317#factEXIT >#66#return; 43308#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43311#factFINAL assume true; 43303#factEXIT >#66#return; 43301#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43299#factFINAL assume true; 43282#factEXIT >#78#return; 43267#L30-8 [2022-11-20 09:36:23,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:23,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1573688374, now seen corresponding path program 3 times [2022-11-20 09:36:23,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:23,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046879425] [2022-11-20 09:36:23,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:23,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:23,726 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:36:23,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1864967879] [2022-11-20 09:36:23,726 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 09:36:23,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:36:23,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:23,728 INFO L229 MonitoredProcess]: Starting monitored process 158 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:36:23,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (158)] Waiting until timeout for monitored process [2022-11-20 09:36:23,821 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-20 09:36:23,822 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:36:23,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-20 09:36:23,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:23,904 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 77 proven. 5 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2022-11-20 09:36:23,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:36:24,104 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 77 proven. 6 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2022-11-20 09:36:24,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:36:24,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046879425] [2022-11-20 09:36:24,105 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 09:36:24,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864967879] [2022-11-20 09:36:24,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864967879] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:36:24,105 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:36:24,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 9 [2022-11-20 09:36:24,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667774325] [2022-11-20 09:36:24,106 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:36:24,107 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-20 09:36:24,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:24,107 INFO L85 PathProgramCache]: Analyzing trace with hash 857296756, now seen corresponding path program 4 times [2022-11-20 09:36:24,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:24,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679485922] [2022-11-20 09:36:24,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:24,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:24,113 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:36:24,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1966792092] [2022-11-20 09:36:24,114 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 09:36:24,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:36:24,114 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:24,116 INFO L229 MonitoredProcess]: Starting monitored process 159 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:36:24,137 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (159)] Waiting until timeout for monitored process [2022-11-20 09:36:24,190 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 09:36:24,190 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-20 09:36:24,190 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:36:24,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:36:24,220 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:36:25,386 INFO L210 LassoAnalysis]: Preferences: [2022-11-20 09:36:25,386 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-20 09:36:25,386 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-20 09:36:25,386 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-20 09:36:25,386 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-20 09:36:25,386 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:25,387 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-20 09:36:25,387 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-20 09:36:25,387 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration19_Loop [2022-11-20 09:36:25,387 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-20 09:36:25,387 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-20 09:36:25,388 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:25,390 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:25,392 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:25,394 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:25,424 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:25,588 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-20 09:36:25,588 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-20 09:36:25,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:25,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:25,591 INFO L229 MonitoredProcess]: Starting monitored process 160 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:25,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Waiting until timeout for monitored process [2022-11-20 09:36:25,592 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-20 09:36:25,592 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 09:36:25,604 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-20 09:36:25,604 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: [] [2022-11-20 09:36:25,606 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Forceful destruction successful, exit code 0 [2022-11-20 09:36:25,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:25,607 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:25,608 INFO L229 MonitoredProcess]: Starting monitored process 161 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:25,610 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Waiting until timeout for monitored process [2022-11-20 09:36:25,610 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-20 09:36:25,610 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 09:36:25,622 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-20 09:36:25,622 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: [] [2022-11-20 09:36:25,625 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Ended with exit code 0 [2022-11-20 09:36:25,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:25,625 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:25,626 INFO L229 MonitoredProcess]: Starting monitored process 162 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:25,628 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Waiting until timeout for monitored process [2022-11-20 09:36:25,629 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-20 09:36:25,629 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 09:36:25,640 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-20 09:36:25,641 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: [] [2022-11-20 09:36:25,643 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Ended with exit code 0 [2022-11-20 09:36:25,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:25,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:25,644 INFO L229 MonitoredProcess]: Starting monitored process 163 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:25,646 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Waiting until timeout for monitored process [2022-11-20 09:36:25,647 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-20 09:36:25,647 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 09:36:25,664 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Ended with exit code 0 [2022-11-20 09:36:25,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:25,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:25,666 INFO L229 MonitoredProcess]: Starting monitored process 164 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:25,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Waiting until timeout for monitored process [2022-11-20 09:36:25,668 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-20 09:36:25,668 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 09:36:25,693 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-20 09:36:25,696 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Ended with exit code 0 [2022-11-20 09:36:25,696 INFO L210 LassoAnalysis]: Preferences: [2022-11-20 09:36:25,696 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-20 09:36:25,696 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-20 09:36:25,696 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-20 09:36:25,696 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-20 09:36:25,696 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:25,696 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-20 09:36:25,696 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-20 09:36:25,697 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration19_Loop [2022-11-20 09:36:25,697 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-20 09:36:25,697 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-20 09:36:25,698 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:25,744 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:25,747 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:25,749 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:25,756 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:25,918 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-20 09:36:25,918 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-20 09:36:25,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:25,919 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:25,920 INFO L229 MonitoredProcess]: Starting monitored process 165 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:25,922 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Waiting until timeout for monitored process [2022-11-20 09:36:25,923 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:36:25,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 09:36:25,933 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:36:25,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:36:25,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:36:25,934 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 09:36:25,937 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 09:36:25,937 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:36:25,950 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-20 09:36:25,955 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-11-20 09:36:25,955 INFO L444 ModelExtractionUtils]: 7 out of 11 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-11-20 09:36:25,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:25,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:25,958 INFO L229 MonitoredProcess]: Starting monitored process 166 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:25,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Waiting until timeout for monitored process [2022-11-20 09:36:25,960 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-20 09:36:25,960 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-20 09:36:25,960 INFO L513 LassoAnalysis]: Proved termination. [2022-11-20 09:36:25,960 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 [] [2022-11-20 09:36:25,963 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Forceful destruction successful, exit code 0 [2022-11-20 09:36:25,963 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-20 09:36:25,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:26,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:26,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-20 09:36:26,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:26,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:26,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-20 09:36:26,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:27,000 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2022-11-20 09:36:27,001 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 [2022-11-20 09:36:27,001 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1462 states and 2174 transitions. cyclomatic complexity: 737 Second operand has 14 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 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) [2022-11-20 09:36:27,406 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1462 states and 2174 transitions. cyclomatic complexity: 737. Second operand has 14 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 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 3074 states and 4195 transitions. Complement of second has 57 states. [2022-11-20 09:36:27,407 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 [2022-11-20 09:36:27,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 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) [2022-11-20 09:36:27,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 83 transitions. [2022-11-20 09:36:27,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 83 transitions. Stem has 86 letters. Loop has 68 letters. [2022-11-20 09:36:27,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 09:36:27,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 83 transitions. Stem has 154 letters. Loop has 68 letters. [2022-11-20 09:36:27,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 09:36:27,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 83 transitions. Stem has 86 letters. Loop has 136 letters. [2022-11-20 09:36:27,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 09:36:27,414 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3074 states and 4195 transitions. [2022-11-20 09:36:27,436 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 192 [2022-11-20 09:36:27,457 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3074 states to 2196 states and 3093 transitions. [2022-11-20 09:36:27,457 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 481 [2022-11-20 09:36:27,458 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 484 [2022-11-20 09:36:27,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2196 states and 3093 transitions. [2022-11-20 09:36:27,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 09:36:27,459 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2196 states and 3093 transitions. [2022-11-20 09:36:27,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2196 states and 3093 transitions. [2022-11-20 09:36:27,504 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Forceful destruction successful, exit code 0 [2022-11-20 09:36:27,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2196 to 1674. [2022-11-20 09:36:27,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1674 states, 1097 states have (on average 1.0875113947128532) internal successors, (1193), 1082 states have internal predecessors, (1193), 359 states have call successors, (384), 176 states have call predecessors, (384), 218 states have return successors, (891), 415 states have call predecessors, (891), 359 states have call successors, (891) [2022-11-20 09:36:27,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 2468 transitions. [2022-11-20 09:36:27,593 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1674 states and 2468 transitions. [2022-11-20 09:36:27,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:36:27,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 09:36:27,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-11-20 09:36:27,596 INFO L87 Difference]: Start difference. First operand 1674 states and 2468 transitions. Second operand has 10 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 5 states have call successors, (12), 1 states have call predecessors, (12), 3 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-11-20 09:36:27,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:36:27,812 INFO L93 Difference]: Finished difference Result 1760 states and 2531 transitions. [2022-11-20 09:36:27,812 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1760 states and 2531 transitions. [2022-11-20 09:36:27,824 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 206 [2022-11-20 09:36:27,840 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1760 states to 1706 states and 2477 transitions. [2022-11-20 09:36:27,841 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 455 [2022-11-20 09:36:27,841 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 455 [2022-11-20 09:36:27,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1706 states and 2477 transitions. [2022-11-20 09:36:27,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 09:36:27,842 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1706 states and 2477 transitions. [2022-11-20 09:36:27,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states and 2477 transitions. [2022-11-20 09:36:27,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1584. [2022-11-20 09:36:27,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1584 states, 1041 states have (on average 1.07492795389049) internal successors, (1119), 1024 states have internal predecessors, (1119), 341 states have call successors, (366), 160 states have call predecessors, (366), 202 states have return successors, (823), 399 states have call predecessors, (823), 341 states have call successors, (823) [2022-11-20 09:36:27,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 2308 transitions. [2022-11-20 09:36:27,898 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1584 states and 2308 transitions. [2022-11-20 09:36:27,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 09:36:27,899 INFO L428 stractBuchiCegarLoop]: Abstraction has 1584 states and 2308 transitions. [2022-11-20 09:36:27,899 INFO L335 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2022-11-20 09:36:27,899 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1584 states and 2308 transitions. [2022-11-20 09:36:27,905 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 188 [2022-11-20 09:36:27,906 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 09:36:27,906 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 09:36:27,909 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [14, 14, 9, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:36:27,909 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 10, 7, 7, 7, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:36:27,910 INFO L748 eck$LassoCheckResult]: Stem: 52064#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 52034#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; 52035#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 52063#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; 52047#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 52048#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 52416#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; 52018#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 52019#factENTRY ~n := #in~n; 52279#L25 assume ~n <= 0;#res := 1; 52278#factFINAL assume true; 52276#factEXIT >#68#return; 52080#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 52015#factENTRY ~n := #in~n; 52427#L25 assume ~n <= 0;#res := 1; 52425#factFINAL assume true; 52419#factEXIT >#70#return; 52014#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 52015#factENTRY ~n := #in~n; 52427#L25 assume ~n <= 0;#res := 1; 52425#factFINAL assume true; 52419#factEXIT >#72#return; 52420#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; 52428#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 52426#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 52424#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 52065#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; 52004#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 52005#factENTRY ~n := #in~n; 52340#L25 assume !(~n <= 0); 52338#L26 call #t~ret0 := fact(~n - 1);< 52339#factENTRY ~n := #in~n; 52342#L25 assume ~n <= 0;#res := 1; 52341#factFINAL assume true; 52337#factEXIT >#66#return; 52335#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 52323#factFINAL assume true; 52319#factEXIT >#74#return; 52082#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 52083#factENTRY ~n := #in~n; 52498#L25 assume ~n <= 0;#res := 1; 52497#factFINAL assume true; 52492#factEXIT >#76#return; 52481#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 52482#factENTRY ~n := #in~n; 52544#L25 assume !(~n <= 0); 52541#L26 call #t~ret0 := fact(~n - 1);< 52542#factENTRY ~n := #in~n; 52545#L25 assume ~n <= 0;#res := 1; 52543#factFINAL assume true; 52540#factEXIT >#66#return; 52539#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 52538#factFINAL assume true; 52480#factEXIT >#78#return; 52477#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; 52476#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 52475#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 52473#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 52474#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; 52450#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 52451#factENTRY ~n := #in~n; 52459#L25 assume !(~n <= 0); 52455#L26 call #t~ret0 := fact(~n - 1);< 52457#factENTRY ~n := #in~n; 52461#L25 assume ~n <= 0;#res := 1; 52458#factFINAL assume true; 52454#factEXIT >#66#return; 52453#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 52452#factFINAL assume true; 52448#factEXIT >#74#return; 52029#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 52446#factENTRY ~n := #in~n; 52471#L25 assume ~n <= 0;#res := 1; 52470#factFINAL assume true; 52469#factEXIT >#76#return; 52356#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 52363#factENTRY ~n := #in~n; 52381#L25 assume !(~n <= 0); 52347#L26 call #t~ret0 := fact(~n - 1);< 52353#factENTRY ~n := #in~n; 52380#L25 assume !(~n <= 0); 52350#L26 call #t~ret0 := fact(~n - 1);< 52357#factENTRY ~n := #in~n; 52379#L25 assume ~n <= 0;#res := 1; 52378#factFINAL assume true; 52376#factEXIT >#66#return; 52377#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 52370#factFINAL assume true; 52371#factEXIT >#66#return; 52351#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 52364#factFINAL assume true; 52362#factEXIT >#78#return; 52331#L30-8 [2022-11-20 09:36:27,910 INFO L750 eck$LassoCheckResult]: Loop: 52331#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; 52358#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 52354#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 52345#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 52343#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; 52327#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 52332#factENTRY ~n := #in~n; 52404#L25 assume !(~n <= 0); 52349#L26 call #t~ret0 := fact(~n - 1);< 52353#factENTRY ~n := #in~n; 52380#L25 assume !(~n <= 0); 52350#L26 call #t~ret0 := fact(~n - 1);< 52357#factENTRY ~n := #in~n; 52380#L25 assume !(~n <= 0); 52350#L26 call #t~ret0 := fact(~n - 1);< 52357#factENTRY ~n := #in~n; 52380#L25 assume !(~n <= 0); 52350#L26 call #t~ret0 := fact(~n - 1);< 52357#factENTRY ~n := #in~n; 52380#L25 assume !(~n <= 0); 52350#L26 call #t~ret0 := fact(~n - 1);< 52357#factENTRY ~n := #in~n; 52379#L25 assume ~n <= 0;#res := 1; 52378#factFINAL assume true; 52376#factEXIT >#66#return; 52377#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 52370#factFINAL assume true; 52371#factEXIT >#66#return; 52374#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 52375#factFINAL assume true; 52367#factEXIT >#66#return; 52368#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 52387#factFINAL assume true; 52359#factEXIT >#66#return; 52352#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 52355#factFINAL assume true; 52346#factEXIT >#66#return; 52344#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 52333#factFINAL assume true; 52330#factEXIT >#74#return; 52328#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 52329#factENTRY ~n := #in~n; 52336#L25 assume ~n <= 0;#res := 1; 52334#factFINAL assume true; 52326#factEXIT >#76#return; 52324#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 52325#factENTRY ~n := #in~n; 52372#L25 assume !(~n <= 0); 52348#L26 call #t~ret0 := fact(~n - 1);< 52353#factENTRY ~n := #in~n; 52380#L25 assume !(~n <= 0); 52350#L26 call #t~ret0 := fact(~n - 1);< 52357#factENTRY ~n := #in~n; 52379#L25 assume ~n <= 0;#res := 1; 52378#factFINAL assume true; 52376#factEXIT >#66#return; 52377#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 52370#factFINAL assume true; 52371#factEXIT >#66#return; 52360#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 52385#factFINAL assume true; 52361#factEXIT >#78#return; 52331#L30-8 [2022-11-20 09:36:27,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:27,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1286157522, now seen corresponding path program 4 times [2022-11-20 09:36:27,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:27,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819834258] [2022-11-20 09:36:27,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:27,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:27,917 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:36:27,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [749842373] [2022-11-20 09:36:27,918 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 09:36:27,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:36:27,918 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:27,920 INFO L229 MonitoredProcess]: Starting monitored process 167 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:36:27,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (167)] Waiting until timeout for monitored process [2022-11-20 09:36:28,009 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 09:36:28,009 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:36:28,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-20 09:36:28,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:28,101 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 233 proven. 3 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2022-11-20 09:36:28,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:36:28,342 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 61 proven. 32 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2022-11-20 09:36:28,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:36:28,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819834258] [2022-11-20 09:36:28,342 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 09:36:28,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749842373] [2022-11-20 09:36:28,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749842373] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:36:28,342 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:36:28,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 11 [2022-11-20 09:36:28,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772640560] [2022-11-20 09:36:28,343 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:36:28,343 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-20 09:36:28,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:28,343 INFO L85 PathProgramCache]: Analyzing trace with hash 335461116, now seen corresponding path program 5 times [2022-11-20 09:36:28,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:28,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416964689] [2022-11-20 09:36:28,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:28,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:28,347 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:36:28,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1243443584] [2022-11-20 09:36:28,348 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-20 09:36:28,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:36:28,348 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:28,352 INFO L229 MonitoredProcess]: Starting monitored process 168 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:36:28,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (168)] Waiting until timeout for monitored process [2022-11-20 09:36:28,424 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2022-11-20 09:36:28,424 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:36:28,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-20 09:36:28,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:28,586 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 52 proven. 100 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-11-20 09:36:28,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:36:29,790 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 50 proven. 121 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-11-20 09:36:29,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:36:29,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416964689] [2022-11-20 09:36:29,791 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 09:36:29,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243443584] [2022-11-20 09:36:29,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243443584] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:36:29,791 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:36:29,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18] total 23 [2022-11-20 09:36:29,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218188115] [2022-11-20 09:36:29,791 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:36:29,791 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 09:36:29,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:36:29,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-20 09:36:29,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2022-11-20 09:36:29,792 INFO L87 Difference]: Start difference. First operand 1584 states and 2308 transitions. cyclomatic complexity: 754 Second operand has 24 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 14 states have call successors, (14), 1 states have call predecessors, (14), 9 states have return successors, (19), 12 states have call predecessors, (19), 14 states have call successors, (19) [2022-11-20 09:36:30,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:36:30,998 INFO L93 Difference]: Finished difference Result 3206 states and 5042 transitions. [2022-11-20 09:36:30,998 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3206 states and 5042 transitions. [2022-11-20 09:36:31,019 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 577 [2022-11-20 09:36:31,051 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3206 states to 3113 states and 4923 transitions. [2022-11-20 09:36:31,052 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 927 [2022-11-20 09:36:31,053 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 927 [2022-11-20 09:36:31,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3113 states and 4923 transitions. [2022-11-20 09:36:31,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 09:36:31,054 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3113 states and 4923 transitions. [2022-11-20 09:36:31,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3113 states and 4923 transitions. [2022-11-20 09:36:31,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3113 to 1905. [2022-11-20 09:36:31,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1905 states, 1187 states have (on average 1.0657118786857624) internal successors, (1265), 1169 states have internal predecessors, (1265), 503 states have call successors, (528), 222 states have call predecessors, (528), 215 states have return successors, (1279), 513 states have call predecessors, (1279), 503 states have call successors, (1279) [2022-11-20 09:36:31,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1905 states to 1905 states and 3072 transitions. [2022-11-20 09:36:31,137 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1905 states and 3072 transitions. [2022-11-20 09:36:31,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-20 09:36:31,138 INFO L428 stractBuchiCegarLoop]: Abstraction has 1905 states and 3072 transitions. [2022-11-20 09:36:31,138 INFO L335 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2022-11-20 09:36:31,138 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1905 states and 3072 transitions. [2022-11-20 09:36:31,148 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 227 [2022-11-20 09:36:31,148 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 09:36:31,148 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 09:36:31,150 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [14, 14, 9, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:36:31,151 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [13, 13, 10, 10, 10, 10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:36:31,151 INFO L748 eck$LassoCheckResult]: Stem: 57831#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 57804#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; 57805#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 57830#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; 57851#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 58177#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 58174#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; 57787#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 57788#factENTRY ~n := #in~n; 58495#L25 assume ~n <= 0;#res := 1; 58503#factFINAL assume true; 58501#factEXIT >#68#return; 57844#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 57845#factENTRY ~n := #in~n; 58185#L25 assume ~n <= 0;#res := 1; 58184#factFINAL assume true; 58182#factEXIT >#70#return; 58183#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 57845#factENTRY ~n := #in~n; 58185#L25 assume ~n <= 0;#res := 1; 58184#factFINAL assume true; 58182#factEXIT >#72#return; 58178#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; 58175#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 58170#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 58167#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 58153#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; 57773#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 57774#factENTRY ~n := #in~n; 58180#L25 assume !(~n <= 0); 58172#L26 call #t~ret0 := fact(~n - 1);< 58173#factENTRY ~n := #in~n; 58179#L25 assume ~n <= 0;#res := 1; 58176#factFINAL assume true; 58171#factEXIT >#66#return; 58168#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 58147#factFINAL assume true; 58128#factEXIT >#74#return; 57847#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 57848#factENTRY ~n := #in~n; 58578#L25 assume ~n <= 0;#res := 1; 58577#factFINAL assume true; 58571#factEXIT >#76#return; 58572#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 58610#factENTRY ~n := #in~n; 58617#L25 assume !(~n <= 0); 58614#L26 call #t~ret0 := fact(~n - 1);< 58615#factENTRY ~n := #in~n; 58618#L25 assume ~n <= 0;#res := 1; 58616#factFINAL assume true; 58613#factEXIT >#66#return; 58612#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 58611#factFINAL assume true; 58609#factEXIT >#78#return; 58608#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; 58607#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 58605#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 58592#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 58590#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; 58376#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 58378#factENTRY ~n := #in~n; 58385#L25 assume !(~n <= 0); 58382#L26 call #t~ret0 := fact(~n - 1);< 58384#factENTRY ~n := #in~n; 58388#L25 assume ~n <= 0;#res := 1; 58387#factFINAL assume true; 58381#factEXIT >#66#return; 58380#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 58379#factFINAL assume true; 58375#factEXIT >#74#return; 57798#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 58263#factENTRY ~n := #in~n; 58258#L25 assume ~n <= 0;#res := 1; 58255#factFINAL assume true; 58200#factEXIT >#76#return; 58196#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 58199#factENTRY ~n := #in~n; 58195#L25 assume !(~n <= 0); 58159#L26 call #t~ret0 := fact(~n - 1);< 58165#factENTRY ~n := #in~n; 58229#L25 assume !(~n <= 0); 58156#L26 call #t~ret0 := fact(~n - 1);< 58227#factENTRY ~n := #in~n; 58235#L25 assume ~n <= 0;#res := 1; 58228#factFINAL assume true; 58226#factEXIT >#66#return; 58225#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 58224#factFINAL assume true; 58220#factEXIT >#66#return; 58221#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 58555#factFINAL assume true; 58553#factEXIT >#78#return; 58144#L30-8 [2022-11-20 09:36:31,151 INFO L750 eck$LassoCheckResult]: Loop: 58144#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; 58552#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 58532#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 58511#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 58166#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; 58137#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 58145#factENTRY ~n := #in~n; 58241#L25 assume !(~n <= 0); 58162#L26 call #t~ret0 := fact(~n - 1);< 58165#factENTRY ~n := #in~n; 58229#L25 assume !(~n <= 0); 58156#L26 call #t~ret0 := fact(~n - 1);< 58227#factENTRY ~n := #in~n; 58229#L25 assume !(~n <= 0); 58156#L26 call #t~ret0 := fact(~n - 1);< 58227#factENTRY ~n := #in~n; 58229#L25 assume !(~n <= 0); 58156#L26 call #t~ret0 := fact(~n - 1);< 58227#factENTRY ~n := #in~n; 58229#L25 assume !(~n <= 0); 58156#L26 call #t~ret0 := fact(~n - 1);< 58227#factENTRY ~n := #in~n; 58235#L25 assume ~n <= 0;#res := 1; 58228#factFINAL assume true; 58226#factEXIT >#66#return; 58225#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 58224#factFINAL assume true; 58220#factEXIT >#66#return; 58218#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 58216#factFINAL assume true; 58213#factEXIT >#66#return; 58210#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 58209#factFINAL assume true; 58194#factEXIT >#66#return; 58163#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 58189#factFINAL assume true; 58154#factEXIT >#66#return; 58152#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 58135#factFINAL assume true; 58138#factEXIT >#74#return; 58141#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 58142#factENTRY ~n := #in~n; 58146#L25 assume ~n <= 0;#res := 1; 58143#factFINAL assume true; 58140#factEXIT >#76#return; 58136#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 58139#factENTRY ~n := #in~n; 58240#L25 assume !(~n <= 0); 58155#L26 call #t~ret0 := fact(~n - 1);< 58237#factENTRY ~n := #in~n; 58236#L25 assume !(~n <= 0); 58158#L26 call #t~ret0 := fact(~n - 1);< 58190#factENTRY ~n := #in~n; 58238#L25 assume !(~n <= 0); 58161#L26 call #t~ret0 := fact(~n - 1);< 58214#factENTRY ~n := #in~n; 58230#L25 assume !(~n <= 0); 58157#L26 call #t~ret0 := fact(~n - 1);< 58222#factENTRY ~n := #in~n; 58229#L25 assume !(~n <= 0); 58156#L26 call #t~ret0 := fact(~n - 1);< 58227#factENTRY ~n := #in~n; 58235#L25 assume ~n <= 0;#res := 1; 58228#factFINAL assume true; 58226#factEXIT >#66#return; 58225#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 58224#factFINAL assume true; 58220#factEXIT >#66#return; 58218#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 58216#factFINAL assume true; 58213#factEXIT >#66#return; 58210#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 58209#factFINAL assume true; 58194#factEXIT >#66#return; 58163#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 58189#factFINAL assume true; 58154#factEXIT >#66#return; 58152#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 58135#factFINAL assume true; 58138#factEXIT >#78#return; 58144#L30-8 [2022-11-20 09:36:31,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:31,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1286157522, now seen corresponding path program 5 times [2022-11-20 09:36:31,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:31,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17559092] [2022-11-20 09:36:31,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:31,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:31,161 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:36:31,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [627445461] [2022-11-20 09:36:31,161 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-20 09:36:31,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:36:31,162 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:31,167 INFO L229 MonitoredProcess]: Starting monitored process 169 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:36:31,193 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (169)] Waiting until timeout for monitored process [2022-11-20 09:36:31,277 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-11-20 09:36:31,277 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:36:31,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-20 09:36:31,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:31,398 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 121 proven. 36 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2022-11-20 09:36:31,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:36:31,749 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 121 proven. 38 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-11-20 09:36:31,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:36:31,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17559092] [2022-11-20 09:36:31,750 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 09:36:31,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627445461] [2022-11-20 09:36:31,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627445461] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:36:31,750 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:36:31,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 15 [2022-11-20 09:36:31,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863244557] [2022-11-20 09:36:31,751 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:36:31,751 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-20 09:36:31,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:31,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1446162940, now seen corresponding path program 6 times [2022-11-20 09:36:31,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:31,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021200178] [2022-11-20 09:36:31,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:31,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:31,756 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:36:31,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2121668043] [2022-11-20 09:36:31,757 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-20 09:36:31,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:36:31,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:31,761 INFO L229 MonitoredProcess]: Starting monitored process 170 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:36:31,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (170)] Waiting until timeout for monitored process [2022-11-20 09:36:31,857 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2022-11-20 09:36:31,857 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-20 09:36:31,857 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:36:31,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:36:31,892 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:36:33,551 INFO L210 LassoAnalysis]: Preferences: [2022-11-20 09:36:33,552 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-20 09:36:33,552 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-20 09:36:33,552 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-20 09:36:33,552 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-20 09:36:33,552 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:33,552 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-20 09:36:33,552 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-20 09:36:33,552 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration21_Loop [2022-11-20 09:36:33,552 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-20 09:36:33,552 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-20 09:36:33,554 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:33,557 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:33,604 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:33,606 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:33,607 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:33,778 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-20 09:36:33,778 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-20 09:36:33,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:33,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:33,781 INFO L229 MonitoredProcess]: Starting monitored process 171 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:33,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Waiting until timeout for monitored process [2022-11-20 09:36:33,782 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-20 09:36:33,782 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 09:36:33,794 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-20 09:36:33,794 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret2#1=1} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret2#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-11-20 09:36:33,796 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Ended with exit code 0 [2022-11-20 09:36:33,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:33,797 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:33,798 INFO L229 MonitoredProcess]: Starting monitored process 172 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:33,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Waiting until timeout for monitored process [2022-11-20 09:36:33,800 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-20 09:36:33,800 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 09:36:33,817 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Forceful destruction successful, exit code 0 [2022-11-20 09:36:33,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:33,817 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:33,818 INFO L229 MonitoredProcess]: Starting monitored process 173 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:33,820 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Waiting until timeout for monitored process [2022-11-20 09:36:33,821 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-20 09:36:33,821 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 09:36:33,845 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-20 09:36:33,848 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Ended with exit code 0 [2022-11-20 09:36:33,848 INFO L210 LassoAnalysis]: Preferences: [2022-11-20 09:36:33,848 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-20 09:36:33,848 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-20 09:36:33,848 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-20 09:36:33,848 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-20 09:36:33,848 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:33,848 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-20 09:36:33,849 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-20 09:36:33,849 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration21_Loop [2022-11-20 09:36:33,849 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-20 09:36:33,849 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-20 09:36:33,850 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:33,896 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:33,898 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:33,900 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:33,901 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:34,074 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-20 09:36:34,075 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-20 09:36:34,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:34,075 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:34,076 INFO L229 MonitoredProcess]: Starting monitored process 174 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:34,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Waiting until timeout for monitored process [2022-11-20 09:36:34,079 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:36:34,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 09:36:34,089 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:36:34,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:36:34,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:36:34,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 09:36:34,092 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 09:36:34,092 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:36:34,097 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-20 09:36:34,101 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-11-20 09:36:34,101 INFO L444 ModelExtractionUtils]: 8 out of 11 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-11-20 09:36:34,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:34,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:34,103 INFO L229 MonitoredProcess]: Starting monitored process 175 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:34,105 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Waiting until timeout for monitored process [2022-11-20 09:36:34,105 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-20 09:36:34,105 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-20 09:36:34,105 INFO L513 LassoAnalysis]: Proved termination. [2022-11-20 09:36:34,105 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 9 Supporting invariants [] [2022-11-20 09:36:34,108 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Forceful destruction successful, exit code 0 [2022-11-20 09:36:34,108 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-20 09:36:34,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:34,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:34,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-20 09:36:34,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:34,697 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Forceful destruction successful, exit code 0 [2022-11-20 09:36:34,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:34,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-20 09:36:34,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:35,210 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2022-11-20 09:36:35,211 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 12 loop predicates [2022-11-20 09:36:35,211 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1905 states and 3072 transitions. cyclomatic complexity: 1197 Second operand has 15 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 6 states have call successors, (12), 2 states have call predecessors, (12), 8 states have return successors, (17), 10 states have call predecessors, (17), 6 states have call successors, (17) [2022-11-20 09:36:35,654 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1905 states and 3072 transitions. cyclomatic complexity: 1197. Second operand has 15 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 6 states have call successors, (12), 2 states have call predecessors, (12), 8 states have return successors, (17), 10 states have call predecessors, (17), 6 states have call successors, (17) Result 3706 states and 5645 transitions. Complement of second has 61 states. [2022-11-20 09:36:35,655 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 [2022-11-20 09:36:35,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 6 states have call successors, (12), 2 states have call predecessors, (12), 8 states have return successors, (17), 10 states have call predecessors, (17), 6 states have call successors, (17) [2022-11-20 09:36:35,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 85 transitions. [2022-11-20 09:36:35,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 85 transitions. Stem has 92 letters. Loop has 80 letters. [2022-11-20 09:36:35,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 09:36:35,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 85 transitions. Stem has 172 letters. Loop has 80 letters. [2022-11-20 09:36:35,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 09:36:35,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 85 transitions. Stem has 92 letters. Loop has 160 letters. [2022-11-20 09:36:35,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 09:36:35,659 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3706 states and 5645 transitions. [2022-11-20 09:36:35,687 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 227 [2022-11-20 09:36:35,745 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3706 states to 2572 states and 4069 transitions. [2022-11-20 09:36:35,746 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 530 [2022-11-20 09:36:35,747 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 534 [2022-11-20 09:36:35,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2572 states and 4069 transitions. [2022-11-20 09:36:35,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 09:36:35,747 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2572 states and 4069 transitions. [2022-11-20 09:36:35,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2572 states and 4069 transitions. [2022-11-20 09:36:35,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2572 to 2295. [2022-11-20 09:36:35,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2295 states, 1436 states have (on average 1.0571030640668524) internal successors, (1518), 1418 states have internal predecessors, (1518), 566 states have call successors, (602), 276 states have call predecessors, (602), 293 states have return successors, (1526), 600 states have call predecessors, (1526), 566 states have call successors, (1526) [2022-11-20 09:36:35,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2295 states to 2295 states and 3646 transitions. [2022-11-20 09:36:35,824 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2295 states and 3646 transitions. [2022-11-20 09:36:35,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:36:35,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-20 09:36:35,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-11-20 09:36:35,825 INFO L87 Difference]: Start difference. First operand 2295 states and 3646 transitions. Second operand has 16 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 13 states have internal predecessors, (40), 10 states have call successors, (17), 1 states have call predecessors, (17), 5 states have return successors, (18), 8 states have call predecessors, (18), 10 states have call successors, (18) [2022-11-20 09:36:36,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:36:36,321 INFO L93 Difference]: Finished difference Result 2349 states and 3644 transitions. [2022-11-20 09:36:36,321 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2349 states and 3644 transitions. [2022-11-20 09:36:36,339 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 238 [2022-11-20 09:36:36,359 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2349 states to 1953 states and 3134 transitions. [2022-11-20 09:36:36,360 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 540 [2022-11-20 09:36:36,361 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 540 [2022-11-20 09:36:36,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1953 states and 3134 transitions. [2022-11-20 09:36:36,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 09:36:36,361 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1953 states and 3134 transitions. [2022-11-20 09:36:36,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1953 states and 3134 transitions. [2022-11-20 09:36:36,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1953 to 1882. [2022-11-20 09:36:36,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1882 states, 1172 states have (on average 1.0631399317406143) internal successors, (1246), 1154 states have internal predecessors, (1246), 490 states have call successors, (510), 214 states have call predecessors, (510), 220 states have return successors, (1295), 513 states have call predecessors, (1295), 490 states have call successors, (1295) [2022-11-20 09:36:36,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1882 states to 1882 states and 3051 transitions. [2022-11-20 09:36:36,453 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1882 states and 3051 transitions. [2022-11-20 09:36:36,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 09:36:36,454 INFO L428 stractBuchiCegarLoop]: Abstraction has 1882 states and 3051 transitions. [2022-11-20 09:36:36,454 INFO L335 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2022-11-20 09:36:36,454 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1882 states and 3051 transitions. [2022-11-20 09:36:36,463 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 223 [2022-11-20 09:36:36,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 09:36:36,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 09:36:36,465 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 6, 2, 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, 1, 1] [2022-11-20 09:36:36,465 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [33, 33, 24, 24, 24, 24, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:36:36,465 INFO L748 eck$LassoCheckResult]: Stem: 69287#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 69258#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; 69259#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 69286#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; 69319#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 69641#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 70545#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; 69244#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 69245#factENTRY ~n := #in~n; 70597#L25 assume ~n <= 0;#res := 1; 70595#factFINAL assume true; 70539#factEXIT >#68#return; 69315#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 69241#factENTRY ~n := #in~n; 70505#L25 assume ~n <= 0;#res := 1; 70504#factFINAL assume true; 70501#factEXIT >#70#return; 69240#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 69241#factENTRY ~n := #in~n; 70505#L25 assume ~n <= 0;#res := 1; 70504#factFINAL assume true; 70501#factEXIT >#72#return; 70502#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; 69281#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 69282#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 70651#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 70649#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; 70642#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 70643#factENTRY ~n := #in~n; 70659#L25 assume !(~n <= 0); 70656#L26 call #t~ret0 := fact(~n - 1);< 70657#factENTRY ~n := #in~n; 70660#L25 assume ~n <= 0;#res := 1; 70658#factFINAL assume true; 70655#factEXIT >#66#return; 70654#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 70648#factFINAL assume true; 70641#factEXIT >#74#return; 70637#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 70638#factENTRY ~n := #in~n; 70647#L25 assume ~n <= 0;#res := 1; 70640#factFINAL assume true; 70636#factEXIT >#76#return; 70610#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 70612#factENTRY ~n := #in~n; 70653#L25 assume !(~n <= 0); 70645#L26 call #t~ret0 := fact(~n - 1);< 70646#factENTRY ~n := #in~n; 70652#L25 assume ~n <= 0;#res := 1; 70650#factFINAL assume true; 70644#factEXIT >#66#return; 70639#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 70635#factFINAL assume true; 70609#factEXIT >#78#return; 70611#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; 70604#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 70605#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 70189#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 70190#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 70184#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 69272#L42-3 [2022-11-20 09:36:36,466 INFO L750 eck$LassoCheckResult]: Loop: 69272#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 69310#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; 69369#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 69381#factENTRY ~n := #in~n; 69479#L25 assume !(~n <= 0); 69447#L26 call #t~ret0 := fact(~n - 1);< 69504#factENTRY ~n := #in~n; 69568#L25 assume !(~n <= 0); 69495#L26 call #t~ret0 := fact(~n - 1);< 69545#factENTRY ~n := #in~n; 69568#L25 assume !(~n <= 0); 69495#L26 call #t~ret0 := fact(~n - 1);< 69545#factENTRY ~n := #in~n; 69568#L25 assume !(~n <= 0); 69495#L26 call #t~ret0 := fact(~n - 1);< 69545#factENTRY ~n := #in~n; 69568#L25 assume !(~n <= 0); 69495#L26 call #t~ret0 := fact(~n - 1);< 69545#factENTRY ~n := #in~n; 69567#L25 assume ~n <= 0;#res := 1; 69566#factFINAL assume true; 69544#factEXIT >#66#return; 69543#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69537#factFINAL assume true; 69531#factEXIT >#66#return; 69529#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69526#factFINAL assume true; 69522#factEXIT >#66#return; 69521#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69515#factFINAL assume true; 69511#factEXIT >#66#return; 69502#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69505#factFINAL assume true; 69490#factEXIT >#66#return; 69488#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69486#factFINAL assume true; 69485#factEXIT >#68#return; 69335#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 69381#factENTRY ~n := #in~n; 69479#L25 assume ~n <= 0;#res := 1; 69437#factFINAL assume true; 69385#factEXIT >#70#return; 69404#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 69573#factENTRY ~n := #in~n; 69648#L25 assume !(~n <= 0); 69498#L26 call #t~ret0 := fact(~n - 1);< 69503#factENTRY ~n := #in~n; 69535#L25 assume !(~n <= 0); 69493#L26 call #t~ret0 := fact(~n - 1);< 69508#factENTRY ~n := #in~n; 69539#L25 assume !(~n <= 0); 69496#L26 call #t~ret0 := fact(~n - 1);< 69523#factENTRY ~n := #in~n; 69553#L25 assume !(~n <= 0); 69494#L26 call #t~ret0 := fact(~n - 1);< 69533#factENTRY ~n := #in~n; 69568#L25 assume !(~n <= 0); 69495#L26 call #t~ret0 := fact(~n - 1);< 69545#factENTRY ~n := #in~n; 69567#L25 assume ~n <= 0;#res := 1; 69566#factFINAL assume true; 69544#factEXIT >#66#return; 69543#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69537#factFINAL assume true; 69531#factEXIT >#66#return; 69529#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69526#factFINAL assume true; 69522#factEXIT >#66#return; 69521#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69515#factFINAL assume true; 69511#factEXIT >#66#return; 69502#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69505#factFINAL assume true; 69490#factEXIT >#66#return; 69488#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69486#factFINAL assume true; 69485#factEXIT >#72#return; 69420#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; 69572#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 69571#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 69570#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 69569#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; 69370#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 69381#factENTRY ~n := #in~n; 69479#L25 assume !(~n <= 0); 69447#L26 call #t~ret0 := fact(~n - 1);< 69504#factENTRY ~n := #in~n; 69568#L25 assume !(~n <= 0); 69495#L26 call #t~ret0 := fact(~n - 1);< 69545#factENTRY ~n := #in~n; 69568#L25 assume !(~n <= 0); 69495#L26 call #t~ret0 := fact(~n - 1);< 69545#factENTRY ~n := #in~n; 69568#L25 assume !(~n <= 0); 69495#L26 call #t~ret0 := fact(~n - 1);< 69545#factENTRY ~n := #in~n; 69568#L25 assume !(~n <= 0); 69495#L26 call #t~ret0 := fact(~n - 1);< 69545#factENTRY ~n := #in~n; 69567#L25 assume ~n <= 0;#res := 1; 69566#factFINAL assume true; 69544#factEXIT >#66#return; 69543#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69537#factFINAL assume true; 69531#factEXIT >#66#return; 69529#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69526#factFINAL assume true; 69522#factEXIT >#66#return; 69521#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69515#factFINAL assume true; 69511#factEXIT >#66#return; 69502#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69505#factFINAL assume true; 69490#factEXIT >#66#return; 69488#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69486#factFINAL assume true; 69485#factEXIT >#68#return; 69376#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 69381#factENTRY ~n := #in~n; 69479#L25 assume !(~n <= 0); 69447#L26 call #t~ret0 := fact(~n - 1);< 69504#factENTRY ~n := #in~n; 69568#L25 assume !(~n <= 0); 69495#L26 call #t~ret0 := fact(~n - 1);< 69545#factENTRY ~n := #in~n; 69567#L25 assume ~n <= 0;#res := 1; 69566#factFINAL assume true; 69544#factEXIT >#66#return; 69543#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69537#factFINAL assume true; 69531#factEXIT >#66#return; 69532#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69334#factFINAL assume true; 69380#factEXIT >#70#return; 69423#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 69383#factENTRY ~n := #in~n; 69647#L25 assume !(~n <= 0); 69500#L26 call #t~ret0 := fact(~n - 1);< 69520#factENTRY ~n := #in~n; 69553#L25 assume !(~n <= 0); 69494#L26 call #t~ret0 := fact(~n - 1);< 69533#factENTRY ~n := #in~n; 69568#L25 assume !(~n <= 0); 69495#L26 call #t~ret0 := fact(~n - 1);< 69545#factENTRY ~n := #in~n; 69567#L25 assume ~n <= 0;#res := 1; 69566#factFINAL assume true; 69544#factEXIT >#66#return; 69543#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69537#factFINAL assume true; 69531#factEXIT >#66#return; 69529#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69526#factFINAL assume true; 69522#factEXIT >#66#return; 69513#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 70130#factFINAL assume true; 69563#factEXIT >#72#return; 69422#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; 69582#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 69583#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 69576#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 69577#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; 69350#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 69381#factENTRY ~n := #in~n; 69479#L25 assume !(~n <= 0); 69447#L26 call #t~ret0 := fact(~n - 1);< 69504#factENTRY ~n := #in~n; 69568#L25 assume !(~n <= 0); 69495#L26 call #t~ret0 := fact(~n - 1);< 69545#factENTRY ~n := #in~n; 69567#L25 assume ~n <= 0;#res := 1; 69566#factFINAL assume true; 69544#factEXIT >#66#return; 69543#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69537#factFINAL assume true; 69531#factEXIT >#66#return; 69532#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69334#factFINAL assume true; 69380#factEXIT >#74#return; 69342#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 69381#factENTRY ~n := #in~n; 69479#L25 assume !(~n <= 0); 69447#L26 call #t~ret0 := fact(~n - 1);< 69504#factENTRY ~n := #in~n; 69473#L25 assume ~n <= 0;#res := 1; 69455#factFINAL assume true; 69444#factEXIT >#66#return; 69438#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69427#factFINAL assume true; 69428#factEXIT >#76#return; 69331#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 69384#factENTRY ~n := #in~n; 69477#L25 assume !(~n <= 0); 69440#L26 call #t~ret0 := fact(~n - 1);< 69443#factENTRY ~n := #in~n; 69472#L25 assume ~n <= 0;#res := 1; 69451#factFINAL assume true; 69439#factEXIT >#66#return; 69436#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69431#factFINAL assume true; 69328#factEXIT >#78#return; 69327#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; 69326#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 69324#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 69325#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 69283#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 69271#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 69272#L42-3 [2022-11-20 09:36:36,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:36,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1978773599, now seen corresponding path program 1 times [2022-11-20 09:36:36,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:36,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111005430] [2022-11-20 09:36:36,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:36,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:36,472 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:36:36,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [951647769] [2022-11-20 09:36:36,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:36,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:36:36,473 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:36,474 INFO L229 MonitoredProcess]: Starting monitored process 176 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:36:36,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (176)] Waiting until timeout for monitored process [2022-11-20 09:36:36,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:36:36,564 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:36:36,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:36:36,598 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:36:36,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:36,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1651098637, now seen corresponding path program 6 times [2022-11-20 09:36:36,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:36,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798662708] [2022-11-20 09:36:36,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:36,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:36,608 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:36:36,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1551203174] [2022-11-20 09:36:36,608 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-20 09:36:36,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:36:36,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:36,610 INFO L229 MonitoredProcess]: Starting monitored process 177 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:36:36,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (177)] Waiting until timeout for monitored process [2022-11-20 09:36:36,761 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2022-11-20 09:36:36,762 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:36:36,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-20 09:36:36,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:36,880 INFO L134 CoverageAnalysis]: Checked inductivity of 2681 backedges. 654 proven. 121 refuted. 0 times theorem prover too weak. 1906 trivial. 0 not checked. [2022-11-20 09:36:36,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:36:37,405 INFO L134 CoverageAnalysis]: Checked inductivity of 2681 backedges. 360 proven. 153 refuted. 0 times theorem prover too weak. 2168 trivial. 0 not checked. [2022-11-20 09:36:37,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:36:37,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798662708] [2022-11-20 09:36:37,406 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 09:36:37,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551203174] [2022-11-20 09:36:37,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551203174] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:36:37,407 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:36:37,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 16 [2022-11-20 09:36:37,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670292821] [2022-11-20 09:36:37,407 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:36:37,408 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 09:36:37,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:36:37,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-20 09:36:37,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-11-20 09:36:37,409 INFO L87 Difference]: Start difference. First operand 1882 states and 3051 transitions. cyclomatic complexity: 1197 Second operand has 16 states, 13 states have (on average 3.769230769230769) internal successors, (49), 16 states have internal predecessors, (49), 11 states have call successors, (18), 2 states have call predecessors, (18), 6 states have return successors, (18), 7 states have call predecessors, (18), 11 states have call successors, (18) [2022-11-20 09:36:38,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:36:38,026 INFO L93 Difference]: Finished difference Result 2279 states and 3704 transitions. [2022-11-20 09:36:38,026 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2279 states and 3704 transitions. [2022-11-20 09:36:38,045 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 285 [2022-11-20 09:36:38,062 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2279 states to 1958 states and 3000 transitions. [2022-11-20 09:36:38,063 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 674 [2022-11-20 09:36:38,064 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 674 [2022-11-20 09:36:38,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1958 states and 3000 transitions. [2022-11-20 09:36:38,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 09:36:38,065 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1958 states and 3000 transitions. [2022-11-20 09:36:38,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1958 states and 3000 transitions. [2022-11-20 09:36:38,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1958 to 1807. [2022-11-20 09:36:38,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1807 states, 1161 states have (on average 1.0594315245478036) internal successors, (1230), 1145 states have internal predecessors, (1230), 426 states have call successors, (446), 214 states have call predecessors, (446), 220 states have return successors, (1079), 447 states have call predecessors, (1079), 426 states have call successors, (1079) [2022-11-20 09:36:38,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1807 states to 1807 states and 2755 transitions. [2022-11-20 09:36:38,117 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1807 states and 2755 transitions. [2022-11-20 09:36:38,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 09:36:38,118 INFO L428 stractBuchiCegarLoop]: Abstraction has 1807 states and 2755 transitions. [2022-11-20 09:36:38,118 INFO L335 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2022-11-20 09:36:38,118 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1807 states and 2755 transitions. [2022-11-20 09:36:38,145 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 249 [2022-11-20 09:36:38,145 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 09:36:38,145 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 09:36:38,146 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 6, 2, 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, 1, 1] [2022-11-20 09:36:38,146 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] [2022-11-20 09:36:38,146 INFO L748 eck$LassoCheckResult]: Stem: 74723#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 74692#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; 74693#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 74722#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; 74743#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 75009#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 75841#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; 75839#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 75840#factENTRY ~n := #in~n; 75868#L25 assume ~n <= 0;#res := 1; 75867#factFINAL assume true; 75838#factEXIT >#68#return; 74737#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 74668#factENTRY ~n := #in~n; 75919#L25 assume ~n <= 0;#res := 1; 75909#factFINAL assume true; 75905#factEXIT >#70#return; 74667#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 74668#factENTRY ~n := #in~n; 75919#L25 assume ~n <= 0;#res := 1; 75909#factFINAL assume true; 75905#factEXIT >#72#return; 75906#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; 74714#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 74715#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 76027#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 76025#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; 76011#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 76012#factENTRY ~n := #in~n; 76022#L25 assume !(~n <= 0); 76020#L26 call #t~ret0 := fact(~n - 1);< 76021#factENTRY ~n := #in~n; 76024#L25 assume ~n <= 0;#res := 1; 76023#factFINAL assume true; 76019#factEXIT >#66#return; 76018#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 76017#factFINAL assume true; 76010#factEXIT >#74#return; 76006#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 76007#factENTRY ~n := #in~n; 76016#L25 assume ~n <= 0;#res := 1; 76009#factFINAL assume true; 76005#factEXIT >#76#return; 75983#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 75985#factENTRY ~n := #in~n; 76029#L25 assume !(~n <= 0); 76014#L26 call #t~ret0 := fact(~n - 1);< 76015#factENTRY ~n := #in~n; 76028#L25 assume ~n <= 0;#res := 1; 76026#factFINAL assume true; 76013#factEXIT >#66#return; 76008#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 76004#factFINAL assume true; 75982#factEXIT >#78#return; 75984#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; 75978#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 75979#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 75654#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 74720#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 74721#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 75099#L42-3 [2022-11-20 09:36:38,147 INFO L750 eck$LassoCheckResult]: Loop: 75099#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 75098#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; 74775#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 74762#factENTRY ~n := #in~n; 74897#L25 assume !(~n <= 0); 74873#L26 call #t~ret0 := fact(~n - 1);< 74918#factENTRY ~n := #in~n; 74895#L25 assume ~n <= 0;#res := 1; 74879#factFINAL assume true; 74872#factEXIT >#66#return; 74858#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74855#factFINAL assume true; 74846#factEXIT >#68#return; 74809#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 74762#factENTRY ~n := #in~n; 74897#L25 assume ~n <= 0;#res := 1; 74853#factFINAL assume true; 74769#factEXIT >#70#return; 74835#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 74856#factENTRY ~n := #in~n; 74896#L25 assume !(~n <= 0); 74873#L26 call #t~ret0 := fact(~n - 1);< 74918#factENTRY ~n := #in~n; 74895#L25 assume ~n <= 0;#res := 1; 74879#factFINAL assume true; 74872#factEXIT >#66#return; 74858#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74855#factFINAL assume true; 74846#factEXIT >#72#return; 74852#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; 75641#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 75640#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 75639#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 75638#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; 74822#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 74762#factENTRY ~n := #in~n; 74897#L25 assume !(~n <= 0); 74873#L26 call #t~ret0 := fact(~n - 1);< 74918#factENTRY ~n := #in~n; 74895#L25 assume ~n <= 0;#res := 1; 74879#factFINAL assume true; 74872#factEXIT >#66#return; 74858#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74855#factFINAL assume true; 74846#factEXIT >#68#return; 74799#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 74845#factENTRY ~n := #in~n; 74938#L25 assume !(~n <= 0); 74876#L26 call #t~ret0 := fact(~n - 1);< 74878#factENTRY ~n := #in~n; 74895#L25 assume ~n <= 0;#res := 1; 74879#factFINAL assume true; 74872#factEXIT >#66#return; 74858#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74855#factFINAL assume true; 74846#factEXIT >#70#return; 74801#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 74854#factENTRY ~n := #in~n; 74857#L25 assume ~n <= 0;#res := 1; 74853#factFINAL assume true; 74769#factEXIT >#72#return; 74826#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; 75632#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 75629#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 75627#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 75621#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; 74781#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 74762#factENTRY ~n := #in~n; 74897#L25 assume !(~n <= 0); 74873#L26 call #t~ret0 := fact(~n - 1);< 74918#factENTRY ~n := #in~n; 75010#L25 assume !(~n <= 0); 74908#L26 call #t~ret0 := fact(~n - 1);< 74998#factENTRY ~n := #in~n; 75011#L25 assume ~n <= 0;#res := 1; 75002#factFINAL assume true; 74997#factEXIT >#66#return; 74993#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74986#factFINAL assume true; 74972#factEXIT >#66#return; 74973#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75021#factFINAL assume true; 75018#factEXIT >#74#return; 74820#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 74845#factENTRY ~n := #in~n; 74938#L25 assume !(~n <= 0); 74876#L26 call #t~ret0 := fact(~n - 1);< 74878#factENTRY ~n := #in~n; 74895#L25 assume ~n <= 0;#res := 1; 74879#factFINAL assume true; 74872#factEXIT >#66#return; 74858#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74855#factFINAL assume true; 74846#factEXIT >#76#return; 74755#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 74760#factENTRY ~n := #in~n; 75057#L25 assume !(~n <= 0); 75054#L26 call #t~ret0 := fact(~n - 1);< 75056#factENTRY ~n := #in~n; 75614#L25 assume ~n <= 0;#res := 1; 75079#factFINAL assume true; 75052#factEXIT >#66#return; 75050#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74761#factFINAL assume true; 74754#factEXIT >#78#return; 74759#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; 75077#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 75076#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 74747#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 74748#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 75101#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 75099#L42-3 [2022-11-20 09:36:38,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:38,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1978773599, now seen corresponding path program 2 times [2022-11-20 09:36:38,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:38,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134720103] [2022-11-20 09:36:38,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:38,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:38,153 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:36:38,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1660000515] [2022-11-20 09:36:38,154 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 09:36:38,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:36:38,154 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:38,159 INFO L229 MonitoredProcess]: Starting monitored process 178 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:36:38,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (178)] Waiting until timeout for monitored process [2022-11-20 09:36:38,249 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 09:36:38,249 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-20 09:36:38,249 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:36:38,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:36:38,284 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:36:38,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:38,285 INFO L85 PathProgramCache]: Analyzing trace with hash 590406435, now seen corresponding path program 7 times [2022-11-20 09:36:38,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:38,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420116857] [2022-11-20 09:36:38,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:38,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:38,291 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:36:38,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [846156150] [2022-11-20 09:36:38,292 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 09:36:38,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:36:38,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:38,299 INFO L229 MonitoredProcess]: Starting monitored process 179 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:36:38,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (179)] Waiting until timeout for monitored process [2022-11-20 09:36:38,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:36:38,408 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:36:38,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:36:38,465 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:36:38,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:38,465 INFO L85 PathProgramCache]: Analyzing trace with hash 736681859, now seen corresponding path program 3 times [2022-11-20 09:36:38,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:38,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313461634] [2022-11-20 09:36:38,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:38,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:38,474 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:36:38,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1076179338] [2022-11-20 09:36:38,474 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 09:36:38,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:36:38,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:38,479 INFO L229 MonitoredProcess]: Starting monitored process 180 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:36:38,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (180)] Waiting until timeout for monitored process [2022-11-20 09:36:38,634 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2022-11-20 09:36:38,634 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:36:38,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-20 09:36:38,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:38,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1355 backedges. 66 proven. 85 refuted. 0 times theorem prover too weak. 1204 trivial. 0 not checked. [2022-11-20 09:36:38,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:36:39,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1355 backedges. 51 proven. 100 refuted. 0 times theorem prover too weak. 1204 trivial. 0 not checked. [2022-11-20 09:36:39,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:36:39,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313461634] [2022-11-20 09:36:39,040 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 09:36:39,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076179338] [2022-11-20 09:36:39,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076179338] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:36:39,041 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:36:39,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2022-11-20 09:36:39,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684524350] [2022-11-20 09:36:39,041 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:36:42,390 INFO L210 LassoAnalysis]: Preferences: [2022-11-20 09:36:42,390 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-20 09:36:42,390 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-20 09:36:42,390 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-20 09:36:42,391 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-20 09:36:42,391 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:42,391 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-20 09:36:42,391 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-20 09:36:42,391 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration23_Loop [2022-11-20 09:36:42,391 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-20 09:36:42,391 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-20 09:36:42,392 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:42,396 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:42,398 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:42,400 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:42,402 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:42,404 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:42,406 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:42,486 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:42,879 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-20 09:36:42,879 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-20 09:36:42,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:42,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:42,882 INFO L229 MonitoredProcess]: Starting monitored process 181 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:42,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Waiting until timeout for monitored process [2022-11-20 09:36:42,884 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-20 09:36:42,884 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 09:36:42,895 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-20 09:36:42,895 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: [] [2022-11-20 09:36:42,898 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Forceful destruction successful, exit code 0 [2022-11-20 09:36:42,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:42,899 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:42,900 INFO L229 MonitoredProcess]: Starting monitored process 182 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:42,901 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Waiting until timeout for monitored process [2022-11-20 09:36:42,902 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-20 09:36:42,903 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 09:36:42,914 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-20 09:36:42,914 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: [] [2022-11-20 09:36:42,916 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Ended with exit code 0 [2022-11-20 09:36:42,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:42,917 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:42,918 INFO L229 MonitoredProcess]: Starting monitored process 183 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:42,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Waiting until timeout for monitored process [2022-11-20 09:36:42,920 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-20 09:36:42,920 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 09:36:42,932 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-20 09:36:42,932 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: [] [2022-11-20 09:36:42,934 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Ended with exit code 0 [2022-11-20 09:36:42,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:42,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:42,935 INFO L229 MonitoredProcess]: Starting monitored process 184 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:42,937 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Waiting until timeout for monitored process [2022-11-20 09:36:42,938 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-20 09:36:42,938 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 09:36:42,949 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-20 09:36:42,949 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: [] [2022-11-20 09:36:42,951 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Forceful destruction successful, exit code 0 [2022-11-20 09:36:42,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:42,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:42,953 INFO L229 MonitoredProcess]: Starting monitored process 185 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:42,963 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Waiting until timeout for monitored process [2022-11-20 09:36:42,965 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-20 09:36:42,965 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 09:36:42,976 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-20 09:36:42,976 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: [] [2022-11-20 09:36:42,979 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Forceful destruction successful, exit code 0 [2022-11-20 09:36:42,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:42,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:42,980 INFO L229 MonitoredProcess]: Starting monitored process 186 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:42,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Waiting until timeout for monitored process [2022-11-20 09:36:42,983 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-20 09:36:42,983 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 09:36:42,994 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-20 09:36:42,994 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: [] [2022-11-20 09:36:42,997 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Forceful destruction successful, exit code 0 [2022-11-20 09:36:42,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:42,997 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:42,998 INFO L229 MonitoredProcess]: Starting monitored process 187 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:42,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Waiting until timeout for monitored process [2022-11-20 09:36:43,000 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-20 09:36:43,000 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 09:36:43,017 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Ended with exit code 0 [2022-11-20 09:36:43,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:43,023 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:43,024 INFO L229 MonitoredProcess]: Starting monitored process 188 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:43,026 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Waiting until timeout for monitored process [2022-11-20 09:36:43,027 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-20 09:36:43,027 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 09:36:43,052 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-20 09:36:43,055 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Forceful destruction successful, exit code 0 [2022-11-20 09:36:43,056 INFO L210 LassoAnalysis]: Preferences: [2022-11-20 09:36:43,056 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-20 09:36:43,057 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-20 09:36:43,057 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-20 09:36:43,057 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-20 09:36:43,057 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:43,057 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-20 09:36:43,057 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-20 09:36:43,057 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration23_Loop [2022-11-20 09:36:43,057 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-20 09:36:43,057 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-20 09:36:43,058 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:43,134 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:43,141 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:43,144 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:43,145 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:43,148 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:43,149 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:43,151 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:43,569 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-20 09:36:43,570 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-20 09:36:43,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:43,570 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:43,571 INFO L229 MonitoredProcess]: Starting monitored process 189 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:43,576 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Waiting until timeout for monitored process [2022-11-20 09:36:43,577 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:36:43,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 09:36:43,588 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:36:43,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:36:43,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:36:43,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 09:36:43,592 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 09:36:43,592 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:36:43,623 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-20 09:36:43,627 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-11-20 09:36:43,628 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-11-20 09:36:43,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:43,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:43,635 INFO L229 MonitoredProcess]: Starting monitored process 190 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:43,636 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-20 09:36:43,636 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-20 09:36:43,637 INFO L513 LassoAnalysis]: Proved termination. [2022-11-20 09:36:43,637 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1) = -2*ULTIMATE.start_main_~n~0#1 + 3 Supporting invariants [] [2022-11-20 09:36:43,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Waiting until timeout for monitored process [2022-11-20 09:36:43,640 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Forceful destruction successful, exit code 0 [2022-11-20 09:36:43,641 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-20 09:36:43,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:43,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:43,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-20 09:36:43,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:44,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:44,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 733 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-20 09:36:44,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:44,506 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 5 proven. 107 refuted. 0 times theorem prover too weak. 505 trivial. 0 not checked. [2022-11-20 09:36:44,506 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 [2022-11-20 09:36:44,507 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1807 states and 2755 transitions. cyclomatic complexity: 981 Second operand has 11 states, 10 states have (on average 4.5) internal successors, (45), 11 states have internal predecessors, (45), 6 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) [2022-11-20 09:36:44,842 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Forceful destruction successful, exit code 0 [2022-11-20 09:36:44,899 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1807 states and 2755 transitions. cyclomatic complexity: 981. Second operand has 11 states, 10 states have (on average 4.5) internal successors, (45), 11 states have internal predecessors, (45), 6 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) Result 3733 states and 5664 transitions. Complement of second has 32 states. [2022-11-20 09:36:44,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2022-11-20 09:36:44,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 4.5) internal successors, (45), 11 states have internal predecessors, (45), 6 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) [2022-11-20 09:36:44,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 81 transitions. [2022-11-20 09:36:44,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 81 transitions. Stem has 60 letters. Loop has 111 letters. [2022-11-20 09:36:44,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 09:36:44,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 81 transitions. Stem has 171 letters. Loop has 111 letters. [2022-11-20 09:36:44,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 09:36:44,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 81 transitions. Stem has 60 letters. Loop has 222 letters. [2022-11-20 09:36:44,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 09:36:44,903 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3733 states and 5664 transitions. [2022-11-20 09:36:44,931 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 209 [2022-11-20 09:36:44,948 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3733 states to 2029 states and 3080 transitions. [2022-11-20 09:36:44,949 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 575 [2022-11-20 09:36:44,952 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 577 [2022-11-20 09:36:44,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2029 states and 3080 transitions. [2022-11-20 09:36:44,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 09:36:44,952 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2029 states and 3080 transitions. [2022-11-20 09:36:44,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2029 states and 3080 transitions. [2022-11-20 09:36:44,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2029 to 2021. [2022-11-20 09:36:45,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2021 states, 1303 states have (on average 1.0636991557943207) internal successors, (1386), 1284 states have internal predecessors, (1386), 476 states have call successors, (496), 240 states have call predecessors, (496), 242 states have return successors, (1189), 496 states have call predecessors, (1189), 476 states have call successors, (1189) [2022-11-20 09:36:45,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2021 states to 2021 states and 3071 transitions. [2022-11-20 09:36:45,009 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2021 states and 3071 transitions. [2022-11-20 09:36:45,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:36:45,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-20 09:36:45,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-11-20 09:36:45,010 INFO L87 Difference]: Start difference. First operand 2021 states and 3071 transitions. Second operand has 15 states, 12 states have (on average 4.666666666666667) internal successors, (56), 15 states have internal predecessors, (56), 9 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 7 states have call predecessors, (23), 9 states have call successors, (23) [2022-11-20 09:36:45,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:36:45,614 INFO L93 Difference]: Finished difference Result 2866 states and 4725 transitions. [2022-11-20 09:36:45,614 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2866 states and 4725 transitions. [2022-11-20 09:36:45,637 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 385 [2022-11-20 09:36:45,667 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2866 states to 2710 states and 4476 transitions. [2022-11-20 09:36:45,668 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1054 [2022-11-20 09:36:45,669 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1054 [2022-11-20 09:36:45,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2710 states and 4476 transitions. [2022-11-20 09:36:45,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 09:36:45,670 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2710 states and 4476 transitions. [2022-11-20 09:36:45,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2710 states and 4476 transitions. [2022-11-20 09:36:45,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2710 to 2096. [2022-11-20 09:36:45,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2096 states, 1344 states have (on average 1.0654761904761905) internal successors, (1432), 1325 states have internal predecessors, (1432), 510 states have call successors, (530), 240 states have call predecessors, (530), 242 states have return successors, (1279), 530 states have call predecessors, (1279), 510 states have call successors, (1279) [2022-11-20 09:36:45,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2096 states to 2096 states and 3241 transitions. [2022-11-20 09:36:45,752 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2096 states and 3241 transitions. [2022-11-20 09:36:45,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 09:36:45,753 INFO L428 stractBuchiCegarLoop]: Abstraction has 2096 states and 3241 transitions. [2022-11-20 09:36:45,753 INFO L335 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2022-11-20 09:36:45,754 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2096 states and 3241 transitions. [2022-11-20 09:36:45,763 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 232 [2022-11-20 09:36:45,763 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 09:36:45,764 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 09:36:45,766 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 11, 8, 3, 3, 3, 3, 3, 2, 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] [2022-11-20 09:36:45,767 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [9, 9, 6, 6, 6, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:36:45,767 INFO L748 eck$LassoCheckResult]: Stem: 86771#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 86744#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; 86745#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 86770#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; 86756#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 86757#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 88173#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; 88170#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 88171#factENTRY ~n := #in~n; 88175#L25 assume ~n <= 0;#res := 1; 88174#factFINAL assume true; 88169#factEXIT >#68#return; 88166#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 88167#factENTRY ~n := #in~n; 88172#L25 assume ~n <= 0;#res := 1; 88168#factFINAL assume true; 88164#factEXIT >#70#return; 88165#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 88167#factENTRY ~n := #in~n; 88172#L25 assume ~n <= 0;#res := 1; 88168#factFINAL assume true; 88164#factEXIT >#72#return; 88163#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; 88162#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 88161#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 88160#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 88152#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; 88146#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 88147#factENTRY ~n := #in~n; 88177#L25 assume !(~n <= 0); 88158#L26 call #t~ret0 := fact(~n - 1);< 88159#factENTRY ~n := #in~n; 88178#L25 assume ~n <= 0;#res := 1; 88176#factFINAL assume true; 88157#factEXIT >#66#return; 88151#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 88150#factFINAL assume true; 88145#factEXIT >#74#return; 88142#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 88143#factENTRY ~n := #in~n; 88149#L25 assume ~n <= 0;#res := 1; 88144#factFINAL assume true; 88141#factEXIT >#76#return; 88138#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 88140#factENTRY ~n := #in~n; 88188#L25 assume !(~n <= 0); 88185#L26 call #t~ret0 := fact(~n - 1);< 88186#factENTRY ~n := #in~n; 88189#L25 assume ~n <= 0;#res := 1; 88187#factFINAL assume true; 88184#factEXIT >#66#return; 88183#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 88181#factFINAL assume true; 88137#factEXIT >#78#return; 88139#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; 88200#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 88199#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 87076#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 87074#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 87071#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 87070#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 87069#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; 86840#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 86853#factENTRY ~n := #in~n; 87039#L25 assume !(~n <= 0); 86887#L26 call #t~ret0 := fact(~n - 1);< 87000#factENTRY ~n := #in~n; 87037#L25 assume ~n <= 0;#res := 1; 87002#factFINAL assume true; 86994#factEXIT >#66#return; 86992#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 86989#factFINAL assume true; 86979#factEXIT >#68#return; 86980#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 87125#factENTRY ~n := #in~n; 87127#L25 assume ~n <= 0;#res := 1; 87054#factFINAL assume true; 87080#factEXIT >#70#return; 87101#L30-2 [2022-11-20 09:36:45,767 INFO L750 eck$LassoCheckResult]: Loop: 87101#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 87424#factENTRY ~n := #in~n; 87430#L25 assume !(~n <= 0); 86886#L26 call #t~ret0 := fact(~n - 1);< 87000#factENTRY ~n := #in~n; 86925#L25 assume !(~n <= 0); 86890#L26 call #t~ret0 := fact(~n - 1);< 86923#factENTRY ~n := #in~n; 86925#L25 assume !(~n <= 0); 86890#L26 call #t~ret0 := fact(~n - 1);< 86923#factENTRY ~n := #in~n; 86925#L25 assume !(~n <= 0); 86890#L26 call #t~ret0 := fact(~n - 1);< 86923#factENTRY ~n := #in~n; 86925#L25 assume !(~n <= 0); 86890#L26 call #t~ret0 := fact(~n - 1);< 86923#factENTRY ~n := #in~n; 86926#L25 assume ~n <= 0;#res := 1; 86924#factFINAL assume true; 86921#factEXIT >#66#return; 86922#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 86958#factFINAL assume true; 86885#factEXIT >#66#return; 86896#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 86900#factFINAL assume true; 86905#factEXIT >#66#return; 86916#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 86917#factFINAL assume true; 86957#factEXIT >#66#return; 86952#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 86953#factFINAL assume true; 86949#factEXIT >#66#return; 86951#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 87122#factFINAL assume true; 87124#factEXIT >#72#return; 86765#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; 86761#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 86762#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 86780#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 86781#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; 87082#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 87125#factENTRY ~n := #in~n; 87127#L25 assume !(~n <= 0); 86886#L26 call #t~ret0 := fact(~n - 1);< 87000#factENTRY ~n := #in~n; 87037#L25 assume ~n <= 0;#res := 1; 87002#factFINAL assume true; 86994#factEXIT >#66#return; 86998#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 87423#factFINAL assume true; 87133#factEXIT >#68#return; 87045#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 87397#factENTRY ~n := #in~n; 87040#L25 assume ~n <= 0;#res := 1; 87054#factFINAL assume true; 87080#factEXIT >#70#return; 87101#L30-2 [2022-11-20 09:36:45,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:45,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1558900032, now seen corresponding path program 4 times [2022-11-20 09:36:45,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:45,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187526299] [2022-11-20 09:36:45,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:45,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:45,777 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:36:45,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2008650940] [2022-11-20 09:36:45,777 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 09:36:45,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:36:45,777 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:45,779 INFO L229 MonitoredProcess]: Starting monitored process 191 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:36:45,815 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (191)] Waiting until timeout for monitored process [2022-11-20 09:36:45,887 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 09:36:45,887 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-20 09:36:45,887 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:36:45,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:36:45,929 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:36:45,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:45,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1645370526, now seen corresponding path program 2 times [2022-11-20 09:36:45,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:45,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494312741] [2022-11-20 09:36:45,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:45,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:45,934 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:36:45,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1531919179] [2022-11-20 09:36:45,934 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 09:36:45,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:36:45,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:45,937 INFO L229 MonitoredProcess]: Starting monitored process 192 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:36:45,960 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (192)] Waiting until timeout for monitored process [2022-11-20 09:36:46,022 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 09:36:46,022 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-20 09:36:46,022 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:36:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:36:46,048 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:36:46,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:46,049 INFO L85 PathProgramCache]: Analyzing trace with hash -2137274463, now seen corresponding path program 5 times [2022-11-20 09:36:46,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:46,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155142697] [2022-11-20 09:36:46,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:46,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:46,057 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:36:46,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1140365174] [2022-11-20 09:36:46,057 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-20 09:36:46,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:36:46,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:46,061 INFO L229 MonitoredProcess]: Starting monitored process 193 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:36:46,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (193)] Waiting until timeout for monitored process [2022-11-20 09:36:46,193 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2022-11-20 09:36:46,194 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:36:46,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-20 09:36:46,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:46,314 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 338 proven. 24 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2022-11-20 09:36:46,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:36:46,593 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 118 proven. 47 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2022-11-20 09:36:46,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:36:46,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155142697] [2022-11-20 09:36:46,593 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 09:36:46,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140365174] [2022-11-20 09:36:46,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140365174] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:36:46,594 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:36:46,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 13 [2022-11-20 09:36:46,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668802391] [2022-11-20 09:36:46,594 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:36:47,467 INFO L210 LassoAnalysis]: Preferences: [2022-11-20 09:36:47,467 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-20 09:36:47,467 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-20 09:36:47,467 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-20 09:36:47,467 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-20 09:36:47,467 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:47,468 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-20 09:36:47,468 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-20 09:36:47,468 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration24_Loop [2022-11-20 09:36:47,468 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-20 09:36:47,468 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-20 09:36:47,469 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:47,470 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:47,472 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:47,496 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:47,501 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:47,502 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:47,594 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-20 09:36:47,595 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-20 09:36:47,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:47,595 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:47,598 INFO L229 MonitoredProcess]: Starting monitored process 194 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:47,598 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Waiting until timeout for monitored process [2022-11-20 09:36:47,599 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-20 09:36:47,599 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 09:36:47,610 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-20 09:36:47,611 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: [] [2022-11-20 09:36:47,613 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Ended with exit code 0 [2022-11-20 09:36:47,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:47,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:47,614 INFO L229 MonitoredProcess]: Starting monitored process 195 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:47,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Waiting until timeout for monitored process [2022-11-20 09:36:47,617 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-20 09:36:47,617 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 09:36:47,628 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-20 09:36:47,628 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: [] [2022-11-20 09:36:47,631 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Ended with exit code 0 [2022-11-20 09:36:47,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:47,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:47,633 INFO L229 MonitoredProcess]: Starting monitored process 196 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:47,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Waiting until timeout for monitored process [2022-11-20 09:36:47,635 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-20 09:36:47,635 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 09:36:47,652 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Ended with exit code 0 [2022-11-20 09:36:47,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:47,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:47,653 INFO L229 MonitoredProcess]: Starting monitored process 197 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:47,655 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Waiting until timeout for monitored process [2022-11-20 09:36:47,656 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-20 09:36:47,656 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 09:36:48,556 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-20 09:36:48,560 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Ended with exit code 0 [2022-11-20 09:36:48,561 INFO L210 LassoAnalysis]: Preferences: [2022-11-20 09:36:48,561 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-20 09:36:48,561 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-20 09:36:48,561 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-20 09:36:48,561 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-20 09:36:48,561 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:48,561 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-20 09:36:48,561 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-20 09:36:48,561 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration24_Loop [2022-11-20 09:36:48,561 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-20 09:36:48,561 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-20 09:36:48,562 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:48,564 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:48,566 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:48,589 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:48,592 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:48,594 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:48,689 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-20 09:36:48,689 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-20 09:36:48,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:48,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:48,690 INFO L229 MonitoredProcess]: Starting monitored process 198 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:48,693 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Waiting until timeout for monitored process [2022-11-20 09:36:48,693 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:36:48,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 09:36:48,703 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:36:48,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:36:48,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:36:48,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 09:36:48,704 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 09:36:48,704 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:36:48,705 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:36:48,708 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Forceful destruction successful, exit code 0 [2022-11-20 09:36:48,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:48,708 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:48,709 INFO L229 MonitoredProcess]: Starting monitored process 199 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:48,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Waiting until timeout for monitored process [2022-11-20 09:36:48,712 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-20 09:36:48,725 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 09:36:48,725 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:36:48,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:36:48,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:36:48,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 09:36:48,725 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 09:36:48,725 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:36:48,727 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 09:36:48,729 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Ended with exit code 0 [2022-11-20 09:36:48,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:48,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:48,731 INFO L229 MonitoredProcess]: Starting monitored process 200 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:48,737 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Waiting until timeout for monitored process [2022-11-20 09:36:48,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 [2022-11-20 09:36:48,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 09:36:48,748 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 09:36:48,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 09:36:48,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 09:36:48,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 09:36:48,750 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 09:36:48,751 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 09:36:48,756 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-20 09:36:48,761 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-11-20 09:36:48,761 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-11-20 09:36:48,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:48,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:48,767 INFO L229 MonitoredProcess]: Starting monitored process 201 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:48,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Waiting until timeout for monitored process [2022-11-20 09:36:48,768 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-20 09:36:48,768 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-20 09:36:48,768 INFO L513 LassoAnalysis]: Proved termination. [2022-11-20 09:36:48,768 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -1*ULTIMATE.start_main_~k~0#1 Supporting invariants [] [2022-11-20 09:36:48,771 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Ended with exit code 0 [2022-11-20 09:36:48,772 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-20 09:36:48,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:48,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:48,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-20 09:36:48,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:49,305 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Forceful destruction successful, exit code 0 [2022-11-20 09:36:49,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:49,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-20 09:36:49,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:49,548 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 46 proven. 8 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-11-20 09:36:49,549 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 [2022-11-20 09:36:49,549 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2096 states and 3241 transitions. cyclomatic complexity: 1186 Second operand has 11 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2022-11-20 09:36:49,805 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2096 states and 3241 transitions. cyclomatic complexity: 1186. Second operand has 11 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) Result 3159 states and 4657 transitions. Complement of second has 38 states. [2022-11-20 09:36:49,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2022-11-20 09:36:49,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2022-11-20 09:36:49,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 51 transitions. [2022-11-20 09:36:49,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 51 transitions. Stem has 78 letters. Loop has 56 letters. [2022-11-20 09:36:49,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 09:36:49,807 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-11-20 09:36:49,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:49,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:49,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-20 09:36:49,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:50,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:50,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-20 09:36:50,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:50,603 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 46 proven. 8 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-11-20 09:36:50,604 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 [2022-11-20 09:36:50,604 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2096 states and 3241 transitions. cyclomatic complexity: 1186 Second operand has 11 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2022-11-20 09:36:50,854 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2096 states and 3241 transitions. cyclomatic complexity: 1186. Second operand has 11 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) Result 3161 states and 4659 transitions. Complement of second has 42 states. [2022-11-20 09:36:50,855 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 [2022-11-20 09:36:50,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2022-11-20 09:36:50,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2022-11-20 09:36:50,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 52 transitions. Stem has 78 letters. Loop has 56 letters. [2022-11-20 09:36:50,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 09:36:50,856 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-11-20 09:36:50,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:50,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:50,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-20 09:36:50,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:51,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:51,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-20 09:36:51,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:51,696 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 46 proven. 8 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-11-20 09:36:51,697 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 [2022-11-20 09:36:51,697 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2096 states and 3241 transitions. cyclomatic complexity: 1186 Second operand has 11 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2022-11-20 09:36:52,055 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2096 states and 3241 transitions. cyclomatic complexity: 1186. Second operand has 11 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) Result 5082 states and 7544 transitions. Complement of second has 72 states. [2022-11-20 09:36:52,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2022-11-20 09:36:52,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 7 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2022-11-20 09:36:52,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 100 transitions. [2022-11-20 09:36:52,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 100 transitions. Stem has 78 letters. Loop has 56 letters. [2022-11-20 09:36:52,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 09:36:52,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 100 transitions. Stem has 134 letters. Loop has 56 letters. [2022-11-20 09:36:52,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 09:36:52,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 100 transitions. Stem has 78 letters. Loop has 112 letters. [2022-11-20 09:36:52,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 09:36:52,068 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5082 states and 7544 transitions. [2022-11-20 09:36:52,106 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 184 [2022-11-20 09:36:52,145 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5082 states to 3325 states and 4999 transitions. [2022-11-20 09:36:52,146 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 814 [2022-11-20 09:36:52,148 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 879 [2022-11-20 09:36:52,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3325 states and 4999 transitions. [2022-11-20 09:36:52,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 09:36:52,149 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3325 states and 4999 transitions. [2022-11-20 09:36:52,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3325 states and 4999 transitions. [2022-11-20 09:36:52,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3325 to 2930. [2022-11-20 09:36:52,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2930 states, 1880 states have (on average 1.0702127659574467) internal successors, (2012), 1873 states have internal predecessors, (2012), 660 states have call successors, (717), 357 states have call predecessors, (717), 390 states have return successors, (1641), 699 states have call predecessors, (1641), 660 states have call successors, (1641) [2022-11-20 09:36:52,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2930 states to 2930 states and 4370 transitions. [2022-11-20 09:36:52,234 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2930 states and 4370 transitions. [2022-11-20 09:36:52,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:36:52,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 09:36:52,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-11-20 09:36:52,235 INFO L87 Difference]: Start difference. First operand 2930 states and 4370 transitions. Second operand has 13 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 13 states have internal predecessors, (47), 8 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (21), 7 states have call predecessors, (21), 8 states have call successors, (21) [2022-11-20 09:36:52,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:36:52,766 INFO L93 Difference]: Finished difference Result 3324 states and 5085 transitions. [2022-11-20 09:36:52,766 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3324 states and 5085 transitions. [2022-11-20 09:36:52,792 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 210 [2022-11-20 09:36:52,821 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3324 states to 3292 states and 5023 transitions. [2022-11-20 09:36:52,821 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 850 [2022-11-20 09:36:52,822 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 855 [2022-11-20 09:36:52,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3292 states and 5023 transitions. [2022-11-20 09:36:52,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 09:36:52,823 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3292 states and 5023 transitions. [2022-11-20 09:36:52,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3292 states and 5023 transitions. [2022-11-20 09:36:52,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3292 to 3022. [2022-11-20 09:36:52,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3022 states, 1939 states have (on average 1.071170706549768) internal successors, (2077), 1932 states have internal predecessors, (2077), 693 states have call successors, (754), 357 states have call predecessors, (754), 390 states have return successors, (1684), 732 states have call predecessors, (1684), 693 states have call successors, (1684) [2022-11-20 09:36:52,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3022 states to 3022 states and 4515 transitions. [2022-11-20 09:36:52,986 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3022 states and 4515 transitions. [2022-11-20 09:36:52,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 09:36:52,987 INFO L428 stractBuchiCegarLoop]: Abstraction has 3022 states and 4515 transitions. [2022-11-20 09:36:52,987 INFO L335 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2022-11-20 09:36:52,987 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3022 states and 4515 transitions. [2022-11-20 09:36:52,999 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 184 [2022-11-20 09:36:52,999 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 09:36:52,999 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 09:36:53,000 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [15, 15, 9, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:36:53,000 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [15, 15, 12, 12, 12, 12, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:36:53,001 INFO L748 eck$LassoCheckResult]: Stem: 108770#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 108740#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; 108741#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 108769#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; 108754#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 108755#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 109201#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; 108728#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 108729#factENTRY ~n := #in~n; 109774#L25 assume ~n <= 0;#res := 1; 109772#factFINAL assume true; 109769#factEXIT >#68#return; 108785#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 108786#factENTRY ~n := #in~n; 109773#L25 assume ~n <= 0;#res := 1; 109771#factFINAL assume true; 109770#factEXIT >#70#return; 109672#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 109673#factENTRY ~n := #in~n; 109888#L25 assume ~n <= 0;#res := 1; 109764#factFINAL assume true; 109671#factEXIT >#72#return; 109669#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; 109668#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 109663#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 109664#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 109685#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; 109654#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 109655#factENTRY ~n := #in~n; 109715#L25 assume !(~n <= 0); 109712#L26 call #t~ret0 := fact(~n - 1);< 109713#factENTRY ~n := #in~n; 109760#L25 assume ~n <= 0;#res := 1; 109759#factFINAL assume true; 109711#factEXIT >#66#return; 109710#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 109660#factFINAL assume true; 109653#factEXIT >#74#return; 108787#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 108788#factENTRY ~n := #in~n; 109755#L25 assume ~n <= 0;#res := 1; 109753#factFINAL assume true; 109751#factEXIT >#76#return; 108746#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 108793#factENTRY ~n := #in~n; 109954#L25 assume !(~n <= 0); 108745#L26 call #t~ret0 := fact(~n - 1);< 108747#factENTRY ~n := #in~n; 110072#L25 assume ~n <= 0;#res := 1; 110068#factFINAL assume true; 110063#factEXIT >#66#return; 110061#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 110052#factFINAL assume true; 110049#factEXIT >#78#return; 110047#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; 110045#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 110044#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 110042#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 110041#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; 109818#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 109820#factENTRY ~n := #in~n; 109842#L25 assume !(~n <= 0); 109834#L26 call #t~ret0 := fact(~n - 1);< 109840#factENTRY ~n := #in~n; 109850#L25 assume !(~n <= 0); 109835#L26 call #t~ret0 := fact(~n - 1);< 109849#factENTRY ~n := #in~n; 109853#L25 assume ~n <= 0;#res := 1; 109851#factFINAL assume true; 109848#factEXIT >#66#return; 109847#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 109844#factFINAL assume true; 109833#factEXIT >#66#return; 109829#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 109824#factFINAL assume true; 109817#factEXIT >#74#return; 109810#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 109811#factENTRY ~n := #in~n; 109870#L25 assume ~n <= 0;#res := 1; 109869#factFINAL assume true; 109809#factEXIT >#76#return; 109678#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 109799#factENTRY ~n := #in~n; 109798#L25 assume !(~n <= 0); 109689#L26 call #t~ret0 := fact(~n - 1);< 109700#factENTRY ~n := #in~n; 109861#L25 assume !(~n <= 0); 109692#L26 call #t~ret0 := fact(~n - 1);< 109858#factENTRY ~n := #in~n; 109863#L25 assume ~n <= 0;#res := 1; 109862#factFINAL assume true; 109857#factEXIT >#66#return; 109855#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 109797#factFINAL assume true; 109791#factEXIT >#66#return; 109792#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 109911#factFINAL assume true; 109677#factEXIT >#78#return; 109670#L30-8 [2022-11-20 09:36:53,001 INFO L750 eck$LassoCheckResult]: Loop: 109670#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; 109666#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 109667#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 109659#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 109657#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; 109658#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 109684#factENTRY ~n := #in~n; 109794#L25 assume !(~n <= 0); 109690#L26 call #t~ret0 := fact(~n - 1);< 109700#factENTRY ~n := #in~n; 109861#L25 assume !(~n <= 0); 109692#L26 call #t~ret0 := fact(~n - 1);< 109858#factENTRY ~n := #in~n; 109861#L25 assume !(~n <= 0); 109692#L26 call #t~ret0 := fact(~n - 1);< 109858#factENTRY ~n := #in~n; 109861#L25 assume !(~n <= 0); 109692#L26 call #t~ret0 := fact(~n - 1);< 109858#factENTRY ~n := #in~n; 109861#L25 assume !(~n <= 0); 109692#L26 call #t~ret0 := fact(~n - 1);< 109858#factENTRY ~n := #in~n; 109861#L25 assume !(~n <= 0); 109692#L26 call #t~ret0 := fact(~n - 1);< 109858#factENTRY ~n := #in~n; 109863#L25 assume ~n <= 0;#res := 1; 109862#factFINAL assume true; 109857#factEXIT >#66#return; 109855#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 109797#factFINAL assume true; 109791#factEXIT >#66#return; 109790#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 109789#factFINAL assume true; 109787#factEXIT >#66#return; 109786#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 109782#factFINAL assume true; 109781#factEXIT >#66#return; 109779#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 109778#factFINAL assume true; 109776#factEXIT >#66#return; 109697#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 109765#factFINAL assume true; 109687#factEXIT >#66#return; 109686#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 109683#factFINAL assume true; 109675#factEXIT >#74#return; 109676#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 109709#factENTRY ~n := #in~n; 109763#L25 assume ~n <= 0;#res := 1; 109762#factFINAL assume true; 109708#factEXIT >#76#return; 109661#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 109662#factENTRY ~n := #in~n; 109780#L25 assume !(~n <= 0); 109695#L26 call #t~ret0 := fact(~n - 1);< 109768#factENTRY ~n := #in~n; 109852#L25 assume !(~n <= 0); 109691#L26 call #t~ret0 := fact(~n - 1);< 109766#factENTRY ~n := #in~n; 109864#L25 assume !(~n <= 0); 109693#L26 call #t~ret0 := fact(~n - 1);< 109788#factENTRY ~n := #in~n; 109871#L25 assume !(~n <= 0); 109688#L26 call #t~ret0 := fact(~n - 1);< 109793#factENTRY ~n := #in~n; 109861#L25 assume !(~n <= 0); 109692#L26 call #t~ret0 := fact(~n - 1);< 109858#factENTRY ~n := #in~n; 109861#L25 assume !(~n <= 0); 109692#L26 call #t~ret0 := fact(~n - 1);< 109858#factENTRY ~n := #in~n; 109863#L25 assume ~n <= 0;#res := 1; 109862#factFINAL assume true; 109857#factEXIT >#66#return; 109855#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 109797#factFINAL assume true; 109791#factEXIT >#66#return; 109790#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 109789#factFINAL assume true; 109787#factEXIT >#66#return; 109786#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 109782#factFINAL assume true; 109781#factEXIT >#66#return; 109779#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 109778#factFINAL assume true; 109776#factEXIT >#66#return; 109697#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 109765#factFINAL assume true; 109687#factEXIT >#66#return; 109686#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 109683#factFINAL assume true; 109675#factEXIT >#78#return; 109670#L30-8 [2022-11-20 09:36:53,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:53,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1326926298, now seen corresponding path program 6 times [2022-11-20 09:36:53,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:53,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053252926] [2022-11-20 09:36:53,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:53,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:53,008 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:36:53,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1022327514] [2022-11-20 09:36:53,009 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-20 09:36:53,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:36:53,009 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:53,010 INFO L229 MonitoredProcess]: Starting monitored process 202 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:36:53,039 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (202)] Waiting until timeout for monitored process [2022-11-20 09:36:53,128 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-11-20 09:36:53,128 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-20 09:36:53,128 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:36:53,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:36:53,175 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:36:53,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:53,176 INFO L85 PathProgramCache]: Analyzing trace with hash 2078612212, now seen corresponding path program 7 times [2022-11-20 09:36:53,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:53,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099305651] [2022-11-20 09:36:53,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:53,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:53,181 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:36:53,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2118874525] [2022-11-20 09:36:53,181 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 09:36:53,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:36:53,182 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:53,183 INFO L229 MonitoredProcess]: Starting monitored process 203 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:36:53,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (203)] Waiting until timeout for monitored process [2022-11-20 09:36:53,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:36:53,282 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:36:53,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:36:53,331 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:36:53,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:53,332 INFO L85 PathProgramCache]: Analyzing trace with hash 106246041, now seen corresponding path program 7 times [2022-11-20 09:36:53,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:53,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964435062] [2022-11-20 09:36:53,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:53,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:53,341 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:36:53,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [483374808] [2022-11-20 09:36:53,341 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 09:36:53,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:36:53,342 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:53,345 INFO L229 MonitoredProcess]: Starting monitored process 204 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:36:53,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (204)] Waiting until timeout for monitored process [2022-11-20 09:36:53,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:53,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-20 09:36:53,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:53,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 1130 proven. 45 refuted. 0 times theorem prover too weak. 897 trivial. 0 not checked. [2022-11-20 09:36:53,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:36:54,281 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 282 proven. 198 refuted. 0 times theorem prover too weak. 1592 trivial. 0 not checked. [2022-11-20 09:36:54,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:36:54,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964435062] [2022-11-20 09:36:54,282 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 09:36:54,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483374808] [2022-11-20 09:36:54,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483374808] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:36:54,282 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:36:54,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 16 [2022-11-20 09:36:54,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755456006] [2022-11-20 09:36:54,283 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:36:55,888 INFO L210 LassoAnalysis]: Preferences: [2022-11-20 09:36:55,888 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-20 09:36:55,888 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-20 09:36:55,888 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-20 09:36:55,888 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-20 09:36:55,888 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:55,888 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-20 09:36:55,888 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-20 09:36:55,888 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration25_Loop [2022-11-20 09:36:55,888 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-20 09:36:55,888 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-20 09:36:55,890 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:55,897 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:55,942 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:55,944 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:55,946 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:56,153 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-20 09:36:56,153 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-20 09:36:56,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:56,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:56,155 INFO L229 MonitoredProcess]: Starting monitored process 205 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:56,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (205)] Waiting until timeout for monitored process [2022-11-20 09:36:56,157 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-20 09:36:56,157 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 09:36:56,168 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-20 09:36:56,169 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: [] [2022-11-20 09:36:56,171 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (205)] Ended with exit code 0 [2022-11-20 09:36:56,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:56,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:56,172 INFO L229 MonitoredProcess]: Starting monitored process 206 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:56,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (206)] Waiting until timeout for monitored process [2022-11-20 09:36:56,175 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-20 09:36:56,175 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 09:36:56,192 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (206)] Ended with exit code 0 [2022-11-20 09:36:56,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:56,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:56,193 INFO L229 MonitoredProcess]: Starting monitored process 207 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:56,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (207)] Waiting until timeout for monitored process [2022-11-20 09:36:56,196 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-20 09:36:56,196 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 09:36:56,220 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-20 09:36:56,223 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (207)] Ended with exit code 0 [2022-11-20 09:36:56,223 INFO L210 LassoAnalysis]: Preferences: [2022-11-20 09:36:56,223 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-20 09:36:56,223 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-20 09:36:56,223 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-20 09:36:56,223 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-20 09:36:56,223 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 09:36:56,224 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-20 09:36:56,224 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-20 09:36:56,224 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration25_Loop [2022-11-20 09:36:56,224 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-20 09:36:56,224 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-20 09:36:56,226 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:56,228 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:56,229 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:56,270 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 09:36:56,272 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true WARNING: YOUR LOGFILE WAS TOO LONG, SOME LINES IN THE MIDDLE WERE REMOVED. [2022-11-20 09:43:08,689 INFO L750 eck$LassoCheckResult]: Loop: 801514#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; 802243#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 802213#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 802214#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 802206#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 802207#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 802200#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 802201#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; 802189#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 802190#factENTRY ~n := #in~n; 802549#L25 assume !(~n <= 0); 801423#L26 call #t~ret0 := fact(~n - 1);< 801487#factENTRY ~n := #in~n; 801484#L25 assume !(~n <= 0); 801202#L26 call #t~ret0 := fact(~n - 1);< 801424#factENTRY ~n := #in~n; 801463#L25 assume !(~n <= 0); 801198#L26 call #t~ret0 := fact(~n - 1);< 801427#factENTRY ~n := #in~n; 801455#L25 assume !(~n <= 0); 801200#L26 call #t~ret0 := fact(~n - 1);< 801439#factENTRY ~n := #in~n; 801450#L25 assume !(~n <= 0); 801201#L26 call #t~ret0 := fact(~n - 1);< 801449#factENTRY ~n := #in~n; 801452#L25 assume ~n <= 0;#res := 1; 801451#factFINAL assume true; 801448#factEXIT >#66#return; 801446#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 801444#factFINAL assume true; 801438#factEXIT >#66#return; 801436#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 801434#factFINAL assume true; 801426#factEXIT >#66#return; 801425#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 801421#factFINAL assume true; 801197#factEXIT >#66#return; 801206#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 802548#factFINAL assume true; 802544#factEXIT >#66#return; 802541#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 802538#factFINAL assume true; 802536#factEXIT >#68#return; 800996#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 801006#factENTRY ~n := #in~n; 801116#L25 assume ~n <= 0;#res := 1; 801014#factFINAL assume true; 800987#factEXIT >#70#return; 801005#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 801315#factENTRY ~n := #in~n; 801313#L25 assume !(~n <= 0); 801305#L26 call #t~ret0 := fact(~n - 1);< 801307#factENTRY ~n := #in~n; 801306#L25 assume !(~n <= 0); 801103#L26 call #t~ret0 := fact(~n - 1);< 801301#factENTRY ~n := #in~n; 801299#L25 assume !(~n <= 0); 801104#L26 call #t~ret0 := fact(~n - 1);< 801296#factENTRY ~n := #in~n; 801294#L25 assume !(~n <= 0); 801178#L26 call #t~ret0 := fact(~n - 1);< 801268#factENTRY ~n := #in~n; 801397#L25 assume !(~n <= 0); 801266#L26 call #t~ret0 := fact(~n - 1);< 801394#factENTRY ~n := #in~n; 801396#L25 assume !(~n <= 0); 801392#L26 call #t~ret0 := fact(~n - 1);< 801395#factENTRY ~n := #in~n; 801401#L25 assume ~n <= 0;#res := 1; 801399#factFINAL assume true; 801391#factEXIT >#66#return; 801390#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 801290#factFINAL assume true; 801264#factEXIT >#66#return; 801267#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 801361#factFINAL assume true; 801176#factEXIT >#66#return; 801175#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 801172#factFINAL assume true; 801101#factEXIT >#66#return; 801110#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 802566#factFINAL assume true; 802564#factEXIT >#66#return; 802563#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 802562#factFINAL assume true; 802559#factEXIT >#66#return; 802558#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 802556#factFINAL assume true; 802553#factEXIT >#72#return; 802535#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; 804814#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 804813#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 804812#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 804713#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; 800592#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 800595#factENTRY ~n := #in~n; 801461#L25 assume !(~n <= 0); 800564#L26 call #t~ret0 := fact(~n - 1);< 800597#factENTRY ~n := #in~n; 802272#L25 assume !(~n <= 0); 800568#L26 call #t~ret0 := fact(~n - 1);< 800757#factENTRY ~n := #in~n; 801410#L25 assume !(~n <= 0); 800562#L26 call #t~ret0 := fact(~n - 1);< 800773#factENTRY ~n := #in~n; 802150#L25 assume !(~n <= 0); 800635#L26 call #t~ret0 := fact(~n - 1);< 800641#factENTRY ~n := #in~n; 800639#L25 assume !(~n <= 0); 800605#L26 call #t~ret0 := fact(~n - 1);< 800633#factENTRY ~n := #in~n; 800620#L25 assume ~n <= 0;#res := 1; 800619#factFINAL assume true; 800603#factEXIT >#66#return; 800610#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 800848#factFINAL assume true; 800827#factEXIT >#66#return; 800826#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 800788#factFINAL assume true; 800766#factEXIT >#66#return; 800763#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 800756#factFINAL assume true; 800745#factEXIT >#66#return; 800601#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 800596#factFINAL assume true; 800542#factEXIT >#66#return; 800574#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 800598#factFINAL assume true; 800580#factEXIT >#68#return; 800594#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 800934#factENTRY ~n := #in~n; 801028#L25 assume !(~n <= 0); 801016#L26 call #t~ret0 := fact(~n - 1);< 801021#factENTRY ~n := #in~n; 800666#L25 assume ~n <= 0;#res := 1; 801119#factFINAL assume true; 801015#factEXIT >#66#return; 801013#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 800970#factFINAL assume true; 800907#factEXIT >#70#return; 800810#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 800969#factENTRY ~n := #in~n; 802185#L25 assume !(~n <= 0); 800545#L26 call #t~ret0 := fact(~n - 1);< 800773#factENTRY ~n := #in~n; 802150#L25 assume !(~n <= 0); 800635#L26 call #t~ret0 := fact(~n - 1);< 800641#factENTRY ~n := #in~n; 800639#L25 assume !(~n <= 0); 800605#L26 call #t~ret0 := fact(~n - 1);< 800633#factENTRY ~n := #in~n; 800630#L25 assume !(~n <= 0); 800606#L26 call #t~ret0 := fact(~n - 1);< 800622#factENTRY ~n := #in~n; 800623#L25 assume !(~n <= 0); 800607#L26 call #t~ret0 := fact(~n - 1);< 800618#factENTRY ~n := #in~n; 800620#L25 assume ~n <= 0;#res := 1; 800619#factFINAL assume true; 800603#factEXIT >#66#return; 800610#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 800848#factFINAL assume true; 800827#factEXIT >#66#return; 800826#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 800788#factFINAL assume true; 800766#factEXIT >#66#return; 800763#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 800756#factFINAL assume true; 800745#factEXIT >#66#return; 800601#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 800596#factFINAL assume true; 800542#factEXIT >#66#return; 800572#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 802498#factFINAL assume true; 802494#factEXIT >#72#return; 800887#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; 803207#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 803206#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 803205#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 803203#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; 800590#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 800595#factENTRY ~n := #in~n; 801461#L25 assume !(~n <= 0); 800564#L26 call #t~ret0 := fact(~n - 1);< 800597#factENTRY ~n := #in~n; 802272#L25 assume !(~n <= 0); 800568#L26 call #t~ret0 := fact(~n - 1);< 800757#factENTRY ~n := #in~n; 801410#L25 assume !(~n <= 0); 800562#L26 call #t~ret0 := fact(~n - 1);< 800773#factENTRY ~n := #in~n; 802150#L25 assume !(~n <= 0); 800635#L26 call #t~ret0 := fact(~n - 1);< 800641#factENTRY ~n := #in~n; 800639#L25 assume !(~n <= 0); 800605#L26 call #t~ret0 := fact(~n - 1);< 800633#factENTRY ~n := #in~n; 800620#L25 assume ~n <= 0;#res := 1; 800619#factFINAL assume true; 800603#factEXIT >#66#return; 800610#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 800848#factFINAL assume true; 800827#factEXIT >#66#return; 800826#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 800788#factFINAL assume true; 800766#factEXIT >#66#return; 800763#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 800756#factFINAL assume true; 800745#factEXIT >#66#return; 800601#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 800596#factFINAL assume true; 800542#factEXIT >#66#return; 800574#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 800598#factFINAL assume true; 800580#factEXIT >#68#return; 800491#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 800539#factENTRY ~n := #in~n; 800579#L25 assume !(~n <= 0); 800546#L26 call #t~ret0 := fact(~n - 1);< 800790#factENTRY ~n := #in~n; 801011#L25 assume !(~n <= 0); 800555#L26 call #t~ret0 := fact(~n - 1);< 800615#factENTRY ~n := #in~n; 800620#L25 assume ~n <= 0;#res := 1; 800619#factFINAL assume true; 800603#factEXIT >#66#return; 800610#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 800848#factFINAL assume true; 800827#factEXIT >#66#return; 800829#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 800843#factFINAL assume true; 800812#factEXIT >#70#return; 800807#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 800969#factENTRY ~n := #in~n; 802185#L25 assume !(~n <= 0); 800545#L26 call #t~ret0 := fact(~n - 1);< 800773#factENTRY ~n := #in~n; 802150#L25 assume !(~n <= 0); 800635#L26 call #t~ret0 := fact(~n - 1);< 800641#factENTRY ~n := #in~n; 800639#L25 assume !(~n <= 0); 800605#L26 call #t~ret0 := fact(~n - 1);< 800633#factENTRY ~n := #in~n; 800630#L25 assume !(~n <= 0); 800606#L26 call #t~ret0 := fact(~n - 1);< 800622#factENTRY ~n := #in~n; 800623#L25 assume !(~n <= 0); 800607#L26 call #t~ret0 := fact(~n - 1);< 800618#factENTRY ~n := #in~n; 800620#L25 assume ~n <= 0;#res := 1; 800619#factFINAL assume true; 800603#factEXIT >#66#return; 800610#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 800848#factFINAL assume true; 800827#factEXIT >#66#return; 800826#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 800788#factFINAL assume true; 800766#factEXIT >#66#return; 800763#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 800756#factFINAL assume true; 800745#factEXIT >#66#return; 800601#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 800596#factFINAL assume true; 800542#factEXIT >#66#return; 800572#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 802498#factFINAL assume true; 802494#factEXIT >#72#return; 800902#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; 803120#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 803118#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 803117#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 803116#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; 800589#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 800595#factENTRY ~n := #in~n; 801461#L25 assume !(~n <= 0); 800564#L26 call #t~ret0 := fact(~n - 1);< 800597#factENTRY ~n := #in~n; 802272#L25 assume !(~n <= 0); 800568#L26 call #t~ret0 := fact(~n - 1);< 800757#factENTRY ~n := #in~n; 801410#L25 assume !(~n <= 0); 800562#L26 call #t~ret0 := fact(~n - 1);< 800773#factENTRY ~n := #in~n; 802150#L25 assume !(~n <= 0); 800635#L26 call #t~ret0 := fact(~n - 1);< 800641#factENTRY ~n := #in~n; 800639#L25 assume !(~n <= 0); 800605#L26 call #t~ret0 := fact(~n - 1);< 800633#factENTRY ~n := #in~n; 800620#L25 assume ~n <= 0;#res := 1; 800619#factFINAL assume true; 800603#factEXIT >#66#return; 800610#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 800848#factFINAL assume true; 800827#factEXIT >#66#return; 800826#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 800788#factFINAL assume true; 800766#factEXIT >#66#return; 800763#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 800756#factFINAL assume true; 800745#factEXIT >#66#return; 800601#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 800596#factFINAL assume true; 800542#factEXIT >#66#return; 800574#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 800598#factFINAL assume true; 800580#factEXIT >#68#return; 800497#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 800539#factENTRY ~n := #in~n; 800579#L25 assume !(~n <= 0); 800546#L26 call #t~ret0 := fact(~n - 1);< 800790#factENTRY ~n := #in~n; 801011#L25 assume !(~n <= 0); 800555#L26 call #t~ret0 := fact(~n - 1);< 800615#factENTRY ~n := #in~n; 801011#L25 assume !(~n <= 0); 800555#L26 call #t~ret0 := fact(~n - 1);< 800615#factENTRY ~n := #in~n; 801011#L25 assume !(~n <= 0); 800555#L26 call #t~ret0 := fact(~n - 1);< 800615#factENTRY ~n := #in~n; 801011#L25 assume !(~n <= 0); 800555#L26 call #t~ret0 := fact(~n - 1);< 800615#factENTRY ~n := #in~n; 800620#L25 assume ~n <= 0;#res := 1; 800619#factFINAL assume true; 800603#factEXIT >#66#return; 800610#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 800848#factFINAL assume true; 800827#factEXIT >#66#return; 800826#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 800788#factFINAL assume true; 800766#factEXIT >#66#return; 800763#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 800756#factFINAL assume true; 800745#factEXIT >#66#return; 800601#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 800596#factFINAL assume true; 800542#factEXIT >#66#return; 800541#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 800540#factFINAL assume true; 800484#factEXIT >#70#return; 800445#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 800985#factENTRY ~n := #in~n; 801408#L25 assume !(~n <= 0); 800563#L26 call #t~ret0 := fact(~n - 1);< 801208#factENTRY ~n := #in~n; 800656#L25 assume !(~n <= 0); 800609#L26 call #t~ret0 := fact(~n - 1);< 800642#factENTRY ~n := #in~n; 800620#L25 assume ~n <= 0;#res := 1; 800619#factFINAL assume true; 800603#factEXIT >#66#return; 800610#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 800848#factFINAL assume true; 800827#factEXIT >#66#return; 800830#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 800811#factFINAL assume true; 800775#factEXIT >#72#return; 800781#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; 803114#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 803113#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 803111#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 803108#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; 800583#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 800595#factENTRY ~n := #in~n; 801461#L25 assume !(~n <= 0); 800564#L26 call #t~ret0 := fact(~n - 1);< 800597#factENTRY ~n := #in~n; 802272#L25 assume !(~n <= 0); 800568#L26 call #t~ret0 := fact(~n - 1);< 800757#factENTRY ~n := #in~n; 801410#L25 assume !(~n <= 0); 800562#L26 call #t~ret0 := fact(~n - 1);< 800773#factENTRY ~n := #in~n; 802150#L25 assume !(~n <= 0); 800635#L26 call #t~ret0 := fact(~n - 1);< 800641#factENTRY ~n := #in~n; 800639#L25 assume !(~n <= 0); 800605#L26 call #t~ret0 := fact(~n - 1);< 800633#factENTRY ~n := #in~n; 800620#L25 assume ~n <= 0;#res := 1; 800619#factFINAL assume true; 800603#factEXIT >#66#return; 800610#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 800848#factFINAL assume true; 800827#factEXIT >#66#return; 800826#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 800788#factFINAL assume true; 800766#factEXIT >#66#return; 800763#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 800756#factFINAL assume true; 800745#factEXIT >#66#return; 800601#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 800596#factFINAL assume true; 800542#factEXIT >#66#return; 800574#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 800598#factFINAL assume true; 800580#factEXIT >#68#return; 800535#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 800539#factENTRY ~n := #in~n; 800579#L25 assume !(~n <= 0); 800546#L26 call #t~ret0 := fact(~n - 1);< 800790#factENTRY ~n := #in~n; 801011#L25 assume !(~n <= 0); 800555#L26 call #t~ret0 := fact(~n - 1);< 800615#factENTRY ~n := #in~n; 801011#L25 assume !(~n <= 0); 800555#L26 call #t~ret0 := fact(~n - 1);< 800615#factENTRY ~n := #in~n; 801011#L25 assume !(~n <= 0); 800555#L26 call #t~ret0 := fact(~n - 1);< 800615#factENTRY ~n := #in~n; 800620#L25 assume ~n <= 0;#res := 1; 800619#factFINAL assume true; 800603#factEXIT >#66#return; 800610#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 800848#factFINAL assume true; 800827#factEXIT >#66#return; 800826#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 800788#factFINAL assume true; 800766#factEXIT >#66#return; 800763#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 800756#factFINAL assume true; 800745#factEXIT >#66#return; 800751#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 801097#factFINAL assume true; 801094#factEXIT >#70#return; 800700#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 800984#factENTRY ~n := #in~n; 801407#L25 assume !(~n <= 0); 800563#L26 call #t~ret0 := fact(~n - 1);< 801208#factENTRY ~n := #in~n; 800666#L25 assume ~n <= 0;#res := 1; 801119#factFINAL assume true; 801015#factEXIT >#66#return; 801019#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 801126#factFINAL assume true; 800685#factEXIT >#72#return; 800711#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; 801467#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 801462#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 801458#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 801457#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; 800586#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 800595#factENTRY ~n := #in~n; 801461#L25 assume !(~n <= 0); 800564#L26 call #t~ret0 := fact(~n - 1);< 800597#factENTRY ~n := #in~n; 802272#L25 assume !(~n <= 0); 800568#L26 call #t~ret0 := fact(~n - 1);< 800757#factENTRY ~n := #in~n; 801410#L25 assume !(~n <= 0); 800562#L26 call #t~ret0 := fact(~n - 1);< 800773#factENTRY ~n := #in~n; 802150#L25 assume !(~n <= 0); 800635#L26 call #t~ret0 := fact(~n - 1);< 800641#factENTRY ~n := #in~n; 800639#L25 assume !(~n <= 0); 800605#L26 call #t~ret0 := fact(~n - 1);< 800633#factENTRY ~n := #in~n; 800620#L25 assume ~n <= 0;#res := 1; 800619#factFINAL assume true; 800603#factEXIT >#66#return; 800610#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 800848#factFINAL assume true; 800827#factEXIT >#66#return; 800826#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 800788#factFINAL assume true; 800766#factEXIT >#66#return; 800763#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 800756#factFINAL assume true; 800745#factEXIT >#66#return; 800601#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 800596#factFINAL assume true; 800542#factEXIT >#66#return; 800574#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 800598#factFINAL assume true; 800580#factEXIT >#68#return; 800519#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 800539#factENTRY ~n := #in~n; 800579#L25 assume !(~n <= 0); 800546#L26 call #t~ret0 := fact(~n - 1);< 800790#factENTRY ~n := #in~n; 801011#L25 assume !(~n <= 0); 800555#L26 call #t~ret0 := fact(~n - 1);< 800615#factENTRY ~n := #in~n; 801011#L25 assume !(~n <= 0); 800555#L26 call #t~ret0 := fact(~n - 1);< 800615#factENTRY ~n := #in~n; 801011#L25 assume !(~n <= 0); 800555#L26 call #t~ret0 := fact(~n - 1);< 800615#factENTRY ~n := #in~n; 801011#L25 assume !(~n <= 0); 800555#L26 call #t~ret0 := fact(~n - 1);< 800615#factENTRY ~n := #in~n; 800620#L25 assume ~n <= 0;#res := 1; 800619#factFINAL assume true; 800603#factEXIT >#66#return; 800610#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 800848#factFINAL assume true; 800827#factEXIT >#66#return; 800826#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 800788#factFINAL assume true; 800766#factEXIT >#66#return; 800763#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 800756#factFINAL assume true; 800745#factEXIT >#66#return; 800601#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 800596#factFINAL assume true; 800542#factEXIT >#66#return; 800541#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 800540#factFINAL assume true; 800484#factEXIT >#70#return; 800469#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 800481#factENTRY ~n := #in~n; 800483#L25 assume ~n <= 0;#res := 1; 800482#factFINAL assume true; 800440#factEXIT >#72#return; 800477#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; 802360#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 802358#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 802356#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 802355#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; 801442#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 802353#factENTRY ~n := #in~n; 802483#L25 assume !(~n <= 0); 802385#L26 call #t~ret0 := fact(~n - 1);< 802481#factENTRY ~n := #in~n; 802478#L25 assume !(~n <= 0); 802374#L26 call #t~ret0 := fact(~n - 1);< 802386#factENTRY ~n := #in~n; 802519#L25 assume !(~n <= 0); 802376#L26 call #t~ret0 := fact(~n - 1);< 802399#factENTRY ~n := #in~n; 802448#L25 assume !(~n <= 0); 802373#L26 call #t~ret0 := fact(~n - 1);< 802415#factENTRY ~n := #in~n; 802426#L25 assume !(~n <= 0); 802369#L26 call #t~ret0 := fact(~n - 1);< 802425#factENTRY ~n := #in~n; 802428#L25 assume ~n <= 0;#res := 1; 802427#factFINAL assume true; 802424#factEXIT >#66#return; 802422#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 802421#factFINAL assume true; 802414#factEXIT >#66#return; 802413#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 802409#factFINAL assume true; 802397#factEXIT >#66#return; 802389#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 802383#factFINAL assume true; 802368#factEXIT >#66#return; 802377#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 802508#factFINAL assume true; 802507#factEXIT >#66#return; 802497#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 802496#factFINAL assume true; 802351#factEXIT >#74#return; 801579#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 802349#factENTRY ~n := #in~n; 804758#L25 assume !(~n <= 0); 800348#L26 call #t~ret0 := fact(~n - 1);< 801573#factENTRY ~n := #in~n; 801568#L25 assume !(~n <= 0); 800362#L26 call #t~ret0 := fact(~n - 1);< 801549#factENTRY ~n := #in~n; 801570#L25 assume !(~n <= 0); 800361#L26 call #t~ret0 := fact(~n - 1);< 801564#factENTRY ~n := #in~n; 801570#L25 assume !(~n <= 0); 800361#L26 call #t~ret0 := fact(~n - 1);< 801564#factENTRY ~n := #in~n; 801570#L25 assume !(~n <= 0); 800361#L26 call #t~ret0 := fact(~n - 1);< 801564#factENTRY ~n := #in~n; 801572#L25 assume ~n <= 0;#res := 1; 801567#factFINAL assume true; 801560#factEXIT >#66#return; 801555#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 801548#factFINAL assume true; 801530#factEXIT >#66#return; 801541#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 801818#factFINAL assume true; 801814#factEXIT >#66#return; 801812#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 801807#factFINAL assume true; 801796#factEXIT >#66#return; 801797#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 800346#factFINAL assume true; 800370#factEXIT >#66#return; 801748#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 802677#factFINAL assume true; 802348#factEXIT >#76#return; 802250#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 802263#factENTRY ~n := #in~n; 802327#L25 assume !(~n <= 0); 802323#L26 call #t~ret0 := fact(~n - 1);< 802326#factENTRY ~n := #in~n; 802439#L25 assume ~n <= 0;#res := 1; 802437#factFINAL assume true; 802322#factEXIT >#66#return; 802318#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 802316#factFINAL assume true; 802248#factEXIT >#78#return; 801514#L30-8 [2022-11-20 09:43:08,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:43:08,690 INFO L85 PathProgramCache]: Analyzing trace with hash 478774201, now seen corresponding path program 45 times [2022-11-20 09:43:08,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:43:08,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639214712] [2022-11-20 09:43:08,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:43:08,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:43:08,729 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:43:08,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [802865843] [2022-11-20 09:43:08,729 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 09:43:08,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:43:08,730 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:43:08,738 INFO L229 MonitoredProcess]: Starting monitored process 353 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:43:08,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (353)] Waiting until timeout for monitored process [2022-11-20 09:43:09,546 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-20 09:43:09,546 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:43:09,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 09:43:09,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:43:09,730 INFO L134 CoverageAnalysis]: Checked inductivity of 39137 backedges. 7183 proven. 48 refuted. 0 times theorem prover too weak. 31906 trivial. 0 not checked. [2022-11-20 09:43:09,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:43:10,501 INFO L134 CoverageAnalysis]: Checked inductivity of 39137 backedges. 391 proven. 48 refuted. 0 times theorem prover too weak. 38698 trivial. 0 not checked. [2022-11-20 09:43:10,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:43:10,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639214712] [2022-11-20 09:43:10,502 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 09:43:10,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802865843] [2022-11-20 09:43:10,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802865843] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:43:10,502 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:43:10,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2022-11-20 09:43:10,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477838685] [2022-11-20 09:43:10,503 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:43:10,503 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-20 09:43:10,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:43:10,504 INFO L85 PathProgramCache]: Analyzing trace with hash 610945067, now seen corresponding path program 40 times [2022-11-20 09:43:10,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:43:10,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626086978] [2022-11-20 09:43:10,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:43:10,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:43:10,522 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:43:10,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [233843177] [2022-11-20 09:43:10,523 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 09:43:10,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:43:10,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:43:10,526 INFO L229 MonitoredProcess]: Starting monitored process 354 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:43:10,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (354)] Waiting until timeout for monitored process [2022-11-20 09:43:11,306 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 09:43:11,307 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:43:11,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 1289 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-20 09:43:11,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:43:11,627 INFO L134 CoverageAnalysis]: Checked inductivity of 25009 backedges. 6271 proven. 255 refuted. 0 times theorem prover too weak. 18483 trivial. 0 not checked. [2022-11-20 09:43:11,627 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:43:15,368 INFO L134 CoverageAnalysis]: Checked inductivity of 25009 backedges. 115 proven. 4781 refuted. 0 times theorem prover too weak. 20113 trivial. 0 not checked. [2022-11-20 09:43:15,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:43:15,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626086978] [2022-11-20 09:43:15,369 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 09:43:15,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233843177] [2022-11-20 09:43:15,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233843177] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:43:15,369 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:43:15,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 29] total 32 [2022-11-20 09:43:15,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818481496] [2022-11-20 09:43:15,370 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:43:15,371 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 09:43:15,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:43:15,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-20 09:43:15,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=845, Unknown=0, NotChecked=0, Total=992 [2022-11-20 09:43:15,372 INFO L87 Difference]: Start difference. First operand 5510 states and 8689 transitions. cyclomatic complexity: 3240 Second operand has 32 states, 29 states have (on average 2.6551724137931036) internal successors, (77), 30 states have internal predecessors, (77), 18 states have call successors, (32), 2 states have call predecessors, (32), 14 states have return successors, (41), 15 states have call predecessors, (41), 18 states have call successors, (41) [2022-11-20 09:43:17,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:43:17,798 INFO L93 Difference]: Finished difference Result 6396 states and 10056 transitions. [2022-11-20 09:43:17,798 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6396 states and 10056 transitions. [2022-11-20 09:43:17,839 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 630 [2022-11-20 09:43:17,889 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6396 states to 6395 states and 10054 transitions. [2022-11-20 09:43:17,889 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 580 [2022-11-20 09:43:17,890 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 580 [2022-11-20 09:43:17,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6395 states and 10054 transitions. [2022-11-20 09:43:17,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 09:43:17,891 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6395 states and 10054 transitions. [2022-11-20 09:43:17,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6395 states and 10054 transitions. [2022-11-20 09:43:17,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6395 to 5501. [2022-11-20 09:43:17,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5501 states, 3417 states have (on average 1.0438981562774363) internal successors, (3567), 3393 states have internal predecessors, (3567), 1472 states have call successors, (1518), 708 states have call predecessors, (1518), 612 states have return successors, (3585), 1399 states have call predecessors, (3585), 1472 states have call successors, (3585) [2022-11-20 09:43:18,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5501 states to 5501 states and 8670 transitions. [2022-11-20 09:43:18,003 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5501 states and 8670 transitions. [2022-11-20 09:43:18,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-20 09:43:18,004 INFO L428 stractBuchiCegarLoop]: Abstraction has 5501 states and 8670 transitions. [2022-11-20 09:43:18,004 INFO L335 stractBuchiCegarLoop]: ======== Iteration 68 ============ [2022-11-20 09:43:18,004 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5501 states and 8670 transitions. [2022-11-20 09:43:18,021 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 544 [2022-11-20 09:43:18,021 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 09:43:18,021 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 09:43:18,025 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [127, 127, 76, 76, 76, 76, 51, 17, 16, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 7, 7, 7, 7, 7, 6, 6, 4, 3, 3, 1, 1, 1, 1] [2022-11-20 09:43:18,025 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [95, 95, 74, 74, 74, 74, 21, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:43:18,025 INFO L748 eck$LassoCheckResult]: Stem: 820891#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 820862#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; 820863#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 820890#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; 820876#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 820877#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 825177#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; 820855#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 820856#factENTRY ~n := #in~n; 825183#L25 assume ~n <= 0;#res := 1; 825180#factFINAL assume true; 825160#factEXIT >#68#return; 820904#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 820905#factENTRY ~n := #in~n; 825057#L25 assume ~n <= 0;#res := 1; 825055#factFINAL assume true; 825054#factEXIT >#70#return; 820830#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 820831#factENTRY ~n := #in~n; 825223#L25 assume ~n <= 0;#res := 1; 825221#factFINAL assume true; 825219#factEXIT >#72#return; 820883#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; 820884#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 820886#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 825732#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 820893#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; 820894#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 825740#factENTRY ~n := #in~n; 825753#L25 assume !(~n <= 0); 825751#L26 call #t~ret0 := fact(~n - 1);< 825752#factENTRY ~n := #in~n; 825761#L25 assume ~n <= 0;#res := 1; 825759#factFINAL assume true; 825750#factEXIT >#66#return; 825748#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 825747#factFINAL assume true; 825739#factEXIT >#74#return; 825736#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 825737#factENTRY ~n := #in~n; 825745#L25 assume ~n <= 0;#res := 1; 825744#factFINAL assume true; 825735#factEXIT >#76#return; 825727#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 825731#factENTRY ~n := #in~n; 825762#L25 assume !(~n <= 0); 825742#L26 call #t~ret0 := fact(~n - 1);< 825743#factENTRY ~n := #in~n; 825757#L25 assume ~n <= 0;#res := 1; 825755#factFINAL assume true; 825741#factEXIT >#66#return; 825738#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 825733#factFINAL assume true; 825726#factEXIT >#78#return; 825722#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; 825723#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 825758#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 825756#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 825754#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; 825678#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 825681#factENTRY ~n := #in~n; 825699#L25 assume !(~n <= 0); 825692#L26 call #t~ret0 := fact(~n - 1);< 825698#factENTRY ~n := #in~n; 825708#L25 assume !(~n <= 0); 825695#L26 call #t~ret0 := fact(~n - 1);< 825706#factENTRY ~n := #in~n; 825709#L25 assume ~n <= 0;#res := 1; 825707#factFINAL assume true; 825705#factEXIT >#66#return; 825704#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 825700#factFINAL assume true; 825691#factEXIT >#66#return; 825690#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 825686#factFINAL assume true; 825674#factEXIT >#74#return; 825680#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 825666#factENTRY ~n := #in~n; 825874#L25 assume ~n <= 0;#res := 1; 825873#factFINAL assume true; 825866#factEXIT >#76#return; 825860#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 825863#factENTRY ~n := #in~n; 825880#L25 assume !(~n <= 0); 825830#L26 call #t~ret0 := fact(~n - 1);< 825879#factENTRY ~n := #in~n; 825895#L25 assume !(~n <= 0); 825828#L26 call #t~ret0 := fact(~n - 1);< 825890#factENTRY ~n := #in~n; 825894#L25 assume ~n <= 0;#res := 1; 825892#factFINAL assume true; 825889#factEXIT >#66#return; 825888#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 825886#factFINAL assume true; 825877#factEXIT >#66#return; 825867#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 825865#factFINAL assume true; 825857#factEXIT >#78#return; 825854#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; 825850#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 825846#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 825843#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 825840#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; 825343#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 825363#factENTRY ~n := #in~n; 825364#L25 assume !(~n <= 0); 825353#L26 call #t~ret0 := fact(~n - 1);< 825354#factENTRY ~n := #in~n; 825531#L25 assume !(~n <= 0); 825356#L26 call #t~ret0 := fact(~n - 1);< 825384#factENTRY ~n := #in~n; 825531#L25 assume !(~n <= 0); 825356#L26 call #t~ret0 := fact(~n - 1);< 825384#factENTRY ~n := #in~n; 825538#L25 assume ~n <= 0;#res := 1; 825539#factFINAL assume true; 825532#factEXIT >#66#return; 825529#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 825530#factFINAL assume true; 825381#factEXIT >#66#return; 825382#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 825355#factFINAL assume true; 825357#factEXIT >#66#return; 825550#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 825549#factFINAL assume true; 825433#factEXIT >#74#return; 825412#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 825413#factENTRY ~n := #in~n; 825431#L25 assume ~n <= 0;#res := 1; 825430#factFINAL assume true; 825411#factEXIT >#76#return; 820896#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 825406#factENTRY ~n := #in~n; 825404#L25 assume !(~n <= 0); 825374#L26 call #t~ret0 := fact(~n - 1);< 825403#factENTRY ~n := #in~n; 825449#L25 assume !(~n <= 0); 825369#L26 call #t~ret0 := fact(~n - 1);< 825386#factENTRY ~n := #in~n; 825448#L25 assume !(~n <= 0); 825367#L26 call #t~ret0 := fact(~n - 1);< 825442#factENTRY ~n := #in~n; 825451#L25 assume ~n <= 0;#res := 1; 825450#factFINAL assume true; 825441#factEXIT >#66#return; 825439#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 825437#factFINAL assume true; 825436#factEXIT >#66#return; 825435#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 825434#factFINAL assume true; 825416#factEXIT >#66#return; 820895#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 820897#factFINAL assume true; 825499#factEXIT >#78#return; 821814#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; 821813#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 821811#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 821809#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 821807#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 821806#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 821805#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 821759#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; 821750#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 821751#factENTRY ~n := #in~n; 821767#L25 assume !(~n <= 0); 821764#L26 call #t~ret0 := fact(~n - 1);< 821765#factENTRY ~n := #in~n; 821768#L25 assume ~n <= 0;#res := 1; 821766#factFINAL assume true; 821763#factEXIT >#66#return; 821761#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 821758#factFINAL assume true; 821748#factEXIT >#68#return; 821744#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 821745#factENTRY ~n := #in~n; 821756#L25 assume ~n <= 0;#res := 1; 821747#factFINAL assume true; 821742#factEXIT >#70#return; 821739#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 821740#factENTRY ~n := #in~n; 821757#L25 assume !(~n <= 0); 821754#L26 call #t~ret0 := fact(~n - 1);< 821755#factENTRY ~n := #in~n; 821762#L25 assume ~n <= 0;#res := 1; 821760#factFINAL assume true; 821753#factEXIT >#66#return; 821746#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 821741#factFINAL assume true; 821737#factEXIT >#72#return; 821735#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; 821732#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 821728#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 821719#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 821716#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; 821713#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 821714#factENTRY ~n := #in~n; 821730#L25 assume !(~n <= 0); 821722#L26 call #t~ret0 := fact(~n - 1);< 821726#factENTRY ~n := #in~n; 821733#L25 assume ~n <= 0;#res := 1; 821729#factFINAL assume true; 821720#factEXIT >#66#return; 821717#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 821715#factFINAL assume true; 821711#factEXIT >#68#return; 821705#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 821709#factENTRY ~n := #in~n; 821802#L25 assume !(~n <= 0); 821798#L26 call #t~ret0 := fact(~n - 1);< 821799#factENTRY ~n := #in~n; 821804#L25 assume ~n <= 0;#res := 1; 821801#factFINAL assume true; 821797#factEXIT >#66#return; 821796#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 821793#factFINAL assume true; 821791#factEXIT >#70#return; 821634#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 821638#factENTRY ~n := #in~n; 821803#L25 assume ~n <= 0;#res := 1; 821800#factFINAL assume true; 821633#factEXIT >#72#return; 821636#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; 821703#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 821632#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 821629#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 821626#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; 821615#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 821779#factENTRY ~n := #in~n; 821776#L25 assume !(~n <= 0); 821773#L26 call #t~ret0 := fact(~n - 1);< 821774#factENTRY ~n := #in~n; 821782#L25 assume !(~n <= 0); 821772#L26 call #t~ret0 := fact(~n - 1);< 821781#factENTRY ~n := #in~n; 821786#L25 assume ~n <= 0;#res := 1; 821783#factFINAL assume true; 821780#factEXIT >#66#return; 821778#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 821775#factFINAL assume true; 821771#factEXIT >#66#return; 821769#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 821770#factFINAL assume true; 821613#factEXIT >#74#return; 821610#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 821611#factENTRY ~n := #in~n; 822143#L25 assume !(~n <= 0); 821886#L26 call #t~ret0 := fact(~n - 1);< 821893#factENTRY ~n := #in~n; 821897#L25 assume ~n <= 0;#res := 1; 821894#factFINAL assume true; 821885#factEXIT >#66#return; 821890#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 822140#factFINAL assume true; 821608#factEXIT >#76#return; 821596#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 821599#factENTRY ~n := #in~n; 821606#L25 assume !(~n <= 0); 821603#L26 call #t~ret0 := fact(~n - 1);< 821604#factENTRY ~n := #in~n; 821607#L25 assume ~n <= 0;#res := 1; 821605#factFINAL assume true; 821602#factEXIT >#66#return; 821601#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 821600#factFINAL assume true; 821595#factEXIT >#78#return; 821598#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; 821812#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 821810#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 821808#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 821564#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; 821486#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 821490#factENTRY ~n := #in~n; 821498#L25 assume !(~n <= 0); 821494#L26 call #t~ret0 := fact(~n - 1);< 821496#factENTRY ~n := #in~n; 821503#L25 assume !(~n <= 0); 821495#L26 call #t~ret0 := fact(~n - 1);< 821501#factENTRY ~n := #in~n; 821503#L25 assume !(~n <= 0); 821495#L26 call #t~ret0 := fact(~n - 1);< 821501#factENTRY ~n := #in~n; 821507#L25 assume ~n <= 0;#res := 1; 821506#factFINAL assume true; 821505#factEXIT >#66#return; 821504#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 821502#factFINAL assume true; 821500#factEXIT >#66#return; 821499#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 821497#factFINAL assume true; 821493#factEXIT >#66#return; 821492#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 821491#factFINAL assume true; 821485#factEXIT >#74#return; 821306#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 821412#factENTRY ~n := #in~n; 821401#L25 assume !(~n <= 0); 821381#L26 call #t~ret0 := fact(~n - 1);< 821384#factENTRY ~n := #in~n; 821395#L25 assume ~n <= 0;#res := 1; 821390#factFINAL assume true; 821380#factEXIT >#66#return; 821354#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 821355#factFINAL assume true; 821304#factEXIT >#76#return; 821256#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 821378#factENTRY ~n := #in~n; 821379#L25 assume !(~n <= 0); 821334#L26 call #t~ret0 := fact(~n - 1);< 821338#factENTRY ~n := #in~n; 821386#L25 assume !(~n <= 0); 821331#L26 call #t~ret0 := fact(~n - 1);< 821372#factENTRY ~n := #in~n; 821351#L25 assume ~n <= 0;#res := 1; 821349#factFINAL assume true; 821345#factEXIT >#66#return; 821344#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 821339#factFINAL assume true; 821324#factEXIT >#66#return; 821311#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 821312#factFINAL assume true; 821255#factEXIT >#78#return; 821258#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; 825208#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 825207#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 825206#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 825205#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 825204#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 825203#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 821274#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; 821204#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 821208#factENTRY ~n := #in~n; 821239#L25 assume !(~n <= 0); 821230#L26 call #t~ret0 := fact(~n - 1);< 821233#factENTRY ~n := #in~n; 821254#L25 assume !(~n <= 0); 821229#L26 call #t~ret0 := fact(~n - 1);< 821238#factENTRY ~n := #in~n; 821252#L25 assume ~n <= 0;#res := 1; 821250#factFINAL assume true; 821247#factEXIT >#66#return; 821245#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 821237#factFINAL assume true; 821228#factEXIT >#66#return; 821222#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 821211#factFINAL assume true; 821201#factEXIT >#68#return; 821207#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 821198#factENTRY ~n := #in~n; 824686#L25 assume ~n <= 0;#res := 1; 824683#factFINAL assume true; 824488#factEXIT >#70#return; 824483#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 824486#factENTRY ~n := #in~n; 824631#L25 assume !(~n <= 0); 824619#L26 call #t~ret0 := fact(~n - 1);< 824629#factENTRY ~n := #in~n; 824907#L25 assume !(~n <= 0); 824620#L26 call #t~ret0 := fact(~n - 1);< 824905#factENTRY ~n := #in~n; 824640#L25 assume ~n <= 0;#res := 1; 824639#factFINAL assume true; 824634#factEXIT >#66#return; 824632#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 824628#factFINAL assume true; 824618#factEXIT >#66#return; 824622#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 824703#factFINAL assume true; 824482#factEXIT >#72#return; 824485#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; 824492#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 824491#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 824487#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 824481#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; 824429#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 824435#factENTRY ~n := #in~n; 824737#L25 assume !(~n <= 0); 824734#L26 call #t~ret0 := fact(~n - 1);< 824735#factENTRY ~n := #in~n; 824746#L25 assume !(~n <= 0); 824744#L26 call #t~ret0 := fact(~n - 1);< 824745#factENTRY ~n := #in~n; 824748#L25 assume ~n <= 0;#res := 1; 824747#factFINAL assume true; 824743#factEXIT >#66#return; 824742#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 824739#factFINAL assume true; 824733#factEXIT >#66#return; 824731#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 824438#factFINAL assume true; 824428#factEXIT >#68#return; 824433#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 824473#factENTRY ~n := #in~n; 824710#L25 assume !(~n <= 0); 824707#L26 call #t~ret0 := fact(~n - 1);< 824709#factENTRY ~n := #in~n; 824713#L25 assume ~n <= 0;#res := 1; 824711#factFINAL assume true; 824705#factEXIT >#66#return; 824704#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 824477#factFINAL assume true; 824472#factEXIT >#70#return; 824446#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 824448#factENTRY ~n := #in~n; 824712#L25 assume !(~n <= 0); 824706#L26 call #t~ret0 := fact(~n - 1);< 824709#factENTRY ~n := #in~n; 824713#L25 assume ~n <= 0;#res := 1; 824711#factFINAL assume true; 824705#factEXIT >#66#return; 824708#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 824726#factFINAL assume true; 824444#factEXIT >#72#return; 824447#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; 824959#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 824958#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 824956#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 824955#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; 824430#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 824435#factENTRY ~n := #in~n; 824737#L25 assume !(~n <= 0); 824734#L26 call #t~ret0 := fact(~n - 1);< 824735#factENTRY ~n := #in~n; 824746#L25 assume !(~n <= 0); 824744#L26 call #t~ret0 := fact(~n - 1);< 824745#factENTRY ~n := #in~n; 824748#L25 assume ~n <= 0;#res := 1; 824747#factFINAL assume true; 824743#factEXIT >#66#return; 824742#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 824739#factFINAL assume true; 824733#factEXIT >#66#return; 824731#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 824438#factFINAL assume true; 824428#factEXIT >#68#return; 824425#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 824427#factENTRY ~n := #in~n; 824651#L25 assume !(~n <= 0); 824529#L26 call #t~ret0 := fact(~n - 1);< 824534#factENTRY ~n := #in~n; 824897#L25 assume !(~n <= 0); 824654#L26 call #t~ret0 := fact(~n - 1);< 824655#factENTRY ~n := #in~n; 824682#L25 assume ~n <= 0;#res := 1; 824681#factFINAL assume true; 824653#factEXIT >#66#return; 824652#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 824650#factFINAL assume true; 824526#factEXIT >#66#return; 824532#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 824952#factFINAL assume true; 824424#factEXIT >#70#return; 824420#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 824423#factENTRY ~n := #in~n; 824641#L25 assume ~n <= 0;#res := 1; 824577#factFINAL assume true; 824419#factEXIT >#72#return; 824422#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; 824927#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 824926#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 824925#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 824924#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; 824400#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 824920#factENTRY ~n := #in~n; 824918#L25 assume !(~n <= 0); 824913#L26 call #t~ret0 := fact(~n - 1);< 824915#factENTRY ~n := #in~n; 824923#L25 assume !(~n <= 0); 824912#L26 call #t~ret0 := fact(~n - 1);< 824922#factENTRY ~n := #in~n; 824923#L25 assume !(~n <= 0); 824912#L26 call #t~ret0 := fact(~n - 1);< 824922#factENTRY ~n := #in~n; 824935#L25 assume ~n <= 0;#res := 1; 824934#factFINAL assume true; 824930#factEXIT >#66#return; 824929#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 824928#factFINAL assume true; 824921#factEXIT >#66#return; 824919#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 824917#factFINAL assume true; 824910#factEXIT >#66#return; 824914#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 825092#factFINAL assume true; 825085#factEXIT >#74#return; 825086#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 825134#factENTRY ~n := #in~n; 825151#L25 assume !(~n <= 0); 823941#L26 call #t~ret0 := fact(~n - 1);< 824440#factENTRY ~n := #in~n; 824392#L25 assume !(~n <= 0); 824357#L26 call #t~ret0 := fact(~n - 1);< 824358#factENTRY ~n := #in~n; 824372#L25 assume ~n <= 0;#res := 1; 824370#factFINAL assume true; 824356#factEXIT >#66#return; 824168#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 824164#factFINAL assume true; 823940#factEXIT >#66#return; 823947#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 825150#factFINAL assume true; 825133#factEXIT >#76#return; 823687#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 823688#factENTRY ~n := #in~n; 825144#L25 assume !(~n <= 0); 825141#L26 call #t~ret0 := fact(~n - 1);< 825142#factENTRY ~n := #in~n; 825149#L25 assume ~n <= 0;#res := 1; 825148#factFINAL assume true; 825140#factEXIT >#66#return; 825138#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 825136#factFINAL assume true; 825135#factEXIT >#78#return; 822356#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; 822355#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 822348#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 822158#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 822156#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 822157#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 823092#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 823091#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; 821263#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 821269#factENTRY ~n := #in~n; 821267#L25 assume !(~n <= 0); 821231#L26 call #t~ret0 := fact(~n - 1);< 821233#factENTRY ~n := #in~n; 821254#L25 assume !(~n <= 0); 821229#L26 call #t~ret0 := fact(~n - 1);< 821238#factENTRY ~n := #in~n; 821254#L25 assume !(~n <= 0); 821229#L26 call #t~ret0 := fact(~n - 1);< 821238#factENTRY ~n := #in~n; 821252#L25 assume ~n <= 0;#res := 1; 821250#factFINAL assume true; 821247#factEXIT >#66#return; 821245#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 821237#factFINAL assume true; 821228#factEXIT >#66#return; 821232#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 821303#factFINAL assume true; 821302#factEXIT >#66#return; 821301#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 821300#factFINAL assume true; 821299#factEXIT >#68#return; 821193#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 821199#factENTRY ~n := #in~n; 821220#L25 assume ~n <= 0;#res := 1; 821210#factFINAL assume true; 821191#factEXIT >#70#return; 821197#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 822454#factENTRY ~n := #in~n; 823240#L25 assume !(~n <= 0); 821226#L26 call #t~ret0 := fact(~n - 1);< 822368#factENTRY ~n := #in~n; 822364#L25 assume !(~n <= 0); 821215#L26 call #t~ret0 := fact(~n - 1);< 821225#factENTRY ~n := #in~n; 825341#L25 assume !(~n <= 0); 821241#L26 call #t~ret0 := fact(~n - 1);< 821242#factENTRY ~n := #in~n; 821265#L25 assume ~n <= 0;#res := 1; 821261#factFINAL assume true; 821240#factEXIT >#66#return; 821234#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 821223#factFINAL assume true; 821212#factEXIT >#66#return; 821218#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 823239#factFINAL assume true; 823233#factEXIT >#66#return; 823228#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 823183#factFINAL assume true; 823087#factEXIT >#72#return; 823088#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; 823090#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 823089#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 823086#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 823084#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; 822865#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 822871#factENTRY ~n := #in~n; 822946#L25 assume !(~n <= 0); 822937#L26 call #t~ret0 := fact(~n - 1);< 822944#factENTRY ~n := #in~n; 823479#L25 assume !(~n <= 0); 821056#L26 call #t~ret0 := fact(~n - 1);< 822788#factENTRY ~n := #in~n; 825258#L25 assume !(~n <= 0); 821137#L26 call #t~ret0 := fact(~n - 1);< 821139#factENTRY ~n := #in~n; 821144#L25 assume ~n <= 0;#res := 1; 821143#factFINAL assume true; 821136#factEXIT >#66#return; 821133#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 821127#factFINAL assume true; 821042#factEXIT >#66#return; 821068#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 822962#factFINAL assume true; 822935#factEXIT >#66#return; 822933#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 822918#factFINAL assume true; 822862#factEXIT >#68#return; 822870#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 823078#factENTRY ~n := #in~n; 823181#L25 assume !(~n <= 0); 821067#L26 call #t~ret0 := fact(~n - 1);< 823180#factENTRY ~n := #in~n; 822966#L25 assume ~n <= 0;#res := 1; 822948#factFINAL assume true; 822921#factEXIT >#66#return; 822926#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 823080#factFINAL assume true; 823077#factEXIT >#70#return; 821128#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 823076#factENTRY ~n := #in~n; 823510#L25 assume !(~n <= 0); 821065#L26 call #t~ret0 := fact(~n - 1);< 821130#factENTRY ~n := #in~n; 825258#L25 assume !(~n <= 0); 821137#L26 call #t~ret0 := fact(~n - 1);< 821139#factENTRY ~n := #in~n; 821144#L25 assume ~n <= 0;#res := 1; 821143#factFINAL assume true; 821136#factEXIT >#66#return; 821133#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 821127#factFINAL assume true; 821042#factEXIT >#66#return; 821073#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 823177#factFINAL assume true; 823074#factEXIT >#72#return; 823075#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; 823136#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 823135#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 823133#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 823131#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; 822866#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 822871#factENTRY ~n := #in~n; 822946#L25 assume !(~n <= 0); 822937#L26 call #t~ret0 := fact(~n - 1);< 822944#factENTRY ~n := #in~n; 823479#L25 assume !(~n <= 0); 821056#L26 call #t~ret0 := fact(~n - 1);< 822788#factENTRY ~n := #in~n; 825258#L25 assume !(~n <= 0); 821137#L26 call #t~ret0 := fact(~n - 1);< 821139#factENTRY ~n := #in~n; 821144#L25 assume ~n <= 0;#res := 1; 821143#factFINAL assume true; 821136#factEXIT >#66#return; 821133#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 821127#factFINAL assume true; 821042#factEXIT >#66#return; 821068#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 822962#factFINAL assume true; 822935#factEXIT >#66#return; 822933#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 822918#factFINAL assume true; 822862#factEXIT >#68#return; 822860#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 822861#factENTRY ~n := #in~n; 823072#L25 assume !(~n <= 0); 821057#L26 call #t~ret0 := fact(~n - 1);< 822964#factENTRY ~n := #in~n; 825250#L25 assume !(~n <= 0); 821059#L26 call #t~ret0 := fact(~n - 1);< 821138#factENTRY ~n := #in~n; 821144#L25 assume ~n <= 0;#res := 1; 821143#factFINAL assume true; 821136#factEXIT >#66#return; 821133#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 821127#factFINAL assume true; 821042#factEXIT >#66#return; 821072#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 823067#factFINAL assume true; 823066#factEXIT >#70#return; 822978#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 822980#factENTRY ~n := #in~n; 823186#L25 assume !(~n <= 0); 822922#L26 call #t~ret0 := fact(~n - 1);< 822957#factENTRY ~n := #in~n; 822966#L25 assume ~n <= 0;#res := 1; 822948#factFINAL assume true; 822921#factEXIT >#66#return; 822924#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 823006#factFINAL assume true; 822976#factEXIT >#72#return; 822975#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; 822974#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 822961#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 822931#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 822930#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; 822863#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 822871#factENTRY ~n := #in~n; 822946#L25 assume !(~n <= 0); 822937#L26 call #t~ret0 := fact(~n - 1);< 822944#factENTRY ~n := #in~n; 823479#L25 assume !(~n <= 0); 821056#L26 call #t~ret0 := fact(~n - 1);< 822788#factENTRY ~n := #in~n; 825258#L25 assume !(~n <= 0); 821137#L26 call #t~ret0 := fact(~n - 1);< 821139#factENTRY ~n := #in~n; 821144#L25 assume ~n <= 0;#res := 1; 821143#factFINAL assume true; 821136#factEXIT >#66#return; 821133#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 821127#factFINAL assume true; 821042#factEXIT >#66#return; 821068#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 822962#factFINAL assume true; 822935#factEXIT >#66#return; 822933#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 822918#factFINAL assume true; 822862#factEXIT >#68#return; 822857#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 822861#factENTRY ~n := #in~n; 823072#L25 assume !(~n <= 0); 821057#L26 call #t~ret0 := fact(~n - 1);< 822964#factENTRY ~n := #in~n; 825250#L25 assume !(~n <= 0); 821059#L26 call #t~ret0 := fact(~n - 1);< 821138#factENTRY ~n := #in~n; 821144#L25 assume ~n <= 0;#res := 1; 821143#factFINAL assume true; 821136#factEXIT >#66#return; 821133#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 821127#factFINAL assume true; 821042#factEXIT >#66#return; 821072#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 823067#factFINAL assume true; 823066#factEXIT >#70#return; 820912#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 820915#factENTRY ~n := #in~n; 822855#L25 assume ~n <= 0;#res := 1; 820916#factFINAL assume true; 820910#factEXIT >#72#return; 820914#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; 823956#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 823683#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 823682#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 823680#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; 823587#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 823678#factENTRY ~n := #in~n; 823727#L25 assume !(~n <= 0); 822747#L26 call #t~ret0 := fact(~n - 1);< 823723#factENTRY ~n := #in~n; 824834#L25 assume !(~n <= 0); 822732#L26 call #t~ret0 := fact(~n - 1);< 822749#factENTRY ~n := #in~n; 822778#L25 assume !(~n <= 0); 822728#L26 call #t~ret0 := fact(~n - 1);< 822768#factENTRY ~n := #in~n; 822778#L25 assume !(~n <= 0); 822728#L26 call #t~ret0 := fact(~n - 1);< 822768#factENTRY ~n := #in~n; 822782#L25 assume ~n <= 0;#res := 1; 822769#factFINAL assume true; 822767#factEXIT >#66#return; 822766#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 822763#factFINAL assume true; 822761#factEXIT >#66#return; 822758#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 822746#factFINAL assume true; 822727#factEXIT >#66#return; 822733#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 824311#factFINAL assume true; 823721#factEXIT >#66#return; 823720#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 823719#factFINAL assume true; 823677#factEXIT >#74#return; 823525#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 823675#factENTRY ~n := #in~n; 823674#L25 assume !(~n <= 0); 822667#L26 call #t~ret0 := fact(~n - 1);< 822680#factENTRY ~n := #in~n; 822674#L25 assume !(~n <= 0); 822602#L26 call #t~ret0 := fact(~n - 1);< 822662#factENTRY ~n := #in~n; 822652#L25 assume !(~n <= 0); 822595#L26 call #t~ret0 := fact(~n - 1);< 822633#factENTRY ~n := #in~n; 822628#L25 assume !(~n <= 0); 822623#L26 call #t~ret0 := fact(~n - 1);< 822624#factENTRY ~n := #in~n; 822630#L25 assume ~n <= 0;#res := 1; 822627#factFINAL assume true; 822622#factEXIT >#66#return; 822621#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 822614#factFINAL assume true; 822588#factEXIT >#66#return; 822608#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 823524#factFINAL assume true; 823513#factEXIT >#66#return; 823512#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 823511#factFINAL assume true; 823500#factEXIT >#66#return; 823508#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 823856#factFINAL assume true; 823855#factEXIT >#76#return; 820870#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 823852#factENTRY ~n := #in~n; 823853#L25 assume !(~n <= 0); 820868#L26 call #t~ret0 := fact(~n - 1);< 820871#factENTRY ~n := #in~n; 824692#L25 assume ~n <= 0;#res := 1; 824688#factFINAL assume true; 823394#factEXIT >#66#return; 823396#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 823483#factFINAL assume true; 823366#factEXIT >#78#return; 823363#L30-8 [2022-11-20 09:43:18,026 INFO L750 eck$LassoCheckResult]: Loop: 823363#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; 823352#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 823336#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 823334#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 823327#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 823326#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 823324#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 823323#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; 822450#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 822522#factENTRY ~n := #in~n; 822521#L25 assume !(~n <= 0); 822469#L26 call #t~ret0 := fact(~n - 1);< 822486#factENTRY ~n := #in~n; 822520#L25 assume !(~n <= 0); 822467#L26 call #t~ret0 := fact(~n - 1);< 822517#factENTRY ~n := #in~n; 822515#L25 assume !(~n <= 0); 822463#L26 call #t~ret0 := fact(~n - 1);< 822514#factENTRY ~n := #in~n; 822513#L25 assume !(~n <= 0); 822460#L26 call #t~ret0 := fact(~n - 1);< 822501#factENTRY ~n := #in~n; 822512#L25 assume !(~n <= 0); 822461#L26 call #t~ret0 := fact(~n - 1);< 822508#factENTRY ~n := #in~n; 822510#L25 assume ~n <= 0;#res := 1; 822509#factFINAL assume true; 822507#factEXIT >#66#return; 822506#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 822505#factFINAL assume true; 822504#factEXIT >#66#return; 822503#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 822502#factFINAL assume true; 822500#factEXIT >#66#return; 822499#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 822498#factFINAL assume true; 822490#factEXIT >#66#return; 822489#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 822488#factFINAL assume true; 822484#factEXIT >#66#return; 822485#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 822568#factFINAL assume true; 822567#factEXIT >#68#return; 822431#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 822441#factENTRY ~n := #in~n; 822443#L25 assume ~n <= 0;#res := 1; 822442#factFINAL assume true; 822424#factEXIT >#70#return; 822438#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 822560#factENTRY ~n := #in~n; 822559#L25 assume !(~n <= 0); 822496#L26 call #t~ret0 := fact(~n - 1);< 822558#factENTRY ~n := #in~n; 822494#L25 assume !(~n <= 0); 822375#L26 call #t~ret0 := fact(~n - 1);< 822386#factENTRY ~n := #in~n; 822381#L25 assume !(~n <= 0); 821224#L26 call #t~ret0 := fact(~n - 1);< 822368#factENTRY ~n := #in~n; 822364#L25 assume !(~n <= 0); 821215#L26 call #t~ret0 := fact(~n - 1);< 821225#factENTRY ~n := #in~n; 825341#L25 assume !(~n <= 0); 821241#L26 call #t~ret0 := fact(~n - 1);< 821242#factENTRY ~n := #in~n; 821265#L25 assume ~n <= 0;#res := 1; 821261#factFINAL assume true; 821240#factEXIT >#66#return; 821234#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 821223#factFINAL assume true; 821212#factEXIT >#66#return; 821218#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 823239#factFINAL assume true; 823233#factEXIT >#66#return; 823234#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 824331#factFINAL assume true; 823361#factEXIT >#66#return; 823360#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 823359#factFINAL assume true; 823350#factEXIT >#66#return; 823351#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 823443#factFINAL assume true; 823441#factEXIT >#72#return; 823440#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; 823424#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 823423#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 823415#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 823413#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; 822879#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 822887#factENTRY ~n := #in~n; 823005#L25 assume !(~n <= 0); 821101#L26 call #t~ret0 := fact(~n - 1);< 822973#factENTRY ~n := #in~n; 825052#L25 assume !(~n <= 0); 821086#L26 call #t~ret0 := fact(~n - 1);< 823026#factENTRY ~n := #in~n; 823661#L25 assume !(~n <= 0); 821085#L26 call #t~ret0 := fact(~n - 1);< 822992#factENTRY ~n := #in~n; 823509#L25 assume !(~n <= 0); 821062#L26 call #t~ret0 := fact(~n - 1);< 821074#factENTRY ~n := #in~n; 825251#L25 assume !(~n <= 0); 821053#L26 call #t~ret0 := fact(~n - 1);< 822963#factENTRY ~n := #in~n; 821144#L25 assume ~n <= 0;#res := 1; 821143#factFINAL assume true; 821136#factEXIT >#66#return; 821133#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 821127#factFINAL assume true; 821042#factEXIT >#66#return; 821068#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 822962#factFINAL assume true; 822935#factEXIT >#66#return; 822939#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 821077#factFINAL assume true; 821094#factEXIT >#66#return; 823022#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 822982#factFINAL assume true; 822969#factEXIT >#66#return; 822960#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 822929#factFINAL assume true; 822872#factEXIT >#68#return; 822885#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 823305#factENTRY ~n := #in~n; 823445#L25 assume !(~n <= 0); 822923#L26 call #t~ret0 := fact(~n - 1);< 822957#factENTRY ~n := #in~n; 822966#L25 assume ~n <= 0;#res := 1; 822948#factFINAL assume true; 822921#factEXIT >#66#return; 822925#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 823304#factFINAL assume true; 823301#factEXIT >#70#return; 822987#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 823288#factENTRY ~n := #in~n; 823480#L25 assume !(~n <= 0); 821081#L26 call #t~ret0 := fact(~n - 1);< 822992#factENTRY ~n := #in~n; 823509#L25 assume !(~n <= 0); 821062#L26 call #t~ret0 := fact(~n - 1);< 821074#factENTRY ~n := #in~n; 825251#L25 assume !(~n <= 0); 821053#L26 call #t~ret0 := fact(~n - 1);< 822963#factENTRY ~n := #in~n; 821144#L25 assume ~n <= 0;#res := 1; 821143#factFINAL assume true; 821136#factEXIT >#66#return; 821133#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 821127#factFINAL assume true; 821042#factEXIT >#66#return; 821068#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 822962#factFINAL assume true; 822935#factEXIT >#66#return; 822940#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 823439#factFINAL assume true; 823416#factEXIT >#72#return; 823269#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; 825079#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 825078#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 825077#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 825075#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; 822876#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 822887#factENTRY ~n := #in~n; 823005#L25 assume !(~n <= 0); 821101#L26 call #t~ret0 := fact(~n - 1);< 822973#factENTRY ~n := #in~n; 825052#L25 assume !(~n <= 0); 821086#L26 call #t~ret0 := fact(~n - 1);< 823026#factENTRY ~n := #in~n; 823661#L25 assume !(~n <= 0); 821085#L26 call #t~ret0 := fact(~n - 1);< 822992#factENTRY ~n := #in~n; 823509#L25 assume !(~n <= 0); 821062#L26 call #t~ret0 := fact(~n - 1);< 821074#factENTRY ~n := #in~n; 825251#L25 assume !(~n <= 0); 821053#L26 call #t~ret0 := fact(~n - 1);< 822963#factENTRY ~n := #in~n; 821144#L25 assume ~n <= 0;#res := 1; 821143#factFINAL assume true; 821136#factEXIT >#66#return; 821133#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 821127#factFINAL assume true; 821042#factEXIT >#66#return; 821068#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 822962#factFINAL assume true; 822935#factEXIT >#66#return; 822939#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 821077#factFINAL assume true; 821094#factEXIT >#66#return; 823022#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 822982#factFINAL assume true; 822969#factEXIT >#66#return; 822960#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 822929#factFINAL assume true; 822872#factEXIT >#68#return; 820967#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 822852#factENTRY ~n := #in~n; 823093#L25 assume !(~n <= 0); 821063#L26 call #t~ret0 := fact(~n - 1);< 822965#factENTRY ~n := #in~n; 823196#L25 assume !(~n <= 0); 821045#L26 call #t~ret0 := fact(~n - 1);< 823155#factENTRY ~n := #in~n; 821144#L25 assume ~n <= 0;#res := 1; 821143#factFINAL assume true; 821136#factEXIT >#66#return; 821133#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 821127#factFINAL assume true; 821042#factEXIT >#66#return; 821071#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 823290#factFINAL assume true; 823289#factEXIT >#70#return; 822986#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 823288#factENTRY ~n := #in~n; 823480#L25 assume !(~n <= 0); 821081#L26 call #t~ret0 := fact(~n - 1);< 822992#factENTRY ~n := #in~n; 823509#L25 assume !(~n <= 0); 821062#L26 call #t~ret0 := fact(~n - 1);< 821074#factENTRY ~n := #in~n; 825251#L25 assume !(~n <= 0); 821053#L26 call #t~ret0 := fact(~n - 1);< 822963#factENTRY ~n := #in~n; 821144#L25 assume ~n <= 0;#res := 1; 821143#factFINAL assume true; 821136#factEXIT >#66#return; 821133#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 821127#factFINAL assume true; 821042#factEXIT >#66#return; 821068#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 822962#factFINAL assume true; 822935#factEXIT >#66#return; 822940#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 823439#factFINAL assume true; 823416#factEXIT >#72#return; 823266#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; 824046#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 824044#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 824042#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 824040#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; 822883#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 822887#factENTRY ~n := #in~n; 823005#L25 assume !(~n <= 0); 821101#L26 call #t~ret0 := fact(~n - 1);< 822973#factENTRY ~n := #in~n; 825052#L25 assume !(~n <= 0); 821086#L26 call #t~ret0 := fact(~n - 1);< 823026#factENTRY ~n := #in~n; 823661#L25 assume !(~n <= 0); 821085#L26 call #t~ret0 := fact(~n - 1);< 822992#factENTRY ~n := #in~n; 823509#L25 assume !(~n <= 0); 821062#L26 call #t~ret0 := fact(~n - 1);< 821074#factENTRY ~n := #in~n; 825251#L25 assume !(~n <= 0); 821053#L26 call #t~ret0 := fact(~n - 1);< 822963#factENTRY ~n := #in~n; 821144#L25 assume ~n <= 0;#res := 1; 821143#factFINAL assume true; 821136#factEXIT >#66#return; 821133#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 821127#factFINAL assume true; 821042#factEXIT >#66#return; 821068#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 822962#factFINAL assume true; 822935#factEXIT >#66#return; 822939#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 821077#factFINAL assume true; 821094#factEXIT >#66#return; 823022#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 822982#factFINAL assume true; 822969#factEXIT >#66#return; 822960#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 822929#factFINAL assume true; 822872#factEXIT >#68#return; 820970#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 822852#factENTRY ~n := #in~n; 823093#L25 assume !(~n <= 0); 821063#L26 call #t~ret0 := fact(~n - 1);< 822965#factENTRY ~n := #in~n; 823196#L25 assume !(~n <= 0); 821045#L26 call #t~ret0 := fact(~n - 1);< 823155#factENTRY ~n := #in~n; 823196#L25 assume !(~n <= 0); 821045#L26 call #t~ret0 := fact(~n - 1);< 823155#factENTRY ~n := #in~n; 823196#L25 assume !(~n <= 0); 821045#L26 call #t~ret0 := fact(~n - 1);< 823155#factENTRY ~n := #in~n; 823196#L25 assume !(~n <= 0); 821045#L26 call #t~ret0 := fact(~n - 1);< 823155#factENTRY ~n := #in~n; 821144#L25 assume ~n <= 0;#res := 1; 821143#factFINAL assume true; 821136#factEXIT >#66#return; 821133#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 821127#factFINAL assume true; 821042#factEXIT >#66#return; 821068#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 822962#factFINAL assume true; 822935#factEXIT >#66#return; 822939#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 821077#factFINAL assume true; 821094#factEXIT >#66#return; 823022#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 822982#factFINAL assume true; 822969#factEXIT >#66#return; 821041#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 821021#factFINAL assume true; 821022#factEXIT >#70#return; 822821#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 822915#factENTRY ~n := #in~n; 823952#L25 assume !(~n <= 0); 821048#L26 call #t~ret0 := fact(~n - 1);< 822983#factENTRY ~n := #in~n; 823645#L25 assume !(~n <= 0); 821043#L26 call #t~ret0 := fact(~n - 1);< 823025#factENTRY ~n := #in~n; 821144#L25 assume ~n <= 0;#res := 1; 821143#factFINAL assume true; 821136#factEXIT >#66#return; 821133#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 821127#factFINAL assume true; 821042#factEXIT >#66#return; 821069#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 823255#factFINAL assume true; 823210#factEXIT >#72#return; 823211#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; 823258#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 823257#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 823256#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 823250#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; 822873#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 822887#factENTRY ~n := #in~n; 823005#L25 assume !(~n <= 0); 821101#L26 call #t~ret0 := fact(~n - 1);< 822973#factENTRY ~n := #in~n; 825052#L25 assume !(~n <= 0); 821086#L26 call #t~ret0 := fact(~n - 1);< 823026#factENTRY ~n := #in~n; 823661#L25 assume !(~n <= 0); 821085#L26 call #t~ret0 := fact(~n - 1);< 822992#factENTRY ~n := #in~n; 823509#L25 assume !(~n <= 0); 821062#L26 call #t~ret0 := fact(~n - 1);< 821074#factENTRY ~n := #in~n; 825251#L25 assume !(~n <= 0); 821053#L26 call #t~ret0 := fact(~n - 1);< 822963#factENTRY ~n := #in~n; 821144#L25 assume ~n <= 0;#res := 1; 821143#factFINAL assume true; 821136#factEXIT >#66#return; 821133#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 821127#factFINAL assume true; 821042#factEXIT >#66#return; 821068#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 822962#factFINAL assume true; 822935#factEXIT >#66#return; 822939#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 821077#factFINAL assume true; 821094#factEXIT >#66#return; 823022#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 822982#factFINAL assume true; 822969#factEXIT >#66#return; 822960#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 822929#factFINAL assume true; 822872#factEXIT >#68#return; 820926#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 822852#factENTRY ~n := #in~n; 823093#L25 assume !(~n <= 0); 821063#L26 call #t~ret0 := fact(~n - 1);< 822965#factENTRY ~n := #in~n; 823196#L25 assume !(~n <= 0); 821045#L26 call #t~ret0 := fact(~n - 1);< 823155#factENTRY ~n := #in~n; 823196#L25 assume !(~n <= 0); 821045#L26 call #t~ret0 := fact(~n - 1);< 823155#factENTRY ~n := #in~n; 823196#L25 assume !(~n <= 0); 821045#L26 call #t~ret0 := fact(~n - 1);< 823155#factENTRY ~n := #in~n; 823196#L25 assume !(~n <= 0); 821045#L26 call #t~ret0 := fact(~n - 1);< 823155#factENTRY ~n := #in~n; 821144#L25 assume ~n <= 0;#res := 1; 821143#factFINAL assume true; 821136#factEXIT >#66#return; 821133#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 821127#factFINAL assume true; 821042#factEXIT >#66#return; 821068#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 822962#factFINAL assume true; 822935#factEXIT >#66#return; 822939#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 821077#factFINAL assume true; 821094#factEXIT >#66#return; 823022#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 822982#factFINAL assume true; 822969#factEXIT >#66#return; 821041#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 821021#factFINAL assume true; 821022#factEXIT >#70#return; 822829#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 822915#factENTRY ~n := #in~n; 823952#L25 assume !(~n <= 0); 821048#L26 call #t~ret0 := fact(~n - 1);< 822983#factENTRY ~n := #in~n; 822966#L25 assume ~n <= 0;#res := 1; 822948#factFINAL assume true; 822921#factEXIT >#66#return; 822919#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 822916#factFINAL assume true; 822897#factEXIT >#72#return; 822895#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; 822893#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 822892#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 822891#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 822889#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; 822877#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 822887#factENTRY ~n := #in~n; 823005#L25 assume !(~n <= 0); 821101#L26 call #t~ret0 := fact(~n - 1);< 822973#factENTRY ~n := #in~n; 825052#L25 assume !(~n <= 0); 821086#L26 call #t~ret0 := fact(~n - 1);< 823026#factENTRY ~n := #in~n; 823661#L25 assume !(~n <= 0); 821085#L26 call #t~ret0 := fact(~n - 1);< 822992#factENTRY ~n := #in~n; 823509#L25 assume !(~n <= 0); 821062#L26 call #t~ret0 := fact(~n - 1);< 821074#factENTRY ~n := #in~n; 825251#L25 assume !(~n <= 0); 821053#L26 call #t~ret0 := fact(~n - 1);< 822963#factENTRY ~n := #in~n; 821144#L25 assume ~n <= 0;#res := 1; 821143#factFINAL assume true; 821136#factEXIT >#66#return; 821133#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 821127#factFINAL assume true; 821042#factEXIT >#66#return; 821068#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 822962#factFINAL assume true; 822935#factEXIT >#66#return; 822939#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 821077#factFINAL assume true; 821094#factEXIT >#66#return; 823022#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 822982#factFINAL assume true; 822969#factEXIT >#66#return; 822960#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 822929#factFINAL assume true; 822872#factEXIT >#68#return; 820940#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 822852#factENTRY ~n := #in~n; 823093#L25 assume !(~n <= 0); 821063#L26 call #t~ret0 := fact(~n - 1);< 822965#factENTRY ~n := #in~n; 823196#L25 assume !(~n <= 0); 821045#L26 call #t~ret0 := fact(~n - 1);< 823155#factENTRY ~n := #in~n; 823196#L25 assume !(~n <= 0); 821045#L26 call #t~ret0 := fact(~n - 1);< 823155#factENTRY ~n := #in~n; 823196#L25 assume !(~n <= 0); 821045#L26 call #t~ret0 := fact(~n - 1);< 823155#factENTRY ~n := #in~n; 823196#L25 assume !(~n <= 0); 821045#L26 call #t~ret0 := fact(~n - 1);< 823155#factENTRY ~n := #in~n; 821144#L25 assume ~n <= 0;#res := 1; 821143#factFINAL assume true; 821136#factEXIT >#66#return; 821133#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 821127#factFINAL assume true; 821042#factEXIT >#66#return; 821068#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 822962#factFINAL assume true; 822935#factEXIT >#66#return; 822939#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 821077#factFINAL assume true; 821094#factEXIT >#66#return; 823022#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 822982#factFINAL assume true; 822969#factEXIT >#66#return; 821041#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 821021#factFINAL assume true; 821022#factEXIT >#70#return; 820923#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 822848#factENTRY ~n := #in~n; 820917#L25 assume ~n <= 0;#res := 1; 820920#factFINAL assume true; 822820#factEXIT >#72#return; 822818#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; 822815#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 822812#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 822809#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 822805#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; 822798#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 822802#factENTRY ~n := #in~n; 822800#L25 assume !(~n <= 0); 822792#L26 call #t~ret0 := fact(~n - 1);< 822796#factENTRY ~n := #in~n; 822794#L25 assume !(~n <= 0); 822785#L26 call #t~ret0 := fact(~n - 1);< 822787#factENTRY ~n := #in~n; 822786#L25 assume !(~n <= 0); 822729#L26 call #t~ret0 := fact(~n - 1);< 822783#factENTRY ~n := #in~n; 822777#L25 assume !(~n <= 0); 822731#L26 call #t~ret0 := fact(~n - 1);< 822749#factENTRY ~n := #in~n; 822778#L25 assume !(~n <= 0); 822728#L26 call #t~ret0 := fact(~n - 1);< 822768#factENTRY ~n := #in~n; 822778#L25 assume !(~n <= 0); 822728#L26 call #t~ret0 := fact(~n - 1);< 822768#factENTRY ~n := #in~n; 822778#L25 assume !(~n <= 0); 822728#L26 call #t~ret0 := fact(~n - 1);< 822768#factENTRY ~n := #in~n; 822782#L25 assume ~n <= 0;#res := 1; 822769#factFINAL assume true; 822767#factEXIT >#66#return; 822766#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 822763#factFINAL assume true; 822761#factEXIT >#66#return; 822758#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 822746#factFINAL assume true; 822727#factEXIT >#66#return; 822733#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 824311#factFINAL assume true; 823721#factEXIT >#66#return; 823722#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 824353#factFINAL assume true; 823886#factEXIT >#66#return; 823887#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 824158#factFINAL assume true; 824157#factEXIT >#66#return; 824152#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 824154#factFINAL assume true; 824151#factEXIT >#66#return; 824145#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 824141#factFINAL assume true; 823870#factEXIT >#74#return; 820824#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 823869#factENTRY ~n := #in~n; 823884#L25 assume !(~n <= 0); 822615#L26 call #t~ret0 := fact(~n - 1);< 822649#factENTRY ~n := #in~n; 822641#L25 assume !(~n <= 0); 822596#L26 call #t~ret0 := fact(~n - 1);< 822619#factENTRY ~n := #in~n; 822629#L25 assume !(~n <= 0); 822592#L26 call #t~ret0 := fact(~n - 1);< 822626#factENTRY ~n := #in~n; 822629#L25 assume !(~n <= 0); 822592#L26 call #t~ret0 := fact(~n - 1);< 822626#factENTRY ~n := #in~n; 822630#L25 assume ~n <= 0;#res := 1; 822627#factFINAL assume true; 822622#factEXIT >#66#return; 822621#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 822614#factFINAL assume true; 822588#factEXIT >#66#return; 822608#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 823524#factFINAL assume true; 823513#factEXIT >#66#return; 823512#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 823511#factFINAL assume true; 823500#factEXIT >#66#return; 823506#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 824729#factFINAL assume true; 824728#factEXIT >#76#return; 820826#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 824719#factENTRY ~n := #in~n; 824717#L25 assume !(~n <= 0); 823395#L26 call #t~ret0 := fact(~n - 1);< 820871#factENTRY ~n := #in~n; 824692#L25 assume ~n <= 0;#res := 1; 824688#factFINAL assume true; 823394#factEXIT >#66#return; 823389#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 823370#factFINAL assume true; 823364#factEXIT >#78#return; 823363#L30-8 [2022-11-20 09:43:18,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:43:18,026 INFO L85 PathProgramCache]: Analyzing trace with hash 291195713, now seen corresponding path program 46 times [2022-11-20 09:43:18,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:43:18,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232969860] [2022-11-20 09:43:18,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:43:18,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:43:18,048 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:43:18,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1201470090] [2022-11-20 09:43:18,049 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 09:43:18,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:43:18,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:43:18,051 INFO L229 MonitoredProcess]: Starting monitored process 355 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:43:18,053 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (355)] Waiting until timeout for monitored process [2022-11-20 09:43:18,967 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 09:43:18,967 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:43:18,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 1807 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-20 09:43:18,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:43:19,148 INFO L134 CoverageAnalysis]: Checked inductivity of 38477 backedges. 8764 proven. 13 refuted. 0 times theorem prover too weak. 29700 trivial. 0 not checked. [2022-11-20 09:43:19,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:43:20,125 INFO L134 CoverageAnalysis]: Checked inductivity of 38477 backedges. 1630 proven. 170 refuted. 0 times theorem prover too weak. 36677 trivial. 0 not checked. [2022-11-20 09:43:20,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:43:20,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232969860] [2022-11-20 09:43:20,125 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 09:43:20,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201470090] [2022-11-20 09:43:20,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201470090] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:43:20,125 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:43:20,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 14 [2022-11-20 09:43:20,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839151113] [2022-11-20 09:43:20,126 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:43:20,127 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-20 09:43:20,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:43:20,128 INFO L85 PathProgramCache]: Analyzing trace with hash -379076557, now seen corresponding path program 41 times [2022-11-20 09:43:20,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:43:20,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565456795] [2022-11-20 09:43:20,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:43:20,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:43:20,144 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:43:20,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [219372609] [2022-11-20 09:43:20,145 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-20 09:43:20,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:43:20,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:43:20,169 INFO L229 MonitoredProcess]: Starting monitored process 356 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:43:20,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (356)] Waiting until timeout for monitored process [2022-11-20 09:43:21,026 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2022-11-20 09:43:21,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:43:21,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 995 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-20 09:43:21,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:43:21,302 INFO L134 CoverageAnalysis]: Checked inductivity of 23407 backedges. 9830 proven. 168 refuted. 0 times theorem prover too weak. 13409 trivial. 0 not checked. [2022-11-20 09:43:21,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:43:23,681 INFO L134 CoverageAnalysis]: Checked inductivity of 23407 backedges. 740 proven. 3502 refuted. 0 times theorem prover too weak. 19165 trivial. 0 not checked. [2022-11-20 09:43:23,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:43:23,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565456795] [2022-11-20 09:43:23,681 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 09:43:23,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219372609] [2022-11-20 09:43:23,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219372609] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:43:23,681 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:43:23,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 22] total 25 [2022-11-20 09:43:23,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448814936] [2022-11-20 09:43:23,682 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:43:23,683 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 09:43:23,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:43:23,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-20 09:43:23,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2022-11-20 09:43:23,684 INFO L87 Difference]: Start difference. First operand 5501 states and 8670 transitions. cyclomatic complexity: 3230 Second operand has 25 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 22 states have internal predecessors, (67), 15 states have call successors, (30), 2 states have call predecessors, (30), 11 states have return successors, (37), 13 states have call predecessors, (37), 15 states have call successors, (37) [2022-11-20 09:43:25,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:43:25,053 INFO L93 Difference]: Finished difference Result 6654 states and 10374 transitions. [2022-11-20 09:43:25,053 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6654 states and 10374 transitions. [2022-11-20 09:43:25,094 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 710 [2022-11-20 09:43:25,142 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6654 states to 6649 states and 10369 transitions. [2022-11-20 09:43:25,142 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 632 [2022-11-20 09:43:25,142 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 632 [2022-11-20 09:43:25,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6649 states and 10369 transitions. [2022-11-20 09:43:25,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 09:43:25,143 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6649 states and 10369 transitions. [2022-11-20 09:43:25,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6649 states and 10369 transitions. [2022-11-20 09:43:25,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6649 to 5531. [2022-11-20 09:43:25,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5531 states, 3437 states have (on average 1.0436427116671516) internal successors, (3587), 3413 states have internal predecessors, (3587), 1477 states have call successors, (1523), 713 states have call predecessors, (1523), 617 states have return successors, (3691), 1404 states have call predecessors, (3691), 1477 states have call successors, (3691) [2022-11-20 09:43:25,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5531 states to 5531 states and 8801 transitions. [2022-11-20 09:43:25,300 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5531 states and 8801 transitions. [2022-11-20 09:43:25,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 09:43:25,301 INFO L428 stractBuchiCegarLoop]: Abstraction has 5531 states and 8801 transitions. [2022-11-20 09:43:25,301 INFO L335 stractBuchiCegarLoop]: ======== Iteration 69 ============ [2022-11-20 09:43:25,301 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5531 states and 8801 transitions. [2022-11-20 09:43:25,318 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 544 [2022-11-20 09:43:25,318 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 09:43:25,318 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 09:43:25,322 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [127, 127, 76, 76, 76, 76, 51, 17, 16, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 7, 7, 7, 7, 7, 6, 6, 4, 3, 3, 1, 1, 1, 1] [2022-11-20 09:43:25,322 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [94, 94, 73, 73, 73, 73, 21, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:43:25,323 INFO L748 eck$LassoCheckResult]: Stem: 841439#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 841414#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; 841415#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 841438#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; 841462#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 845749#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 845746#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; 841405#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 841406#factENTRY ~n := #in~n; 845776#L25 assume ~n <= 0;#res := 1; 845775#factFINAL assume true; 845774#factEXIT >#68#return; 841456#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 841457#factENTRY ~n := #in~n; 845812#L25 assume ~n <= 0;#res := 1; 845811#factFINAL assume true; 845809#factEXIT >#70#return; 841399#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 841400#factENTRY ~n := #in~n; 845840#L25 assume ~n <= 0;#res := 1; 845839#factFINAL assume true; 845838#factEXIT >#72#return; 841434#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; 841435#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 841437#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 846383#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 841442#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; 841443#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 846381#factENTRY ~n := #in~n; 846402#L25 assume !(~n <= 0); 846396#L26 call #t~ret0 := fact(~n - 1);< 846397#factENTRY ~n := #in~n; 846401#L25 assume ~n <= 0;#res := 1; 846400#factFINAL assume true; 846395#factEXIT >#66#return; 846393#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 846390#factFINAL assume true; 846380#factEXIT >#74#return; 846377#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 846379#factENTRY ~n := #in~n; 846510#L25 assume ~n <= 0;#res := 1; 846509#factFINAL assume true; 846376#factEXIT >#76#return; 846378#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 846406#factENTRY ~n := #in~n; 846417#L25 assume !(~n <= 0); 846414#L26 call #t~ret0 := fact(~n - 1);< 846415#factENTRY ~n := #in~n; 846422#L25 assume ~n <= 0;#res := 1; 846420#factFINAL assume true; 846413#factEXIT >#66#return; 846411#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 846409#factFINAL assume true; 846405#factEXIT >#78#return; 846404#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; 846403#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 846302#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 846297#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 846298#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; 846266#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 846269#factENTRY ~n := #in~n; 846287#L25 assume !(~n <= 0); 846277#L26 call #t~ret0 := fact(~n - 1);< 846282#factENTRY ~n := #in~n; 846292#L25 assume !(~n <= 0); 846279#L26 call #t~ret0 := fact(~n - 1);< 846290#factENTRY ~n := #in~n; 846293#L25 assume ~n <= 0;#res := 1; 846291#factFINAL assume true; 846289#factEXIT >#66#return; 846288#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 846283#factFINAL assume true; 846275#factEXIT >#66#return; 846274#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 846272#factFINAL assume true; 846262#factEXIT >#74#return; 846268#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 846163#factENTRY ~n := #in~n; 846541#L25 assume ~n <= 0;#res := 1; 846533#factFINAL assume true; 846531#factEXIT >#76#return; 846524#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 846528#factENTRY ~n := #in~n; 846546#L25 assume !(~n <= 0); 846535#L26 call #t~ret0 := fact(~n - 1);< 846540#factENTRY ~n := #in~n; 846551#L25 assume !(~n <= 0); 846537#L26 call #t~ret0 := fact(~n - 1);< 846549#factENTRY ~n := #in~n; 846553#L25 assume ~n <= 0;#res := 1; 846550#factFINAL assume true; 846548#factEXIT >#66#return; 846547#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 846542#factFINAL assume true; 846534#factEXIT >#66#return; 846532#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 846530#factFINAL assume true; 846523#factEXIT >#78#return; 846521#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; 846520#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 846516#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 846503#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 846493#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; 845820#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 845962#factENTRY ~n := #in~n; 845960#L25 assume !(~n <= 0); 845951#L26 call #t~ret0 := fact(~n - 1);< 845953#factENTRY ~n := #in~n; 846083#L25 assume !(~n <= 0); 845952#L26 call #t~ret0 := fact(~n - 1);< 846072#factENTRY ~n := #in~n; 846083#L25 assume !(~n <= 0); 845952#L26 call #t~ret0 := fact(~n - 1);< 846072#factENTRY ~n := #in~n; 846086#L25 assume ~n <= 0;#res := 1; 846085#factFINAL assume true; 846084#factEXIT >#66#return; 846082#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 846079#factFINAL assume true; 846080#factEXIT >#66#return; 846096#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 846099#factFINAL assume true; 845950#factEXIT >#66#return; 845948#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 845949#factFINAL assume true; 845819#factEXIT >#74#return; 845821#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 846011#factENTRY ~n := #in~n; 846030#L25 assume ~n <= 0;#res := 1; 846029#factFINAL assume true; 846010#factEXIT >#76#return; 846002#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 846006#factENTRY ~n := #in~n; 846004#L25 assume !(~n <= 0); 845973#L26 call #t~ret0 := fact(~n - 1);< 846003#factENTRY ~n := #in~n; 846042#L25 assume !(~n <= 0); 845970#L26 call #t~ret0 := fact(~n - 1);< 845984#factENTRY ~n := #in~n; 846040#L25 assume !(~n <= 0); 845967#L26 call #t~ret0 := fact(~n - 1);< 846039#factENTRY ~n := #in~n; 846043#L25 assume ~n <= 0;#res := 1; 846041#factFINAL assume true; 846038#factEXIT >#66#return; 846037#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 846036#factFINAL assume true; 846034#factEXIT >#66#return; 846032#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 846031#factFINAL assume true; 846014#factEXIT >#66#return; 845978#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 846127#factFINAL assume true; 846120#factEXIT >#78#return; 844978#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; 844972#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 844970#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 844968#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 844792#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 844786#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 844785#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 844162#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; 844155#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 844157#factENTRY ~n := #in~n; 844172#L25 assume !(~n <= 0); 844164#L26 call #t~ret0 := fact(~n - 1);< 844165#factENTRY ~n := #in~n; 844175#L25 assume ~n <= 0;#res := 1; 844171#factFINAL assume true; 844163#factEXIT >#66#return; 844160#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 844159#factFINAL assume true; 844154#factEXIT >#68#return; 844150#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 844152#factENTRY ~n := #in~n; 844158#L25 assume ~n <= 0;#res := 1; 844153#factFINAL assume true; 844149#factEXIT >#70#return; 844145#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 844147#factENTRY ~n := #in~n; 844185#L25 assume !(~n <= 0); 844182#L26 call #t~ret0 := fact(~n - 1);< 844183#factENTRY ~n := #in~n; 844188#L25 assume ~n <= 0;#res := 1; 844186#factFINAL assume true; 844181#factEXIT >#66#return; 844180#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 844179#factFINAL assume true; 844143#factEXIT >#72#return; 844146#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; 844148#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 844142#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 844140#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 844138#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; 844098#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 844133#factENTRY ~n := #in~n; 844178#L25 assume !(~n <= 0); 844084#L26 call #t~ret0 := fact(~n - 1);< 844099#factENTRY ~n := #in~n; 844103#L25 assume ~n <= 0;#res := 1; 844104#factFINAL assume true; 844083#factEXIT >#66#return; 844089#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 844136#factFINAL assume true; 844132#factEXIT >#68#return; 844116#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 844128#factENTRY ~n := #in~n; 844192#L25 assume !(~n <= 0); 844190#L26 call #t~ret0 := fact(~n - 1);< 844191#factENTRY ~n := #in~n; 844194#L25 assume ~n <= 0;#res := 1; 844193#factFINAL assume true; 844189#factEXIT >#66#return; 844187#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 844130#factFINAL assume true; 844127#factEXIT >#70#return; 844124#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 844126#factENTRY ~n := #in~n; 844184#L25 assume ~n <= 0;#res := 1; 844131#factFINAL assume true; 844122#factEXIT >#72#return; 844121#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; 844120#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 844119#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 844118#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 844117#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; 844072#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 844111#factENTRY ~n := #in~n; 844110#L25 assume !(~n <= 0); 844090#L26 call #t~ret0 := fact(~n - 1);< 844091#factENTRY ~n := #in~n; 844109#L25 assume !(~n <= 0); 844095#L26 call #t~ret0 := fact(~n - 1);< 844107#factENTRY ~n := #in~n; 844609#L25 assume ~n <= 0;#res := 1; 844108#factFINAL assume true; 844106#factEXIT >#66#return; 844105#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 844094#factFINAL assume true; 844096#factEXIT >#66#return; 844079#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 844080#factFINAL assume true; 844070#factEXIT >#74#return; 843961#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 843962#factENTRY ~n := #in~n; 844569#L25 assume !(~n <= 0); 844469#L26 call #t~ret0 := fact(~n - 1);< 844476#factENTRY ~n := #in~n; 844480#L25 assume ~n <= 0;#res := 1; 844478#factFINAL assume true; 844468#factEXIT >#66#return; 844473#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 844800#factFINAL assume true; 844799#factEXIT >#76#return; 843954#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 843957#factENTRY ~n := #in~n; 843979#L25 assume !(~n <= 0); 843974#L26 call #t~ret0 := fact(~n - 1);< 843975#factENTRY ~n := #in~n; 843981#L25 assume ~n <= 0;#res := 1; 843978#factFINAL assume true; 843973#factEXIT >#66#return; 843969#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 843964#factFINAL assume true; 843953#factEXIT >#78#return; 843947#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; 843945#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 843943#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 843941#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 843939#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; 842302#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 842304#factENTRY ~n := #in~n; 842326#L25 assume !(~n <= 0); 842317#L26 call #t~ret0 := fact(~n - 1);< 842319#factENTRY ~n := #in~n; 842340#L25 assume !(~n <= 0); 842318#L26 call #t~ret0 := fact(~n - 1);< 842335#factENTRY ~n := #in~n; 842340#L25 assume !(~n <= 0); 842318#L26 call #t~ret0 := fact(~n - 1);< 842335#factENTRY ~n := #in~n; 842345#L25 assume ~n <= 0;#res := 1; 842344#factFINAL assume true; 842343#factEXIT >#66#return; 842342#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842339#factFINAL assume true; 842334#factEXIT >#66#return; 842331#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842325#factFINAL assume true; 842316#factEXIT >#66#return; 842314#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842312#factFINAL assume true; 842299#factEXIT >#74#return; 842174#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 842274#factENTRY ~n := #in~n; 842288#L25 assume !(~n <= 0); 842280#L26 call #t~ret0 := fact(~n - 1);< 842283#factENTRY ~n := #in~n; 842294#L25 assume ~n <= 0;#res := 1; 842285#factFINAL assume true; 842279#factEXIT >#66#return; 842276#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842273#factFINAL assume true; 842172#factEXIT >#76#return; 842177#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 842085#factENTRY ~n := #in~n; 843854#L25 assume !(~n <= 0); 842209#L26 call #t~ret0 := fact(~n - 1);< 842222#factENTRY ~n := #in~n; 842270#L25 assume !(~n <= 0); 842217#L26 call #t~ret0 := fact(~n - 1);< 842272#factENTRY ~n := #in~n; 842235#L25 assume ~n <= 0;#res := 1; 842233#factFINAL assume true; 842229#factEXIT >#66#return; 842228#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842223#factFINAL assume true; 842208#factEXIT >#66#return; 842220#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842198#factFINAL assume true; 842199#factEXIT >#78#return; 842083#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; 845385#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 845378#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 845376#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 845375#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 845373#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 845372#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 845371#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; 842027#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 842030#factENTRY ~n := #in~n; 842057#L25 assume !(~n <= 0); 842053#L26 call #t~ret0 := fact(~n - 1);< 842055#factENTRY ~n := #in~n; 842103#L25 assume !(~n <= 0); 842052#L26 call #t~ret0 := fact(~n - 1);< 842100#factENTRY ~n := #in~n; 842107#L25 assume ~n <= 0;#res := 1; 842106#factFINAL assume true; 842105#factEXIT >#66#return; 842102#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842099#factFINAL assume true; 842050#factEXIT >#66#return; 842049#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842035#factFINAL assume true; 842023#factEXIT >#68#return; 842029#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 842021#factENTRY ~n := #in~n; 845370#L25 assume ~n <= 0;#res := 1; 845369#factFINAL assume true; 845366#factEXIT >#70#return; 845362#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 845365#factENTRY ~n := #in~n; 845386#L25 assume !(~n <= 0); 845380#L26 call #t~ret0 := fact(~n - 1);< 845384#factENTRY ~n := #in~n; 845706#L25 assume !(~n <= 0); 845382#L26 call #t~ret0 := fact(~n - 1);< 845705#factENTRY ~n := #in~n; 845413#L25 assume ~n <= 0;#res := 1; 845411#factFINAL assume true; 845393#factEXIT >#66#return; 845391#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 845387#factFINAL assume true; 845379#factEXIT >#66#return; 845377#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 845374#factFINAL assume true; 845361#factEXIT >#72#return; 845364#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; 845729#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 845727#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 845724#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 845718#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; 845268#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 845272#factENTRY ~n := #in~n; 845532#L25 assume !(~n <= 0); 845310#L26 call #t~ret0 := fact(~n - 1);< 845311#factENTRY ~n := #in~n; 845320#L25 assume !(~n <= 0); 845317#L26 call #t~ret0 := fact(~n - 1);< 845318#factENTRY ~n := #in~n; 845328#L25 assume ~n <= 0;#res := 1; 845327#factFINAL assume true; 845316#factEXIT >#66#return; 845314#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 845313#factFINAL assume true; 845309#factEXIT >#66#return; 845308#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 845273#factFINAL assume true; 845265#factEXIT >#68#return; 845270#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 845347#factENTRY ~n := #in~n; 845360#L25 assume !(~n <= 0); 845356#L26 call #t~ret0 := fact(~n - 1);< 845358#factENTRY ~n := #in~n; 845417#L25 assume ~n <= 0;#res := 1; 845412#factFINAL assume true; 845354#factEXIT >#66#return; 845352#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 845349#factFINAL assume true; 845346#factEXIT >#70#return; 845343#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 845345#factENTRY ~n := #in~n; 845414#L25 assume !(~n <= 0); 845355#L26 call #t~ret0 := fact(~n - 1);< 845358#factENTRY ~n := #in~n; 845417#L25 assume ~n <= 0;#res := 1; 845412#factFINAL assume true; 845354#factEXIT >#66#return; 845357#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 845422#factFINAL assume true; 845341#factEXIT >#72#return; 845344#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; 845407#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 845405#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 845404#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 845285#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; 845269#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 845272#factENTRY ~n := #in~n; 845532#L25 assume !(~n <= 0); 845310#L26 call #t~ret0 := fact(~n - 1);< 845311#factENTRY ~n := #in~n; 845320#L25 assume !(~n <= 0); 845317#L26 call #t~ret0 := fact(~n - 1);< 845318#factENTRY ~n := #in~n; 845328#L25 assume ~n <= 0;#res := 1; 845327#factFINAL assume true; 845316#factEXIT >#66#return; 845314#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 845313#factFINAL assume true; 845309#factEXIT >#66#return; 845308#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 845273#factFINAL assume true; 845265#factEXIT >#68#return; 845263#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 845264#factENTRY ~n := #in~n; 845324#L25 assume !(~n <= 0); 845249#L26 call #t~ret0 := fact(~n - 1);< 845253#factENTRY ~n := #in~n; 845403#L25 assume !(~n <= 0); 845399#L26 call #t~ret0 := fact(~n - 1);< 845401#factENTRY ~n := #in~n; 845408#L25 assume ~n <= 0;#res := 1; 845406#factFINAL assume true; 845398#factEXIT >#66#return; 845396#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 845287#factFINAL assume true; 845245#factEXIT >#66#return; 845252#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 845274#factFINAL assume true; 845261#factEXIT >#70#return; 845258#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 845260#factENTRY ~n := #in~n; 845312#L25 assume ~n <= 0;#res := 1; 845307#factFINAL assume true; 845256#factEXIT >#72#return; 845259#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; 845446#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 845445#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 845444#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 845441#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; 845153#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 845439#factENTRY ~n := #in~n; 845438#L25 assume !(~n <= 0); 845430#L26 call #t~ret0 := fact(~n - 1);< 845432#factENTRY ~n := #in~n; 845701#L25 assume !(~n <= 0); 845428#L26 call #t~ret0 := fact(~n - 1);< 845553#factENTRY ~n := #in~n; 845701#L25 assume !(~n <= 0); 845428#L26 call #t~ret0 := fact(~n - 1);< 845553#factENTRY ~n := #in~n; 845739#L25 assume ~n <= 0;#res := 1; 845737#factFINAL assume true; 845700#factEXIT >#66#return; 845699#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 845697#factFINAL assume true; 845552#factEXIT >#66#return; 845528#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 845437#factFINAL assume true; 845427#factEXIT >#66#return; 845431#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 845713#factFINAL assume true; 845711#factEXIT >#74#return; 845018#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 845019#factENTRY ~n := #in~n; 845164#L25 assume !(~n <= 0); 844988#L26 call #t~ret0 := fact(~n - 1);< 845012#factENTRY ~n := #in~n; 845010#L25 assume !(~n <= 0); 845007#L26 call #t~ret0 := fact(~n - 1);< 845009#factENTRY ~n := #in~n; 845015#L25 assume ~n <= 0;#res := 1; 845014#factFINAL assume true; 845006#factEXIT >#66#return; 845004#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 844984#factFINAL assume true; 845000#factEXIT >#66#return; 845075#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 845279#factFINAL assume true; 845162#factEXIT >#76#return; 843899#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 845013#factENTRY ~n := #in~n; 845011#L25 assume !(~n <= 0); 844974#L26 call #t~ret0 := fact(~n - 1);< 845005#factENTRY ~n := #in~n; 845002#L25 assume ~n <= 0;#res := 1; 845003#factFINAL assume true; 844973#factEXIT >#66#return; 844971#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 844830#factFINAL assume true; 843898#factEXIT >#78#return; 843879#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; 843878#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 843877#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 843875#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 843869#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 842207#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 842204#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 842147#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; 842136#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 842138#factENTRY ~n := #in~n; 842161#L25 assume !(~n <= 0); 842051#L26 call #t~ret0 := fact(~n - 1);< 842055#factENTRY ~n := #in~n; 842103#L25 assume !(~n <= 0); 842052#L26 call #t~ret0 := fact(~n - 1);< 842100#factENTRY ~n := #in~n; 842103#L25 assume !(~n <= 0); 842052#L26 call #t~ret0 := fact(~n - 1);< 842100#factENTRY ~n := #in~n; 842107#L25 assume ~n <= 0;#res := 1; 842106#factFINAL assume true; 842105#factEXIT >#66#return; 842102#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842099#factFINAL assume true; 842050#factEXIT >#66#return; 842054#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842167#factFINAL assume true; 842160#factEXIT >#66#return; 842158#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842145#factFINAL assume true; 842135#factEXIT >#68#return; 842017#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 842022#factENTRY ~n := #in~n; 842033#L25 assume ~n <= 0;#res := 1; 842031#factFINAL assume true; 842014#factEXIT >#70#return; 842019#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 842131#factENTRY ~n := #in~n; 842168#L25 assume !(~n <= 0); 842077#L26 call #t~ret0 := fact(~n - 1);< 842166#factENTRY ~n := #in~n; 842181#L25 assume !(~n <= 0); 842064#L26 call #t~ret0 := fact(~n - 1);< 842078#factENTRY ~n := #in~n; 843867#L25 assume !(~n <= 0); 842096#L26 call #t~ret0 := fact(~n - 1);< 842116#factENTRY ~n := #in~n; 842115#L25 assume ~n <= 0;#res := 1; 842114#factFINAL assume true; 842095#factEXIT >#66#return; 842094#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842075#factFINAL assume true; 842062#factEXIT >#66#return; 842068#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842169#factFINAL assume true; 842164#factEXIT >#66#return; 842163#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842162#factFINAL assume true; 842129#factEXIT >#72#return; 842130#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; 842203#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 842202#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 842201#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 842200#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; 841886#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 841890#factENTRY ~n := #in~n; 841889#L25 assume !(~n <= 0); 841803#L26 call #t~ret0 := fact(~n - 1);< 841880#factENTRY ~n := #in~n; 841879#L25 assume !(~n <= 0); 841598#L26 call #t~ret0 := fact(~n - 1);< 841510#factENTRY ~n := #in~n; 841605#L25 assume !(~n <= 0); 841586#L26 call #t~ret0 := fact(~n - 1);< 841600#factENTRY ~n := #in~n; 841602#L25 assume ~n <= 0;#res := 1; 841601#factFINAL assume true; 841583#factEXIT >#66#return; 841591#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 841871#factFINAL assume true; 841839#factEXIT >#66#return; 841838#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 841815#factFINAL assume true; 841802#factEXIT >#66#return; 841806#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 841902#factFINAL assume true; 841898#factEXIT >#68#return; 841900#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 842112#factENTRY ~n := #in~n; 842127#L25 assume !(~n <= 0); 841606#L26 call #t~ret0 := fact(~n - 1);< 842123#factENTRY ~n := #in~n; 841909#L25 assume ~n <= 0;#res := 1; 841955#factFINAL assume true; 841947#factEXIT >#66#return; 841952#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842113#factFINAL assume true; 842111#factEXIT >#70#return; 841873#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 841910#factENTRY ~n := #in~n; 841907#L25 assume !(~n <= 0); 841599#L26 call #t~ret0 := fact(~n - 1);< 841875#factENTRY ~n := #in~n; 841605#L25 assume !(~n <= 0); 841586#L26 call #t~ret0 := fact(~n - 1);< 841600#factENTRY ~n := #in~n; 841602#L25 assume ~n <= 0;#res := 1; 841601#factFINAL assume true; 841583#factEXIT >#66#return; 841591#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 841871#factFINAL assume true; 841839#factEXIT >#66#return; 841841#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842108#factFINAL assume true; 841988#factEXIT >#72#return; 841972#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; 841971#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 841970#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 841969#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 841968#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; 841887#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 841890#factENTRY ~n := #in~n; 841889#L25 assume !(~n <= 0); 841803#L26 call #t~ret0 := fact(~n - 1);< 841880#factENTRY ~n := #in~n; 841879#L25 assume !(~n <= 0); 841598#L26 call #t~ret0 := fact(~n - 1);< 841510#factENTRY ~n := #in~n; 841605#L25 assume !(~n <= 0); 841586#L26 call #t~ret0 := fact(~n - 1);< 841600#factENTRY ~n := #in~n; 841602#L25 assume ~n <= 0;#res := 1; 841601#factFINAL assume true; 841583#factEXIT >#66#return; 841591#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 841871#factFINAL assume true; 841839#factEXIT >#66#return; 841838#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 841815#factFINAL assume true; 841802#factEXIT >#66#return; 841806#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 841902#factFINAL assume true; 841898#factEXIT >#68#return; 841822#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 841482#factENTRY ~n := #in~n; 841845#L25 assume !(~n <= 0); 841607#L26 call #t~ret0 := fact(~n - 1);< 841823#factENTRY ~n := #in~n; 841611#L25 assume !(~n <= 0); 841584#L26 call #t~ret0 := fact(~n - 1);< 841609#factENTRY ~n := #in~n; 841602#L25 assume ~n <= 0;#res := 1; 841601#factFINAL assume true; 841583#factEXIT >#66#return; 841591#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 841871#factFINAL assume true; 841839#factEXIT >#66#return; 841843#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 841965#factFINAL assume true; 841929#factEXIT >#70#return; 841924#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 841927#factENTRY ~n := #in~n; 841954#L25 assume !(~n <= 0); 841949#L26 call #t~ret0 := fact(~n - 1);< 841953#factENTRY ~n := #in~n; 841909#L25 assume ~n <= 0;#res := 1; 841955#factFINAL assume true; 841947#factEXIT >#66#return; 841946#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 841945#factFINAL assume true; 841923#factEXIT >#72#return; 841921#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; 841919#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 841918#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 841917#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 841916#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; 841884#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 841890#factENTRY ~n := #in~n; 841889#L25 assume !(~n <= 0); 841803#L26 call #t~ret0 := fact(~n - 1);< 841880#factENTRY ~n := #in~n; 841879#L25 assume !(~n <= 0); 841598#L26 call #t~ret0 := fact(~n - 1);< 841510#factENTRY ~n := #in~n; 841605#L25 assume !(~n <= 0); 841586#L26 call #t~ret0 := fact(~n - 1);< 841600#factENTRY ~n := #in~n; 841602#L25 assume ~n <= 0;#res := 1; 841601#factFINAL assume true; 841583#factEXIT >#66#return; 841591#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 841871#factFINAL assume true; 841839#factEXIT >#66#return; 841838#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 841815#factFINAL assume true; 841802#factEXIT >#66#return; 841806#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 841902#factFINAL assume true; 841898#factEXIT >#68#return; 841821#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 841482#factENTRY ~n := #in~n; 841845#L25 assume !(~n <= 0); 841607#L26 call #t~ret0 := fact(~n - 1);< 841823#factENTRY ~n := #in~n; 841611#L25 assume !(~n <= 0); 841584#L26 call #t~ret0 := fact(~n - 1);< 841609#factENTRY ~n := #in~n; 841602#L25 assume ~n <= 0;#res := 1; 841601#factFINAL assume true; 841583#factEXIT >#66#return; 841591#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 841871#factFINAL assume true; 841839#factEXIT >#66#return; 841843#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 841965#factFINAL assume true; 841929#factEXIT >#70#return; 841931#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 842496#factENTRY ~n := #in~n; 842572#L25 assume ~n <= 0;#res := 1; 842571#factFINAL assume true; 842494#factEXIT >#72#return; 842495#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; 843325#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 843323#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 843322#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 843321#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; 842487#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 843317#factENTRY ~n := #in~n; 843315#L25 assume !(~n <= 0); 842897#L26 call #t~ret0 := fact(~n - 1);< 843314#factENTRY ~n := #in~n; 843880#L25 assume !(~n <= 0); 842896#L26 call #t~ret0 := fact(~n - 1);< 843320#factENTRY ~n := #in~n; 843343#L25 assume !(~n <= 0); 842890#L26 call #t~ret0 := fact(~n - 1);< 843341#factENTRY ~n := #in~n; 843343#L25 assume !(~n <= 0); 842890#L26 call #t~ret0 := fact(~n - 1);< 843341#factENTRY ~n := #in~n; 843345#L25 assume ~n <= 0;#res := 1; 843344#factFINAL assume true; 843340#factEXIT >#66#return; 843338#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 843337#factFINAL assume true; 843333#factEXIT >#66#return; 843331#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 843326#factFINAL assume true; 843318#factEXIT >#66#return; 843316#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 843313#factFINAL assume true; 843309#factEXIT >#66#return; 843310#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 843385#factFINAL assume true; 843382#factEXIT >#74#return; 843376#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 843377#factENTRY ~n := #in~n; 843388#L25 assume !(~n <= 0); 842923#L26 call #t~ret0 := fact(~n - 1);< 842941#factENTRY ~n := #in~n; 843003#L25 assume !(~n <= 0); 842968#L26 call #t~ret0 := fact(~n - 1);< 842998#factENTRY ~n := #in~n; 843413#L25 assume !(~n <= 0); 841419#L26 call #t~ret0 := fact(~n - 1);< 843395#factENTRY ~n := #in~n; 843547#L25 assume !(~n <= 0); 841418#L26 call #t~ret0 := fact(~n - 1);< 841422#factENTRY ~n := #in~n; 843416#L25 assume ~n <= 0;#res := 1; 843415#factFINAL assume true; 843393#factEXIT >#66#return; 843391#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842977#factFINAL assume true; 842967#factEXIT >#66#return; 842971#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 843404#factFINAL assume true; 842993#factEXIT >#66#return; 842992#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842956#factFINAL assume true; 842907#factEXIT >#66#return; 842938#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 843390#factFINAL assume true; 843375#factEXIT >#76#return; 842830#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 843374#factENTRY ~n := #in~n; 843372#L25 assume !(~n <= 0); 843366#L26 call #t~ret0 := fact(~n - 1);< 843369#factENTRY ~n := #in~n; 843373#L25 assume ~n <= 0;#res := 1; 843371#factFINAL assume true; 843365#factEXIT >#66#return; 843368#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 843678#factFINAL assume true; 842828#factEXIT >#78#return; 842820#L30-8 [2022-11-20 09:43:25,323 INFO L750 eck$LassoCheckResult]: Loop: 842820#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; 842818#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 842816#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 842814#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 842812#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 842810#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 842809#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 842808#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; 842652#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 842658#factENTRY ~n := #in~n; 842999#L25 assume !(~n <= 0); 842668#L26 call #t~ret0 := fact(~n - 1);< 842694#factENTRY ~n := #in~n; 842749#L25 assume !(~n <= 0); 842674#L26 call #t~ret0 := fact(~n - 1);< 842748#factENTRY ~n := #in~n; 842747#L25 assume !(~n <= 0); 842677#L26 call #t~ret0 := fact(~n - 1);< 842743#factENTRY ~n := #in~n; 842741#L25 assume !(~n <= 0); 842673#L26 call #t~ret0 := fact(~n - 1);< 842707#factENTRY ~n := #in~n; 842724#L25 assume !(~n <= 0); 842676#L26 call #t~ret0 := fact(~n - 1);< 842723#factENTRY ~n := #in~n; 842727#L25 assume ~n <= 0;#res := 1; 842725#factFINAL assume true; 842722#factEXIT >#66#return; 842721#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842719#factFINAL assume true; 842713#factEXIT >#66#return; 842711#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842710#factFINAL assume true; 842706#factEXIT >#66#return; 842705#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842703#factFINAL assume true; 842699#factEXIT >#66#return; 842698#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842692#factFINAL assume true; 842666#factEXIT >#66#return; 842664#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842661#factFINAL assume true; 842650#factEXIT >#68#return; 842635#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 842649#factENTRY ~n := #in~n; 842697#L25 assume ~n <= 0;#res := 1; 842695#factFINAL assume true; 842634#factEXIT >#70#return; 842630#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 842633#factENTRY ~n := #in~n; 842738#L25 assume !(~n <= 0); 842734#L26 call #t~ret0 := fact(~n - 1);< 842737#factENTRY ~n := #in~n; 842955#L25 assume !(~n <= 0); 842171#L26 call #t~ret0 := fact(~n - 1);< 842952#factENTRY ~n := #in~n; 843866#L25 assume !(~n <= 0); 842076#L26 call #t~ret0 := fact(~n - 1);< 842166#factENTRY ~n := #in~n; 842181#L25 assume !(~n <= 0); 842064#L26 call #t~ret0 := fact(~n - 1);< 842078#factENTRY ~n := #in~n; 843867#L25 assume !(~n <= 0); 842096#L26 call #t~ret0 := fact(~n - 1);< 842116#factENTRY ~n := #in~n; 842115#L25 assume ~n <= 0;#res := 1; 842114#factFINAL assume true; 842095#factEXIT >#66#return; 842094#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842075#factFINAL assume true; 842062#factEXIT >#66#return; 842068#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842169#factFINAL assume true; 842164#factEXIT >#66#return; 842165#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842954#factFINAL assume true; 842950#factEXIT >#66#return; 842951#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842739#factFINAL assume true; 842733#factEXIT >#66#return; 842732#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842731#factFINAL assume true; 842629#factEXIT >#72#return; 842632#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; 842686#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 842685#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 842683#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 842681#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; 841535#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 842444#factENTRY ~n := #in~n; 842442#L25 assume !(~n <= 0); 842412#L26 call #t~ret0 := fact(~n - 1);< 842432#factENTRY ~n := #in~n; 842431#L25 assume !(~n <= 0); 841778#L26 call #t~ret0 := fact(~n - 1);< 842430#factENTRY ~n := #in~n; 842463#L25 assume !(~n <= 0); 841777#L26 call #t~ret0 := fact(~n - 1);< 842453#factENTRY ~n := #in~n; 843285#L25 assume !(~n <= 0); 841596#L26 call #t~ret0 := fact(~n - 1);< 841786#factENTRY ~n := #in~n; 841894#L25 assume !(~n <= 0); 841588#L26 call #t~ret0 := fact(~n - 1);< 841597#factENTRY ~n := #in~n; 841602#L25 assume ~n <= 0;#res := 1; 841601#factFINAL assume true; 841583#factEXIT >#66#return; 841591#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 841871#factFINAL assume true; 841839#factEXIT >#66#return; 841838#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 841815#factFINAL assume true; 841802#factEXIT >#66#return; 841798#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 841791#factFINAL assume true; 841767#factEXIT >#66#return; 841782#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842464#factFINAL assume true; 842450#factEXIT >#66#return; 842452#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842516#factFINAL assume true; 842514#factEXIT >#68#return; 841963#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 842606#factENTRY ~n := #in~n; 843861#L25 assume !(~n <= 0); 841948#L26 call #t~ret0 := fact(~n - 1);< 841953#factENTRY ~n := #in~n; 841909#L25 assume ~n <= 0;#res := 1; 841955#factFINAL assume true; 841947#factEXIT >#66#return; 841950#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842616#factFINAL assume true; 842605#factEXIT >#70#return; 842468#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 842513#factENTRY ~n := #in~n; 842512#L25 assume !(~n <= 0); 841772#L26 call #t~ret0 := fact(~n - 1);< 841792#factENTRY ~n := #in~n; 842801#L25 assume !(~n <= 0); 841769#L26 call #t~ret0 := fact(~n - 1);< 841810#factENTRY ~n := #in~n; 843242#L25 assume !(~n <= 0); 841608#L26 call #t~ret0 := fact(~n - 1);< 841823#factENTRY ~n := #in~n; 841611#L25 assume !(~n <= 0); 841584#L26 call #t~ret0 := fact(~n - 1);< 841609#factENTRY ~n := #in~n; 841602#L25 assume ~n <= 0;#res := 1; 841601#factFINAL assume true; 841583#factEXIT >#66#return; 841591#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 841871#factFINAL assume true; 841839#factEXIT >#66#return; 841838#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 841815#factFINAL assume true; 841802#factEXIT >#66#return; 841798#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 841791#factFINAL assume true; 841767#factEXIT >#66#return; 841783#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842625#factFINAL assume true; 842622#factEXIT >#72#return; 842608#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; 843883#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 843882#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 843881#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 843852#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; 841544#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 842444#factENTRY ~n := #in~n; 842442#L25 assume !(~n <= 0); 842412#L26 call #t~ret0 := fact(~n - 1);< 842432#factENTRY ~n := #in~n; 842431#L25 assume !(~n <= 0); 841778#L26 call #t~ret0 := fact(~n - 1);< 842430#factENTRY ~n := #in~n; 842463#L25 assume !(~n <= 0); 841777#L26 call #t~ret0 := fact(~n - 1);< 842453#factENTRY ~n := #in~n; 843285#L25 assume !(~n <= 0); 841596#L26 call #t~ret0 := fact(~n - 1);< 841786#factENTRY ~n := #in~n; 841894#L25 assume !(~n <= 0); 841588#L26 call #t~ret0 := fact(~n - 1);< 841597#factENTRY ~n := #in~n; 841602#L25 assume ~n <= 0;#res := 1; 841601#factFINAL assume true; 841583#factEXIT >#66#return; 841591#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 841871#factFINAL assume true; 841839#factEXIT >#66#return; 841838#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 841815#factFINAL assume true; 841802#factEXIT >#66#return; 841798#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 841791#factFINAL assume true; 841767#factEXIT >#66#return; 841782#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842464#factFINAL assume true; 842450#factEXIT >#66#return; 842452#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842516#factFINAL assume true; 842514#factEXIT >#68#return; 841714#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 841478#factENTRY ~n := #in~n; 842445#L25 assume !(~n <= 0); 841498#L26 call #t~ret0 := fact(~n - 1);< 841819#factENTRY ~n := #in~n; 842499#L25 assume !(~n <= 0); 841495#L26 call #t~ret0 := fact(~n - 1);< 841795#factENTRY ~n := #in~n; 841602#L25 assume ~n <= 0;#res := 1; 841601#factFINAL assume true; 841583#factEXIT >#66#return; 841591#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 841871#factFINAL assume true; 841839#factEXIT >#66#return; 841842#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 841901#factFINAL assume true; 841846#factEXIT >#70#return; 841848#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 842471#factENTRY ~n := #in~n; 842470#L25 assume !(~n <= 0); 841779#L26 call #t~ret0 := fact(~n - 1);< 842453#factENTRY ~n := #in~n; 843285#L25 assume !(~n <= 0); 841596#L26 call #t~ret0 := fact(~n - 1);< 841786#factENTRY ~n := #in~n; 841894#L25 assume !(~n <= 0); 841588#L26 call #t~ret0 := fact(~n - 1);< 841597#factENTRY ~n := #in~n; 841611#L25 assume !(~n <= 0); 841584#L26 call #t~ret0 := fact(~n - 1);< 841609#factENTRY ~n := #in~n; 841602#L25 assume ~n <= 0;#res := 1; 841601#factFINAL assume true; 841583#factEXIT >#66#return; 841591#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 841871#factFINAL assume true; 841839#factEXIT >#66#return; 841838#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 841815#factFINAL assume true; 841802#factEXIT >#66#return; 841798#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 841791#factFINAL assume true; 841767#factEXIT >#66#return; 841783#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842625#factFINAL assume true; 842622#factEXIT >#72#return; 842595#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; 843232#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 843231#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 842965#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 842501#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; 841536#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 842444#factENTRY ~n := #in~n; 842442#L25 assume !(~n <= 0); 842412#L26 call #t~ret0 := fact(~n - 1);< 842432#factENTRY ~n := #in~n; 842431#L25 assume !(~n <= 0); 841778#L26 call #t~ret0 := fact(~n - 1);< 842430#factENTRY ~n := #in~n; 842463#L25 assume !(~n <= 0); 841777#L26 call #t~ret0 := fact(~n - 1);< 842453#factENTRY ~n := #in~n; 843285#L25 assume !(~n <= 0); 841596#L26 call #t~ret0 := fact(~n - 1);< 841786#factENTRY ~n := #in~n; 841894#L25 assume !(~n <= 0); 841588#L26 call #t~ret0 := fact(~n - 1);< 841597#factENTRY ~n := #in~n; 841602#L25 assume ~n <= 0;#res := 1; 841601#factFINAL assume true; 841583#factEXIT >#66#return; 841591#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 841871#factFINAL assume true; 841839#factEXIT >#66#return; 841838#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 841815#factFINAL assume true; 841802#factEXIT >#66#return; 841798#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 841791#factFINAL assume true; 841767#factEXIT >#66#return; 841782#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842464#factFINAL assume true; 842450#factEXIT >#66#return; 842452#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842516#factFINAL assume true; 842514#factEXIT >#68#return; 841747#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 841478#factENTRY ~n := #in~n; 842445#L25 assume !(~n <= 0); 841498#L26 call #t~ret0 := fact(~n - 1);< 841819#factENTRY ~n := #in~n; 842499#L25 assume !(~n <= 0); 841495#L26 call #t~ret0 := fact(~n - 1);< 841795#factENTRY ~n := #in~n; 842499#L25 assume !(~n <= 0); 841495#L26 call #t~ret0 := fact(~n - 1);< 841795#factENTRY ~n := #in~n; 841602#L25 assume ~n <= 0;#res := 1; 841601#factFINAL assume true; 841583#factEXIT >#66#return; 841591#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 841871#factFINAL assume true; 841839#factEXIT >#66#return; 841838#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 841815#factFINAL assume true; 841802#factEXIT >#66#return; 841808#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 841876#factFINAL assume true; 841758#factEXIT >#70#return; 841647#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 842089#factENTRY ~n := #in~n; 842087#L25 assume !(~n <= 0); 841770#L26 call #t~ret0 := fact(~n - 1);< 841980#factENTRY ~n := #in~n; 841903#L25 assume !(~n <= 0); 841585#L26 call #t~ret0 := fact(~n - 1);< 841896#factENTRY ~n := #in~n; 841602#L25 assume ~n <= 0;#res := 1; 841601#factFINAL assume true; 841583#factEXIT >#66#return; 841591#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 841871#factFINAL assume true; 841839#factEXIT >#66#return; 841840#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 841844#factFINAL assume true; 841824#factEXIT >#72#return; 841825#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; 842519#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 842518#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 842517#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 842515#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; 841538#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 842444#factENTRY ~n := #in~n; 842442#L25 assume !(~n <= 0); 842412#L26 call #t~ret0 := fact(~n - 1);< 842432#factENTRY ~n := #in~n; 842431#L25 assume !(~n <= 0); 841778#L26 call #t~ret0 := fact(~n - 1);< 842430#factENTRY ~n := #in~n; 842463#L25 assume !(~n <= 0); 841777#L26 call #t~ret0 := fact(~n - 1);< 842453#factENTRY ~n := #in~n; 843285#L25 assume !(~n <= 0); 841596#L26 call #t~ret0 := fact(~n - 1);< 841786#factENTRY ~n := #in~n; 841894#L25 assume !(~n <= 0); 841588#L26 call #t~ret0 := fact(~n - 1);< 841597#factENTRY ~n := #in~n; 841602#L25 assume ~n <= 0;#res := 1; 841601#factFINAL assume true; 841583#factEXIT >#66#return; 841591#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 841871#factFINAL assume true; 841839#factEXIT >#66#return; 841838#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 841815#factFINAL assume true; 841802#factEXIT >#66#return; 841798#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 841791#factFINAL assume true; 841767#factEXIT >#66#return; 841782#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842464#factFINAL assume true; 842450#factEXIT >#66#return; 842452#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842516#factFINAL assume true; 842514#factEXIT >#68#return; 841740#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 841478#factENTRY ~n := #in~n; 842445#L25 assume !(~n <= 0); 841498#L26 call #t~ret0 := fact(~n - 1);< 841819#factENTRY ~n := #in~n; 842499#L25 assume !(~n <= 0); 841495#L26 call #t~ret0 := fact(~n - 1);< 841795#factENTRY ~n := #in~n; 842499#L25 assume !(~n <= 0); 841495#L26 call #t~ret0 := fact(~n - 1);< 841795#factENTRY ~n := #in~n; 842499#L25 assume !(~n <= 0); 841495#L26 call #t~ret0 := fact(~n - 1);< 841795#factENTRY ~n := #in~n; 842499#L25 assume !(~n <= 0); 841495#L26 call #t~ret0 := fact(~n - 1);< 841795#factENTRY ~n := #in~n; 841602#L25 assume ~n <= 0;#res := 1; 841601#factFINAL assume true; 841583#factEXIT >#66#return; 841591#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 841871#factFINAL assume true; 841839#factEXIT >#66#return; 841838#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 841815#factFINAL assume true; 841802#factEXIT >#66#return; 841798#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 841791#factFINAL assume true; 841767#factEXIT >#66#return; 841782#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842464#factFINAL assume true; 842450#factEXIT >#66#return; 841507#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842461#factFINAL assume true; 842420#factEXIT >#70#return; 841678#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 842088#factENTRY ~n := #in~n; 842086#L25 assume !(~n <= 0); 841770#L26 call #t~ret0 := fact(~n - 1);< 841980#factENTRY ~n := #in~n; 841909#L25 assume ~n <= 0;#res := 1; 841955#factFINAL assume true; 841947#factEXIT >#66#return; 841951#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 841711#factFINAL assume true; 841641#factEXIT >#72#return; 841708#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; 842537#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 842535#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 842534#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 842533#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; 841545#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 842444#factENTRY ~n := #in~n; 842442#L25 assume !(~n <= 0); 842412#L26 call #t~ret0 := fact(~n - 1);< 842432#factENTRY ~n := #in~n; 842431#L25 assume !(~n <= 0); 841778#L26 call #t~ret0 := fact(~n - 1);< 842430#factENTRY ~n := #in~n; 842463#L25 assume !(~n <= 0); 841777#L26 call #t~ret0 := fact(~n - 1);< 842453#factENTRY ~n := #in~n; 843285#L25 assume !(~n <= 0); 841596#L26 call #t~ret0 := fact(~n - 1);< 841786#factENTRY ~n := #in~n; 841894#L25 assume !(~n <= 0); 841588#L26 call #t~ret0 := fact(~n - 1);< 841597#factENTRY ~n := #in~n; 841602#L25 assume ~n <= 0;#res := 1; 841601#factFINAL assume true; 841583#factEXIT >#66#return; 841591#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 841871#factFINAL assume true; 841839#factEXIT >#66#return; 841838#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 841815#factFINAL assume true; 841802#factEXIT >#66#return; 841798#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 841791#factFINAL assume true; 841767#factEXIT >#66#return; 841782#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842464#factFINAL assume true; 842450#factEXIT >#66#return; 842452#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842516#factFINAL assume true; 842514#factEXIT >#68#return; 841734#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 841478#factENTRY ~n := #in~n; 842445#L25 assume !(~n <= 0); 841498#L26 call #t~ret0 := fact(~n - 1);< 841819#factENTRY ~n := #in~n; 842499#L25 assume !(~n <= 0); 841495#L26 call #t~ret0 := fact(~n - 1);< 841795#factENTRY ~n := #in~n; 842499#L25 assume !(~n <= 0); 841495#L26 call #t~ret0 := fact(~n - 1);< 841795#factENTRY ~n := #in~n; 842499#L25 assume !(~n <= 0); 841495#L26 call #t~ret0 := fact(~n - 1);< 841795#factENTRY ~n := #in~n; 842499#L25 assume !(~n <= 0); 841495#L26 call #t~ret0 := fact(~n - 1);< 841795#factENTRY ~n := #in~n; 841602#L25 assume ~n <= 0;#res := 1; 841601#factFINAL assume true; 841583#factEXIT >#66#return; 841591#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 841871#factFINAL assume true; 841839#factEXIT >#66#return; 841838#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 841815#factFINAL assume true; 841802#factEXIT >#66#return; 841798#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 841791#factFINAL assume true; 841767#factEXIT >#66#return; 841782#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842464#factFINAL assume true; 842450#factEXIT >#66#return; 841507#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842461#factFINAL assume true; 842420#factEXIT >#70#return; 842423#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 842557#factENTRY ~n := #in~n; 842558#L25 assume ~n <= 0;#res := 1; 841914#factFINAL assume true; 842551#factEXIT >#72#return; 842556#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; 843288#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 843287#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 843286#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 842878#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; 842716#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 842876#factENTRY ~n := #in~n; 843363#L25 assume !(~n <= 0); 842889#L26 call #t~ret0 := fact(~n - 1);< 843357#factENTRY ~n := #in~n; 843356#L25 assume !(~n <= 0); 842895#L26 call #t~ret0 := fact(~n - 1);< 843355#factENTRY ~n := #in~n; 843353#L25 assume !(~n <= 0); 842894#L26 call #t~ret0 := fact(~n - 1);< 843349#factENTRY ~n := #in~n; 843348#L25 assume !(~n <= 0); 842888#L26 call #t~ret0 := fact(~n - 1);< 843320#factENTRY ~n := #in~n; 843343#L25 assume !(~n <= 0); 842890#L26 call #t~ret0 := fact(~n - 1);< 843341#factENTRY ~n := #in~n; 843345#L25 assume ~n <= 0;#res := 1; 843344#factFINAL assume true; 843340#factEXIT >#66#return; 843338#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 843337#factFINAL assume true; 843333#factEXIT >#66#return; 843331#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 843326#factFINAL assume true; 843318#factEXIT >#66#return; 843316#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 843313#factFINAL assume true; 843309#factEXIT >#66#return; 843308#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 843307#factFINAL assume true; 842887#factEXIT >#66#return; 842884#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842875#factFINAL assume true; 842871#factEXIT >#74#return; 842868#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 842886#factENTRY ~n := #in~n; 843048#L25 assume !(~n <= 0); 842929#L26 call #t~ret0 := fact(~n - 1);< 843009#factENTRY ~n := #in~n; 843007#L25 assume !(~n <= 0); 842922#L26 call #t~ret0 := fact(~n - 1);< 842991#factENTRY ~n := #in~n; 843398#L25 assume !(~n <= 0); 842911#L26 call #t~ret0 := fact(~n - 1);< 843397#factENTRY ~n := #in~n; 843398#L25 assume !(~n <= 0); 842911#L26 call #t~ret0 := fact(~n - 1);< 843397#factENTRY ~n := #in~n; 843398#L25 assume !(~n <= 0); 842911#L26 call #t~ret0 := fact(~n - 1);< 843397#factENTRY ~n := #in~n; 843416#L25 assume ~n <= 0;#res := 1; 843415#factFINAL assume true; 843393#factEXIT >#66#return; 843391#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842977#factFINAL assume true; 842967#factEXIT >#66#return; 842971#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 843404#factFINAL assume true; 842993#factEXIT >#66#return; 842992#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 842956#factFINAL assume true; 842907#factEXIT >#66#return; 842936#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 843305#factFINAL assume true; 843302#factEXIT >#66#return; 843257#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 843347#factFINAL assume true; 843281#factEXIT >#76#return; 842823#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 842831#factENTRY ~n := #in~n; 843370#L25 assume !(~n <= 0); 843367#L26 call #t~ret0 := fact(~n - 1);< 843369#factENTRY ~n := #in~n; 843373#L25 assume ~n <= 0;#res := 1; 843371#factFINAL assume true; 843365#factEXIT >#66#return; 843364#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 843276#factFINAL assume true; 842822#factEXIT >#78#return; 842820#L30-8 [2022-11-20 09:43:25,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:43:25,324 INFO L85 PathProgramCache]: Analyzing trace with hash 291195713, now seen corresponding path program 47 times [2022-11-20 09:43:25,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:43:25,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981817947] [2022-11-20 09:43:25,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:43:25,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:43:25,352 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:43:25,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1111366272] [2022-11-20 09:43:25,352 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-20 09:43:25,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:43:25,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:43:25,367 INFO L229 MonitoredProcess]: Starting monitored process 357 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:43:25,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (357)] Waiting until timeout for monitored process [2022-11-20 09:43:27,972 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2022-11-20 09:43:27,972 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:43:27,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 1772 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-20 09:43:27,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:43:28,197 INFO L134 CoverageAnalysis]: Checked inductivity of 38477 backedges. 9040 proven. 97 refuted. 0 times theorem prover too weak. 29340 trivial. 0 not checked. [2022-11-20 09:43:28,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:43:29,348 INFO L134 CoverageAnalysis]: Checked inductivity of 38477 backedges. 1908 proven. 309 refuted. 0 times theorem prover too weak. 36260 trivial. 0 not checked. [2022-11-20 09:43:29,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:43:29,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981817947] [2022-11-20 09:43:29,348 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 09:43:29,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111366272] [2022-11-20 09:43:29,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111366272] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:43:29,349 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:43:29,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 18 [2022-11-20 09:43:29,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664826254] [2022-11-20 09:43:29,349 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:43:29,350 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-20 09:43:29,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:43:29,350 INFO L85 PathProgramCache]: Analyzing trace with hash -488467173, now seen corresponding path program 42 times [2022-11-20 09:43:29,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:43:29,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636030272] [2022-11-20 09:43:29,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:43:29,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:43:29,372 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:43:29,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1507032497] [2022-11-20 09:43:29,372 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-20 09:43:29,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:43:29,372 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:43:29,374 INFO L229 MonitoredProcess]: Starting monitored process 358 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:43:29,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (358)] Waiting until timeout for monitored process [2022-11-20 09:43:30,298 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) [2022-11-20 09:43:30,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:43:30,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 825 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-20 09:43:30,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:43:30,576 INFO L134 CoverageAnalysis]: Checked inductivity of 22885 backedges. 6586 proven. 783 refuted. 0 times theorem prover too weak. 15516 trivial. 0 not checked. [2022-11-20 09:43:30,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:43:32,064 INFO L134 CoverageAnalysis]: Checked inductivity of 22885 backedges. 742 proven. 1048 refuted. 0 times theorem prover too weak. 21095 trivial. 0 not checked. [2022-11-20 09:43:32,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:43:32,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636030272] [2022-11-20 09:43:32,064 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 09:43:32,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507032497] [2022-11-20 09:43:32,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507032497] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:43:32,065 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:43:32,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 18 [2022-11-20 09:43:32,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113992071] [2022-11-20 09:43:32,065 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:43:32,066 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 09:43:32,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:43:32,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-20 09:43:32,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-11-20 09:43:32,067 INFO L87 Difference]: Start difference. First operand 5531 states and 8801 transitions. cyclomatic complexity: 3331 Second operand has 18 states, 16 states have (on average 3.8125) internal successors, (61), 18 states have internal predecessors, (61), 12 states have call successors, (31), 2 states have call predecessors, (31), 6 states have return successors, (33), 12 states have call predecessors, (33), 12 states have call successors, (33) [2022-11-20 09:43:33,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:43:33,147 INFO L93 Difference]: Finished difference Result 6124 states and 10006 transitions. [2022-11-20 09:43:33,147 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6124 states and 10006 transitions. [2022-11-20 09:43:33,181 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 774 [2022-11-20 09:43:33,225 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6124 states to 6008 states and 9834 transitions. [2022-11-20 09:43:33,225 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 505 [2022-11-20 09:43:33,226 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 505 [2022-11-20 09:43:33,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6008 states and 9834 transitions. [2022-11-20 09:43:33,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 09:43:33,226 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6008 states and 9834 transitions. [2022-11-20 09:43:33,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6008 states and 9834 transitions. [2022-11-20 09:43:33,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6008 to 5747. [2022-11-20 09:43:33,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5747 states, 3567 states have (on average 1.0420521446593776) internal successors, (3717), 3543 states have internal predecessors, (3717), 1563 states have call successors, (1609), 713 states have call predecessors, (1609), 617 states have return successors, (3951), 1490 states have call predecessors, (3951), 1563 states have call successors, (3951) [2022-11-20 09:43:33,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5747 states to 5747 states and 9277 transitions. [2022-11-20 09:43:33,562 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5747 states and 9277 transitions. [2022-11-20 09:43:33,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 09:43:33,563 INFO L428 stractBuchiCegarLoop]: Abstraction has 5747 states and 9277 transitions. [2022-11-20 09:43:33,563 INFO L335 stractBuchiCegarLoop]: ======== Iteration 70 ============ [2022-11-20 09:43:33,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5747 states and 9277 transitions. [2022-11-20 09:43:33,577 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 680 [2022-11-20 09:43:33,577 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 09:43:33,577 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 09:43:33,580 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [128, 128, 77, 77, 77, 77, 51, 17, 16, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 7, 7, 7, 7, 7, 6, 6, 4, 3, 3, 1, 1, 1, 1] [2022-11-20 09:43:33,580 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [94, 94, 73, 73, 73, 73, 21, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:43:33,581 INFO L748 eck$LassoCheckResult]: Stem: 861488#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 861461#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; 861462#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 861487#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; 861510#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 865937#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 865936#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; 861446#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 861447#factENTRY ~n := #in~n; 866085#L25 assume ~n <= 0;#res := 1; 866080#factFINAL assume true; 866077#factEXIT >#68#return; 861503#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 861504#factENTRY ~n := #in~n; 865801#L25 assume ~n <= 0;#res := 1; 865799#factFINAL assume true; 865798#factEXIT >#70#return; 861435#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 861436#factENTRY ~n := #in~n; 866103#L25 assume ~n <= 0;#res := 1; 866098#factFINAL assume true; 866095#factEXIT >#72#return; 866091#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; 861482#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 861483#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 861502#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 861491#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; 861492#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 866646#factENTRY ~n := #in~n; 866672#L25 assume !(~n <= 0); 866659#L26 call #t~ret0 := fact(~n - 1);< 866660#factENTRY ~n := #in~n; 866671#L25 assume ~n <= 0;#res := 1; 866669#factFINAL assume true; 866658#factEXIT >#66#return; 866653#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 866650#factFINAL assume true; 866645#factEXIT >#74#return; 866642#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 866643#factENTRY ~n := #in~n; 866652#L25 assume ~n <= 0;#res := 1; 866651#factFINAL assume true; 866641#factEXIT >#76#return; 866634#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 866635#factENTRY ~n := #in~n; 866668#L25 assume !(~n <= 0); 866656#L26 call #t~ret0 := fact(~n - 1);< 866657#factENTRY ~n := #in~n; 866665#L25 assume ~n <= 0;#res := 1; 866664#factFINAL assume true; 866655#factEXIT >#66#return; 866639#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 866637#factFINAL assume true; 866633#factEXIT >#78#return; 866631#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; 866628#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 866626#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 866625#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 866624#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; 866534#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 866539#factENTRY ~n := #in~n; 866554#L25 assume !(~n <= 0); 866546#L26 call #t~ret0 := fact(~n - 1);< 866549#factENTRY ~n := #in~n; 866559#L25 assume !(~n <= 0); 866543#L26 call #t~ret0 := fact(~n - 1);< 866557#factENTRY ~n := #in~n; 866560#L25 assume ~n <= 0;#res := 1; 866558#factFINAL assume true; 866556#factEXIT >#66#return; 866555#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 866550#factFINAL assume true; 866542#factEXIT >#66#return; 866541#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 866540#factFINAL assume true; 866532#factEXIT >#74#return; 866537#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 866507#factENTRY ~n := #in~n; 866619#L25 assume ~n <= 0;#res := 1; 866610#factFINAL assume true; 866608#factEXIT >#76#return; 866603#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 866606#factENTRY ~n := #in~n; 866618#L25 assume !(~n <= 0); 866615#L26 call #t~ret0 := fact(~n - 1);< 866617#factENTRY ~n := #in~n; 866632#L25 assume !(~n <= 0); 866612#L26 call #t~ret0 := fact(~n - 1);< 866630#factENTRY ~n := #in~n; 866640#L25 assume ~n <= 0;#res := 1; 866638#factFINAL assume true; 866629#factEXIT >#66#return; 866627#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 866620#factFINAL assume true; 866611#factEXIT >#66#return; 866609#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 866607#factFINAL assume true; 866602#factEXIT >#78#return; 866601#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; 866600#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 866599#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 866598#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 866597#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; 866204#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 866390#factENTRY ~n := #in~n; 866366#L25 assume !(~n <= 0); 866341#L26 call #t~ret0 := fact(~n - 1);< 866378#factENTRY ~n := #in~n; 866379#L25 assume !(~n <= 0); 866342#L26 call #t~ret0 := fact(~n - 1);< 866372#factENTRY ~n := #in~n; 866379#L25 assume !(~n <= 0); 866342#L26 call #t~ret0 := fact(~n - 1);< 866372#factENTRY ~n := #in~n; 866383#L25 assume ~n <= 0;#res := 1; 866381#factFINAL assume true; 866382#factEXIT >#66#return; 866393#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 866373#factFINAL assume true; 866374#factEXIT >#66#return; 866367#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 866368#factFINAL assume true; 866340#factEXIT >#66#return; 866343#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 866336#factFINAL assume true; 866337#factEXIT >#74#return; 866178#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 866179#factENTRY ~n := #in~n; 866289#L25 assume ~n <= 0;#res := 1; 866288#factFINAL assume true; 866177#factEXIT >#76#return; 861494#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 866256#factENTRY ~n := #in~n; 866255#L25 assume !(~n <= 0); 866193#L26 call #t~ret0 := fact(~n - 1);< 866254#factENTRY ~n := #in~n; 866315#L25 assume !(~n <= 0); 866196#L26 call #t~ret0 := fact(~n - 1);< 866220#factENTRY ~n := #in~n; 866312#L25 assume !(~n <= 0); 866192#L26 call #t~ret0 := fact(~n - 1);< 866307#factENTRY ~n := #in~n; 866314#L25 assume ~n <= 0;#res := 1; 866311#factFINAL assume true; 866306#factEXIT >#66#return; 866304#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 866302#factFINAL assume true; 866262#factEXIT >#66#return; 866261#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 866258#factFINAL assume true; 866191#factEXIT >#66#return; 861493#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 861495#factFINAL assume true; 866189#factEXIT >#78#return; 864994#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; 864992#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 864991#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 864990#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 864989#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 864988#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 864987#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 864986#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; 864984#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 864985#factENTRY ~n := #in~n; 865012#L25 assume !(~n <= 0); 865009#L26 call #t~ret0 := fact(~n - 1);< 865010#factENTRY ~n := #in~n; 865014#L25 assume ~n <= 0;#res := 1; 865013#factFINAL assume true; 865008#factEXIT >#66#return; 865006#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 865005#factFINAL assume true; 864982#factEXIT >#68#return; 864979#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 864981#factENTRY ~n := #in~n; 865011#L25 assume ~n <= 0;#res := 1; 865007#factFINAL assume true; 864978#factEXIT >#70#return; 864974#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 864976#factENTRY ~n := #in~n; 865021#L25 assume !(~n <= 0); 865018#L26 call #t~ret0 := fact(~n - 1);< 865019#factENTRY ~n := #in~n; 865056#L25 assume ~n <= 0;#res := 1; 865055#factFINAL assume true; 865017#factEXIT >#66#return; 865016#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 865015#factFINAL assume true; 864972#factEXIT >#72#return; 864970#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; 864968#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 864966#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 864964#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 864963#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; 864960#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 864962#factENTRY ~n := #in~n; 865029#L25 assume !(~n <= 0); 865024#L26 call #t~ret0 := fact(~n - 1);< 865028#factENTRY ~n := #in~n; 865034#L25 assume ~n <= 0;#res := 1; 865030#factFINAL assume true; 865022#factEXIT >#66#return; 865020#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 864965#factFINAL assume true; 864959#factEXIT >#68#return; 864955#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 864957#factENTRY ~n := #in~n; 865064#L25 assume !(~n <= 0); 865061#L26 call #t~ret0 := fact(~n - 1);< 865062#factENTRY ~n := #in~n; 865066#L25 assume ~n <= 0;#res := 1; 865065#factFINAL assume true; 865060#factEXIT >#66#return; 865059#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 865057#factFINAL assume true; 864954#factEXIT >#70#return; 864951#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 864953#factENTRY ~n := #in~n; 865068#L25 assume ~n <= 0;#res := 1; 865067#factFINAL assume true; 864949#factEXIT >#72#return; 864947#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; 864945#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 864941#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 864940#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 864939#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; 864936#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 864938#factENTRY ~n := #in~n; 865074#L25 assume !(~n <= 0); 865071#L26 call #t~ret0 := fact(~n - 1);< 865073#factENTRY ~n := #in~n; 865079#L25 assume !(~n <= 0); 865072#L26 call #t~ret0 := fact(~n - 1);< 865078#factENTRY ~n := #in~n; 865081#L25 assume ~n <= 0;#res := 1; 865080#factFINAL assume true; 865077#factEXIT >#66#return; 865076#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 865075#factFINAL assume true; 865070#factEXIT >#66#return; 865069#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 864942#factFINAL assume true; 864935#factEXIT >#74#return; 863398#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 863200#factENTRY ~n := #in~n; 866068#L25 assume !(~n <= 0); 864755#L26 call #t~ret0 := fact(~n - 1);< 864760#factENTRY ~n := #in~n; 864794#L25 assume ~n <= 0;#res := 1; 864788#factFINAL assume true; 864752#factEXIT >#66#return; 864757#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 866174#factFINAL assume true; 866172#factEXIT >#76#return; 863393#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 863395#factENTRY ~n := #in~n; 863412#L25 assume !(~n <= 0); 863406#L26 call #t~ret0 := fact(~n - 1);< 863407#factENTRY ~n := #in~n; 863470#L25 assume ~n <= 0;#res := 1; 863467#factFINAL assume true; 863405#factEXIT >#66#return; 863404#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 863403#factFINAL assume true; 863391#factEXIT >#78#return; 863369#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; 863367#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 863366#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 863364#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 863363#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; 862991#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 862994#factENTRY ~n := #in~n; 863003#L25 assume !(~n <= 0); 863001#L26 call #t~ret0 := fact(~n - 1);< 863002#factENTRY ~n := #in~n; 863009#L25 assume !(~n <= 0); 863000#L26 call #t~ret0 := fact(~n - 1);< 863007#factENTRY ~n := #in~n; 863009#L25 assume !(~n <= 0); 863000#L26 call #t~ret0 := fact(~n - 1);< 863007#factENTRY ~n := #in~n; 863017#L25 assume ~n <= 0;#res := 1; 863015#factFINAL assume true; 863012#factEXIT >#66#return; 863011#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 863010#factFINAL assume true; 863006#factEXIT >#66#return; 863005#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 863004#factFINAL assume true; 862999#factEXIT >#66#return; 862998#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862996#factFINAL assume true; 862989#factEXIT >#74#return; 862004#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 862006#factENTRY ~n := #in~n; 862087#L25 assume !(~n <= 0); 862082#L26 call #t~ret0 := fact(~n - 1);< 862085#factENTRY ~n := #in~n; 862093#L25 assume ~n <= 0;#res := 1; 862090#factFINAL assume true; 862081#factEXIT >#66#return; 862065#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862064#factFINAL assume true; 862001#factEXIT >#76#return; 861991#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 861993#factENTRY ~n := #in~n; 862086#L25 assume !(~n <= 0); 862073#L26 call #t~ret0 := fact(~n - 1);< 862080#factENTRY ~n := #in~n; 862781#L25 assume !(~n <= 0); 862071#L26 call #t~ret0 := fact(~n - 1);< 862776#factENTRY ~n := #in~n; 863218#L25 assume ~n <= 0;#res := 1; 862944#factFINAL assume true; 862186#factEXIT >#66#return; 862185#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862094#factFINAL assume true; 862066#factEXIT >#66#return; 862007#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862000#factFINAL assume true; 861989#factEXIT >#78#return; 861893#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; 861891#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 861889#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 861888#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 861886#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 861884#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 861882#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 861880#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; 861815#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 861819#factENTRY ~n := #in~n; 861876#L25 assume !(~n <= 0); 861827#L26 call #t~ret0 := fact(~n - 1);< 861831#factENTRY ~n := #in~n; 861844#L25 assume !(~n <= 0); 861829#L26 call #t~ret0 := fact(~n - 1);< 861835#factENTRY ~n := #in~n; 861859#L25 assume ~n <= 0;#res := 1; 861857#factFINAL assume true; 861851#factEXIT >#66#return; 861850#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 861834#factFINAL assume true; 861826#factEXIT >#66#return; 861825#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 861824#factFINAL assume true; 861812#factEXIT >#68#return; 861818#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 861810#factENTRY ~n := #in~n; 865509#L25 assume ~n <= 0;#res := 1; 865508#factFINAL assume true; 865503#factEXIT >#70#return; 865498#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 865501#factENTRY ~n := #in~n; 865519#L25 assume !(~n <= 0); 865514#L26 call #t~ret0 := fact(~n - 1);< 865517#factENTRY ~n := #in~n; 866071#L25 assume !(~n <= 0); 865513#L26 call #t~ret0 := fact(~n - 1);< 865537#factENTRY ~n := #in~n; 865542#L25 assume ~n <= 0;#res := 1; 865541#factFINAL assume true; 865535#factEXIT >#66#return; 865533#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 865529#factFINAL assume true; 865512#factEXIT >#66#return; 865511#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 865510#factFINAL assume true; 865497#factEXIT >#72#return; 865500#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; 865506#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 865502#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 865496#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 865494#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; 865464#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 865468#factENTRY ~n := #in~n; 865655#L25 assume !(~n <= 0); 865652#L26 call #t~ret0 := fact(~n - 1);< 865653#factENTRY ~n := #in~n; 865662#L25 assume !(~n <= 0); 865660#L26 call #t~ret0 := fact(~n - 1);< 865661#factENTRY ~n := #in~n; 865664#L25 assume ~n <= 0;#res := 1; 865663#factFINAL assume true; 865659#factEXIT >#66#return; 865658#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 865657#factFINAL assume true; 865651#factEXIT >#66#return; 865650#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 865642#factFINAL assume true; 865461#factEXIT >#68#return; 865467#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 865488#factENTRY ~n := #in~n; 865525#L25 assume !(~n <= 0); 865522#L26 call #t~ret0 := fact(~n - 1);< 865524#factENTRY ~n := #in~n; 865528#L25 assume ~n <= 0;#res := 1; 865526#factFINAL assume true; 865520#factEXIT >#66#return; 865518#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 865490#factFINAL assume true; 865487#factEXIT >#70#return; 865484#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 865486#factENTRY ~n := #in~n; 865527#L25 assume !(~n <= 0); 865521#L26 call #t~ret0 := fact(~n - 1);< 865524#factENTRY ~n := #in~n; 865528#L25 assume ~n <= 0;#res := 1; 865526#factFINAL assume true; 865520#factEXIT >#66#return; 865523#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 865545#factFINAL assume true; 865482#factEXIT >#72#return; 865485#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; 865647#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 865645#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 865644#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 865643#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; 865465#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 865468#factENTRY ~n := #in~n; 865655#L25 assume !(~n <= 0); 865652#L26 call #t~ret0 := fact(~n - 1);< 865653#factENTRY ~n := #in~n; 865662#L25 assume !(~n <= 0); 865660#L26 call #t~ret0 := fact(~n - 1);< 865661#factENTRY ~n := #in~n; 865664#L25 assume ~n <= 0;#res := 1; 865663#factFINAL assume true; 865659#factEXIT >#66#return; 865658#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 865657#factFINAL assume true; 865651#factEXIT >#66#return; 865650#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 865642#factFINAL assume true; 865461#factEXIT >#68#return; 865457#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 865459#factENTRY ~n := #in~n; 865656#L25 assume !(~n <= 0); 865617#L26 call #t~ret0 := fact(~n - 1);< 865626#factENTRY ~n := #in~n; 865633#L25 assume !(~n <= 0); 865630#L26 call #t~ret0 := fact(~n - 1);< 865632#factENTRY ~n := #in~n; 865641#L25 assume ~n <= 0;#res := 1; 865640#factFINAL assume true; 865629#factEXIT >#66#return; 865627#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 865624#factFINAL assume true; 865610#factEXIT >#66#return; 865619#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 865654#factFINAL assume true; 865456#factEXIT >#70#return; 865451#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 865454#factENTRY ~n := #in~n; 865666#L25 assume ~n <= 0;#res := 1; 865665#factFINAL assume true; 865450#factEXIT >#72#return; 865453#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; 865880#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 865879#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 865878#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 865877#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; 865426#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 865874#factENTRY ~n := #in~n; 865873#L25 assume !(~n <= 0); 865860#L26 call #t~ret0 := fact(~n - 1);< 865863#factENTRY ~n := #in~n; 865888#L25 assume !(~n <= 0); 865859#L26 call #t~ret0 := fact(~n - 1);< 865887#factENTRY ~n := #in~n; 865888#L25 assume !(~n <= 0); 865859#L26 call #t~ret0 := fact(~n - 1);< 865887#factENTRY ~n := #in~n; 865895#L25 assume ~n <= 0;#res := 1; 865893#factFINAL assume true; 865892#factEXIT >#66#return; 865890#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 865889#factFINAL assume true; 865886#factEXIT >#66#return; 865882#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 865869#factFINAL assume true; 865858#factEXIT >#66#return; 865862#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 866062#factFINAL assume true; 866059#factEXIT >#74#return; 865303#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 865381#factENTRY ~n := #in~n; 866064#L25 assume !(~n <= 0); 865269#L26 call #t~ret0 := fact(~n - 1);< 865301#factENTRY ~n := #in~n; 865299#L25 assume !(~n <= 0); 865295#L26 call #t~ret0 := fact(~n - 1);< 865297#factENTRY ~n := #in~n; 865300#L25 assume ~n <= 0;#res := 1; 865298#factFINAL assume true; 865294#factEXIT >#66#return; 865293#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 865291#factFINAL assume true; 865268#factEXIT >#66#return; 865285#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 866052#factFINAL assume true; 865380#factEXIT >#76#return; 863560#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 865263#factENTRY ~n := #in~n; 866089#L25 assume !(~n <= 0); 866083#L26 call #t~ret0 := fact(~n - 1);< 866084#factENTRY ~n := #in~n; 866090#L25 assume ~n <= 0;#res := 1; 866088#factFINAL assume true; 866082#factEXIT >#66#return; 866079#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 866076#factFINAL assume true; 863559#factEXIT >#78#return; 863557#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; 863555#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 863554#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 863553#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 863552#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 863551#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 863549#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 863548#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; 861865#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 861875#factENTRY ~n := #in~n; 861870#L25 assume !(~n <= 0); 861828#L26 call #t~ret0 := fact(~n - 1);< 861831#factENTRY ~n := #in~n; 861844#L25 assume !(~n <= 0); 861829#L26 call #t~ret0 := fact(~n - 1);< 861835#factENTRY ~n := #in~n; 861844#L25 assume !(~n <= 0); 861829#L26 call #t~ret0 := fact(~n - 1);< 861835#factENTRY ~n := #in~n; 861859#L25 assume ~n <= 0;#res := 1; 861857#factFINAL assume true; 861851#factEXIT >#66#return; 861850#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 861834#factFINAL assume true; 861826#factEXIT >#66#return; 861830#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 861981#factFINAL assume true; 861977#factEXIT >#66#return; 861972#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 861962#factFINAL assume true; 861916#factEXIT >#68#return; 861803#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 861809#factENTRY ~n := #in~n; 861868#L25 assume ~n <= 0;#res := 1; 861863#factFINAL assume true; 861802#factEXIT >#70#return; 861807#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 863545#factENTRY ~n := #in~n; 864056#L25 assume !(~n <= 0); 861847#L26 call #t~ret0 := fact(~n - 1);< 861964#factENTRY ~n := #in~n; 861963#L25 assume !(~n <= 0); 861839#L26 call #t~ret0 := fact(~n - 1);< 861849#factENTRY ~n := #in~n; 863854#L25 assume !(~n <= 0); 861854#L26 call #t~ret0 := fact(~n - 1);< 861871#factENTRY ~n := #in~n; 861867#L25 assume ~n <= 0;#res := 1; 861862#factFINAL assume true; 861853#factEXIT >#66#return; 861852#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 861846#factFINAL assume true; 861836#factEXIT >#66#return; 861842#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862593#factFINAL assume true; 862589#factEXIT >#66#return; 862590#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 863550#factFINAL assume true; 863543#factEXIT >#72#return; 863540#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; 863538#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 863536#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 863534#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 863532#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; 861739#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 861878#factENTRY ~n := #in~n; 861877#L25 assume !(~n <= 0); 861729#L26 call #t~ret0 := fact(~n - 1);< 861736#factENTRY ~n := #in~n; 861733#L25 assume !(~n <= 0); 861717#L26 call #t~ret0 := fact(~n - 1);< 861723#factENTRY ~n := #in~n; 861722#L25 assume !(~n <= 0); 861703#L26 call #t~ret0 := fact(~n - 1);< 861719#factENTRY ~n := #in~n; 861721#L25 assume ~n <= 0;#res := 1; 861720#factFINAL assume true; 861701#factEXIT >#66#return; 861709#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862175#factFINAL assume true; 862036#factEXIT >#66#return; 862042#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862058#factFINAL assume true; 862048#factEXIT >#66#return; 862035#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862033#factFINAL assume true; 861997#factEXIT >#68#return; 861999#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 862184#factENTRY ~n := #in~n; 862212#L25 assume !(~n <= 0); 861713#L26 call #t~ret0 := fact(~n - 1);< 862211#factENTRY ~n := #in~n; 862223#L25 assume ~n <= 0;#res := 1; 862118#factFINAL assume true; 862111#factEXIT >#66#return; 862115#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862190#factFINAL assume true; 862183#factEXIT >#70#return; 861726#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 861735#factENTRY ~n := #in~n; 861732#L25 assume !(~n <= 0); 861718#L26 call #t~ret0 := fact(~n - 1);< 861728#factENTRY ~n := #in~n; 861722#L25 assume !(~n <= 0); 861703#L26 call #t~ret0 := fact(~n - 1);< 861719#factENTRY ~n := #in~n; 861721#L25 assume ~n <= 0;#res := 1; 861720#factFINAL assume true; 861701#factEXIT >#66#return; 861709#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862175#factFINAL assume true; 862036#factEXIT >#66#return; 862044#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862250#factFINAL assume true; 862181#factEXIT >#72#return; 862180#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; 862178#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 862177#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 862176#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 862174#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; 861737#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 861878#factENTRY ~n := #in~n; 861877#L25 assume !(~n <= 0); 861729#L26 call #t~ret0 := fact(~n - 1);< 861736#factENTRY ~n := #in~n; 861733#L25 assume !(~n <= 0); 861717#L26 call #t~ret0 := fact(~n - 1);< 861723#factENTRY ~n := #in~n; 861722#L25 assume !(~n <= 0); 861703#L26 call #t~ret0 := fact(~n - 1);< 861719#factENTRY ~n := #in~n; 861721#L25 assume ~n <= 0;#res := 1; 861720#factFINAL assume true; 861701#factEXIT >#66#return; 861709#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862175#factFINAL assume true; 862036#factEXIT >#66#return; 862042#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862058#factFINAL assume true; 862048#factEXIT >#66#return; 862035#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862033#factFINAL assume true; 861997#factEXIT >#68#return; 861574#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 861996#factENTRY ~n := #in~n; 862179#L25 assume !(~n <= 0); 861714#L26 call #t~ret0 := fact(~n - 1);< 862047#factENTRY ~n := #in~n; 862193#L25 assume !(~n <= 0); 861702#L26 call #t~ret0 := fact(~n - 1);< 861715#factENTRY ~n := #in~n; 861721#L25 assume ~n <= 0;#res := 1; 861720#factFINAL assume true; 861701#factEXIT >#66#return; 861709#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862175#factFINAL assume true; 862036#factEXIT >#66#return; 862034#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862032#factFINAL assume true; 861995#factEXIT >#70#return; 861986#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 861988#factENTRY ~n := #in~n; 862854#L25 assume !(~n <= 0); 862112#L26 call #t~ret0 := fact(~n - 1);< 862117#factENTRY ~n := #in~n; 862223#L25 assume ~n <= 0;#res := 1; 862118#factFINAL assume true; 862111#factEXIT >#66#return; 862031#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 861994#factFINAL assume true; 861985#factEXIT >#72#return; 861984#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; 861980#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 861975#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 861970#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 861967#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; 861740#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 861878#factENTRY ~n := #in~n; 861877#L25 assume !(~n <= 0); 861729#L26 call #t~ret0 := fact(~n - 1);< 861736#factENTRY ~n := #in~n; 861733#L25 assume !(~n <= 0); 861717#L26 call #t~ret0 := fact(~n - 1);< 861723#factENTRY ~n := #in~n; 861722#L25 assume !(~n <= 0); 861703#L26 call #t~ret0 := fact(~n - 1);< 861719#factENTRY ~n := #in~n; 861721#L25 assume ~n <= 0;#res := 1; 861720#factFINAL assume true; 861701#factEXIT >#66#return; 861709#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862175#factFINAL assume true; 862036#factEXIT >#66#return; 862042#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862058#factFINAL assume true; 862048#factEXIT >#66#return; 862035#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862033#factFINAL assume true; 861997#factEXIT >#68#return; 861575#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 861996#factENTRY ~n := #in~n; 862179#L25 assume !(~n <= 0); 861714#L26 call #t~ret0 := fact(~n - 1);< 862047#factENTRY ~n := #in~n; 862193#L25 assume !(~n <= 0); 861702#L26 call #t~ret0 := fact(~n - 1);< 861715#factENTRY ~n := #in~n; 861722#L25 assume !(~n <= 0); 861703#L26 call #t~ret0 := fact(~n - 1);< 861719#factENTRY ~n := #in~n; 861721#L25 assume ~n <= 0;#res := 1; 861720#factFINAL assume true; 861701#factEXIT >#66#return; 861709#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862175#factFINAL assume true; 862036#factEXIT >#66#return; 862042#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862058#factFINAL assume true; 862048#factEXIT >#66#return; 861584#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 861582#factFINAL assume true; 861572#factEXIT >#70#return; 861577#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 863044#factENTRY ~n := #in~n; 863260#L25 assume ~n <= 0;#res := 1; 863090#factFINAL assume true; 863042#factEXIT >#72#return; 863043#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; 864296#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 864295#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 864287#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 864282#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; 863035#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 864278#factENTRY ~n := #in~n; 864329#L25 assume !(~n <= 0); 861423#L26 call #t~ret0 := fact(~n - 1);< 864294#factENTRY ~n := #in~n; 864518#L25 assume !(~n <= 0); 861428#L26 call #t~ret0 := fact(~n - 1);< 864312#factENTRY ~n := #in~n; 864399#L25 assume !(~n <= 0); 861425#L26 call #t~ret0 := fact(~n - 1);< 864398#factENTRY ~n := #in~n; 864399#L25 assume !(~n <= 0); 861425#L26 call #t~ret0 := fact(~n - 1);< 864398#factENTRY ~n := #in~n; 864401#L25 assume ~n <= 0;#res := 1; 864400#factFINAL assume true; 864397#factEXIT >#66#return; 864396#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 864394#factFINAL assume true; 864393#factEXIT >#66#return; 864390#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 864388#factFINAL assume true; 864310#factEXIT >#66#return; 864308#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 864304#factFINAL assume true; 864292#factEXIT >#66#return; 864286#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 864281#factFINAL assume true; 864277#factEXIT >#74#return; 864106#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 864264#factENTRY ~n := #in~n; 864259#L25 assume !(~n <= 0); 862982#L26 call #t~ret0 := fact(~n - 1);< 862986#factENTRY ~n := #in~n; 862985#L25 assume !(~n <= 0); 862746#L26 call #t~ret0 := fact(~n - 1);< 862835#factENTRY ~n := #in~n; 862832#L25 assume !(~n <= 0); 862747#L26 call #t~ret0 := fact(~n - 1);< 862823#factENTRY ~n := #in~n; 862814#L25 assume !(~n <= 0); 862805#L26 call #t~ret0 := fact(~n - 1);< 862808#factENTRY ~n := #in~n; 862820#L25 assume ~n <= 0;#res := 1; 862818#factFINAL assume true; 862804#factEXIT >#66#return; 862798#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862788#factFINAL assume true; 862743#factEXIT >#66#return; 862762#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 864130#factFINAL assume true; 864127#factEXIT >#66#return; 864126#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 864115#factFINAL assume true; 864099#factEXIT >#66#return; 864104#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 864517#factFINAL assume true; 864516#factEXIT >#76#return; 861439#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 864098#factENTRY ~n := #in~n; 864424#L25 assume !(~n <= 0); 864413#L26 call #t~ret0 := fact(~n - 1);< 864416#factENTRY ~n := #in~n; 864437#L25 assume ~n <= 0;#res := 1; 864418#factFINAL assume true; 864412#factEXIT >#66#return; 864415#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 861437#factFINAL assume true; 861440#factEXIT >#78#return; 862714#L30-8 [2022-11-20 09:43:33,581 INFO L750 eck$LassoCheckResult]: Loop: 862714#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; 864357#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 864355#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 864350#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 864349#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 864347#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 864345#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 864343#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; 864302#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 864337#factENTRY ~n := #in~n; 864513#L25 assume !(~n <= 0); 862517#L26 call #t~ret0 := fact(~n - 1);< 864041#factENTRY ~n := #in~n; 864039#L25 assume !(~n <= 0); 862509#L26 call #t~ret0 := fact(~n - 1);< 862518#factENTRY ~n := #in~n; 865241#L25 assume !(~n <= 0); 862507#L26 call #t~ret0 := fact(~n - 1);< 862523#factENTRY ~n := #in~n; 862557#L25 assume !(~n <= 0); 862508#L26 call #t~ret0 := fact(~n - 1);< 862529#factENTRY ~n := #in~n; 862547#L25 assume !(~n <= 0); 862506#L26 call #t~ret0 := fact(~n - 1);< 862542#factENTRY ~n := #in~n; 862546#L25 assume ~n <= 0;#res := 1; 862544#factFINAL assume true; 862541#factEXIT >#66#return; 862540#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862539#factFINAL assume true; 862528#factEXIT >#66#return; 862527#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862524#factFINAL assume true; 862522#factEXIT >#66#return; 862521#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862515#factFINAL assume true; 862504#factEXIT >#66#return; 862513#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 864395#factFINAL assume true; 864391#factEXIT >#66#return; 864389#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 864387#factFINAL assume true; 864386#factEXIT >#68#return; 862480#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 862490#factENTRY ~n := #in~n; 862545#L25 assume ~n <= 0;#res := 1; 862533#factFINAL assume true; 862471#factEXIT >#70#return; 862488#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 864254#factENTRY ~n := #in~n; 864275#L25 assume !(~n <= 0); 862579#L26 call #t~ret0 := fact(~n - 1);< 862583#factENTRY ~n := #in~n; 862581#L25 assume !(~n <= 0); 862569#L26 call #t~ret0 := fact(~n - 1);< 862572#factENTRY ~n := #in~n; 862686#L25 assume !(~n <= 0); 861848#L26 call #t~ret0 := fact(~n - 1);< 861964#factENTRY ~n := #in~n; 861963#L25 assume !(~n <= 0); 861839#L26 call #t~ret0 := fact(~n - 1);< 861849#factENTRY ~n := #in~n; 863854#L25 assume !(~n <= 0); 861854#L26 call #t~ret0 := fact(~n - 1);< 861871#factENTRY ~n := #in~n; 861867#L25 assume ~n <= 0;#res := 1; 861862#factFINAL assume true; 861853#factEXIT >#66#return; 861852#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 861846#factFINAL assume true; 861836#factEXIT >#66#return; 861842#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862593#factFINAL assume true; 862589#factEXIT >#66#return; 862588#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862578#factFINAL assume true; 862568#factEXIT >#66#return; 862571#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 864274#factFINAL assume true; 864267#factEXIT >#66#return; 864262#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 864258#factFINAL assume true; 864252#factEXIT >#72#return; 864250#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; 864248#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 864243#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 864240#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 864237#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; 861677#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 862648#factENTRY ~n := #in~n; 862647#L25 assume !(~n <= 0); 861610#L26 call #t~ret0 := fact(~n - 1);< 862645#factENTRY ~n := #in~n; 862643#L25 assume !(~n <= 0); 861603#L26 call #t~ret0 := fact(~n - 1);< 862637#factENTRY ~n := #in~n; 862636#L25 assume !(~n <= 0); 862049#L26 call #t~ret0 := fact(~n - 1);< 862587#factENTRY ~n := #in~n; 862586#L25 assume !(~n <= 0); 862037#L26 call #t~ret0 := fact(~n - 1);< 862537#factENTRY ~n := #in~n; 862534#L25 assume !(~n <= 0); 861708#L26 call #t~ret0 := fact(~n - 1);< 862061#factENTRY ~n := #in~n; 861721#L25 assume ~n <= 0;#res := 1; 861720#factFINAL assume true; 861701#factEXIT >#66#return; 861709#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862175#factFINAL assume true; 862036#factEXIT >#66#return; 862042#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862058#factFINAL assume true; 862048#factEXIT >#66#return; 862054#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862390#factFINAL assume true; 862382#factEXIT >#66#return; 862385#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862809#factFINAL assume true; 862799#factEXIT >#66#return; 862795#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862721#factFINAL assume true; 862664#factEXIT >#68#return; 862123#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 862247#factENTRY ~n := #in~n; 862228#L25 assume !(~n <= 0); 862113#L26 call #t~ret0 := fact(~n - 1);< 862117#factENTRY ~n := #in~n; 862223#L25 assume ~n <= 0;#res := 1; 862118#factFINAL assume true; 862111#factEXIT >#66#return; 862114#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862525#factFINAL assume true; 862448#factEXIT >#70#return; 862449#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 862817#factENTRY ~n := #in~n; 862816#L25 assume !(~n <= 0); 862384#L26 call #t~ret0 := fact(~n - 1);< 862391#factENTRY ~n := #in~n; 863999#L25 assume !(~n <= 0); 862050#L26 call #t~ret0 := fact(~n - 1);< 862392#factENTRY ~n := #in~n; 862912#L25 assume !(~n <= 0); 861712#L26 call #t~ret0 := fact(~n - 1);< 862047#factENTRY ~n := #in~n; 862193#L25 assume !(~n <= 0); 861702#L26 call #t~ret0 := fact(~n - 1);< 861715#factENTRY ~n := #in~n; 861722#L25 assume !(~n <= 0); 861703#L26 call #t~ret0 := fact(~n - 1);< 861719#factENTRY ~n := #in~n; 861721#L25 assume ~n <= 0;#res := 1; 861720#factFINAL assume true; 861701#factEXIT >#66#return; 861709#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862175#factFINAL assume true; 862036#factEXIT >#66#return; 862042#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862058#factFINAL assume true; 862048#factEXIT >#66#return; 862054#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862390#factFINAL assume true; 862382#factEXIT >#66#return; 862385#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862809#factFINAL assume true; 862799#factEXIT >#66#return; 862800#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 864872#factFINAL assume true; 864184#factEXIT >#72#return; 864202#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; 864232#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 864230#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 864228#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 864226#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; 861682#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 862648#factENTRY ~n := #in~n; 862647#L25 assume !(~n <= 0); 861610#L26 call #t~ret0 := fact(~n - 1);< 862645#factENTRY ~n := #in~n; 862643#L25 assume !(~n <= 0); 861603#L26 call #t~ret0 := fact(~n - 1);< 862637#factENTRY ~n := #in~n; 862636#L25 assume !(~n <= 0); 862049#L26 call #t~ret0 := fact(~n - 1);< 862587#factENTRY ~n := #in~n; 862586#L25 assume !(~n <= 0); 862037#L26 call #t~ret0 := fact(~n - 1);< 862537#factENTRY ~n := #in~n; 862534#L25 assume !(~n <= 0); 861708#L26 call #t~ret0 := fact(~n - 1);< 862061#factENTRY ~n := #in~n; 861721#L25 assume ~n <= 0;#res := 1; 861720#factFINAL assume true; 861701#factEXIT >#66#return; 861709#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862175#factFINAL assume true; 862036#factEXIT >#66#return; 862042#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862058#factFINAL assume true; 862048#factEXIT >#66#return; 862054#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862390#factFINAL assume true; 862382#factEXIT >#66#return; 862385#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862809#factFINAL assume true; 862799#factEXIT >#66#return; 862795#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862721#factFINAL assume true; 862664#factEXIT >#68#return; 861637#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 861580#factENTRY ~n := #in~n; 861655#L25 assume !(~n <= 0); 861599#L26 call #t~ret0 := fact(~n - 1);< 861654#factENTRY ~n := #in~n; 864019#L25 assume !(~n <= 0); 861604#L26 call #t~ret0 := fact(~n - 1);< 862393#factENTRY ~n := #in~n; 861721#L25 assume ~n <= 0;#res := 1; 861720#factFINAL assume true; 861701#factEXIT >#66#return; 861709#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862175#factFINAL assume true; 862036#factEXIT >#66#return; 862043#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862497#factFINAL assume true; 862400#factEXIT >#70#return; 862410#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 862687#factENTRY ~n := #in~n; 862591#L25 assume !(~n <= 0); 862052#L26 call #t~ret0 := fact(~n - 1);< 862587#factENTRY ~n := #in~n; 862586#L25 assume !(~n <= 0); 862037#L26 call #t~ret0 := fact(~n - 1);< 862537#factENTRY ~n := #in~n; 862534#L25 assume !(~n <= 0); 861708#L26 call #t~ret0 := fact(~n - 1);< 862061#factENTRY ~n := #in~n; 861721#L25 assume ~n <= 0;#res := 1; 861720#factFINAL assume true; 861701#factEXIT >#66#return; 861709#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862175#factFINAL assume true; 862036#factEXIT >#66#return; 862042#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862058#factFINAL assume true; 862048#factEXIT >#66#return; 862056#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862519#factFINAL assume true; 862435#factEXIT >#72#return; 862442#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; 864273#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 864271#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 864266#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 864261#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; 861659#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 862648#factENTRY ~n := #in~n; 862647#L25 assume !(~n <= 0); 861610#L26 call #t~ret0 := fact(~n - 1);< 862645#factENTRY ~n := #in~n; 862643#L25 assume !(~n <= 0); 861603#L26 call #t~ret0 := fact(~n - 1);< 862637#factENTRY ~n := #in~n; 862636#L25 assume !(~n <= 0); 862049#L26 call #t~ret0 := fact(~n - 1);< 862587#factENTRY ~n := #in~n; 862586#L25 assume !(~n <= 0); 862037#L26 call #t~ret0 := fact(~n - 1);< 862537#factENTRY ~n := #in~n; 862534#L25 assume !(~n <= 0); 861708#L26 call #t~ret0 := fact(~n - 1);< 862061#factENTRY ~n := #in~n; 861721#L25 assume ~n <= 0;#res := 1; 861720#factFINAL assume true; 861701#factEXIT >#66#return; 861709#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862175#factFINAL assume true; 862036#factEXIT >#66#return; 862042#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862058#factFINAL assume true; 862048#factEXIT >#66#return; 862054#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862390#factFINAL assume true; 862382#factEXIT >#66#return; 862385#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862809#factFINAL assume true; 862799#factEXIT >#66#return; 862795#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862721#factFINAL assume true; 862664#factEXIT >#68#return; 861627#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 861580#factENTRY ~n := #in~n; 861655#L25 assume !(~n <= 0); 861599#L26 call #t~ret0 := fact(~n - 1);< 861654#factENTRY ~n := #in~n; 864019#L25 assume !(~n <= 0); 861604#L26 call #t~ret0 := fact(~n - 1);< 862393#factENTRY ~n := #in~n; 864019#L25 assume !(~n <= 0); 861604#L26 call #t~ret0 := fact(~n - 1);< 862393#factENTRY ~n := #in~n; 861721#L25 assume ~n <= 0;#res := 1; 861720#factFINAL assume true; 861701#factEXIT >#66#return; 861709#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862175#factFINAL assume true; 862036#factEXIT >#66#return; 862042#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862058#factFINAL assume true; 862048#factEXIT >#66#return; 862055#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862425#factFINAL assume true; 862334#factEXIT >#70#return; 862270#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 862555#factENTRY ~n := #in~n; 862554#L25 assume !(~n <= 0); 862039#L26 call #t~ret0 := fact(~n - 1);< 862551#factENTRY ~n := #in~n; 862548#L25 assume !(~n <= 0); 861706#L26 call #t~ret0 := fact(~n - 1);< 862535#factENTRY ~n := #in~n; 861721#L25 assume ~n <= 0;#res := 1; 861720#factFINAL assume true; 861701#factEXIT >#66#return; 861709#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862175#factFINAL assume true; 862036#factEXIT >#66#return; 862045#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862377#factFINAL assume true; 862348#factEXIT >#72#return; 862352#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; 862672#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 862670#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 862668#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 862666#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; 861660#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 862648#factENTRY ~n := #in~n; 862647#L25 assume !(~n <= 0); 861610#L26 call #t~ret0 := fact(~n - 1);< 862645#factENTRY ~n := #in~n; 862643#L25 assume !(~n <= 0); 861603#L26 call #t~ret0 := fact(~n - 1);< 862637#factENTRY ~n := #in~n; 862636#L25 assume !(~n <= 0); 862049#L26 call #t~ret0 := fact(~n - 1);< 862587#factENTRY ~n := #in~n; 862586#L25 assume !(~n <= 0); 862037#L26 call #t~ret0 := fact(~n - 1);< 862537#factENTRY ~n := #in~n; 862534#L25 assume !(~n <= 0); 861708#L26 call #t~ret0 := fact(~n - 1);< 862061#factENTRY ~n := #in~n; 861721#L25 assume ~n <= 0;#res := 1; 861720#factFINAL assume true; 861701#factEXIT >#66#return; 861709#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862175#factFINAL assume true; 862036#factEXIT >#66#return; 862042#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862058#factFINAL assume true; 862048#factEXIT >#66#return; 862054#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862390#factFINAL assume true; 862382#factEXIT >#66#return; 862385#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862809#factFINAL assume true; 862799#factEXIT >#66#return; 862795#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862721#factFINAL assume true; 862664#factEXIT >#68#return; 861651#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 861580#factENTRY ~n := #in~n; 861655#L25 assume !(~n <= 0); 861599#L26 call #t~ret0 := fact(~n - 1);< 861654#factENTRY ~n := #in~n; 864019#L25 assume !(~n <= 0); 861604#L26 call #t~ret0 := fact(~n - 1);< 862393#factENTRY ~n := #in~n; 864019#L25 assume !(~n <= 0); 861604#L26 call #t~ret0 := fact(~n - 1);< 862393#factENTRY ~n := #in~n; 864019#L25 assume !(~n <= 0); 861604#L26 call #t~ret0 := fact(~n - 1);< 862393#factENTRY ~n := #in~n; 864019#L25 assume !(~n <= 0); 861604#L26 call #t~ret0 := fact(~n - 1);< 862393#factENTRY ~n := #in~n; 861721#L25 assume ~n <= 0;#res := 1; 861720#factFINAL assume true; 861701#factEXIT >#66#return; 861709#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862175#factFINAL assume true; 862036#factEXIT >#66#return; 862042#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862058#factFINAL assume true; 862048#factEXIT >#66#return; 862054#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862390#factFINAL assume true; 862382#factEXIT >#66#return; 862385#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862809#factFINAL assume true; 862799#factEXIT >#66#return; 861614#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862720#factFINAL assume true; 862662#factEXIT >#70#return; 861535#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 862556#factENTRY ~n := #in~n; 862553#L25 assume !(~n <= 0); 862039#L26 call #t~ret0 := fact(~n - 1);< 862551#factENTRY ~n := #in~n; 862223#L25 assume ~n <= 0;#res := 1; 862118#factFINAL assume true; 862111#factEXIT >#66#return; 862116#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 863805#factFINAL assume true; 862260#factEXIT >#72#return; 862301#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; 862657#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 862655#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 862653#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 862651#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; 861686#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 862648#factENTRY ~n := #in~n; 862647#L25 assume !(~n <= 0); 861610#L26 call #t~ret0 := fact(~n - 1);< 862645#factENTRY ~n := #in~n; 862643#L25 assume !(~n <= 0); 861603#L26 call #t~ret0 := fact(~n - 1);< 862637#factENTRY ~n := #in~n; 862636#L25 assume !(~n <= 0); 862049#L26 call #t~ret0 := fact(~n - 1);< 862587#factENTRY ~n := #in~n; 862586#L25 assume !(~n <= 0); 862037#L26 call #t~ret0 := fact(~n - 1);< 862537#factENTRY ~n := #in~n; 862534#L25 assume !(~n <= 0); 861708#L26 call #t~ret0 := fact(~n - 1);< 862061#factENTRY ~n := #in~n; 861721#L25 assume ~n <= 0;#res := 1; 861720#factFINAL assume true; 861701#factEXIT >#66#return; 861709#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862175#factFINAL assume true; 862036#factEXIT >#66#return; 862042#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862058#factFINAL assume true; 862048#factEXIT >#66#return; 862054#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862390#factFINAL assume true; 862382#factEXIT >#66#return; 862385#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862809#factFINAL assume true; 862799#factEXIT >#66#return; 862795#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862721#factFINAL assume true; 862664#factEXIT >#68#return; 861645#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 861580#factENTRY ~n := #in~n; 861655#L25 assume !(~n <= 0); 861599#L26 call #t~ret0 := fact(~n - 1);< 861654#factENTRY ~n := #in~n; 864019#L25 assume !(~n <= 0); 861604#L26 call #t~ret0 := fact(~n - 1);< 862393#factENTRY ~n := #in~n; 864019#L25 assume !(~n <= 0); 861604#L26 call #t~ret0 := fact(~n - 1);< 862393#factENTRY ~n := #in~n; 864019#L25 assume !(~n <= 0); 861604#L26 call #t~ret0 := fact(~n - 1);< 862393#factENTRY ~n := #in~n; 864019#L25 assume !(~n <= 0); 861604#L26 call #t~ret0 := fact(~n - 1);< 862393#factENTRY ~n := #in~n; 861721#L25 assume ~n <= 0;#res := 1; 861720#factFINAL assume true; 861701#factEXIT >#66#return; 861709#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862175#factFINAL assume true; 862036#factEXIT >#66#return; 862042#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862058#factFINAL assume true; 862048#factEXIT >#66#return; 862054#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862390#factFINAL assume true; 862382#factEXIT >#66#return; 862385#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862809#factFINAL assume true; 862799#factEXIT >#66#return; 861614#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862720#factFINAL assume true; 862662#factEXIT >#70#return; 861556#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 861569#factENTRY ~n := #in~n; 861571#L25 assume ~n <= 0;#res := 1; 861570#factFINAL assume true; 861515#factEXIT >#72#return; 861565#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; 864459#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 864458#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 864457#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 864455#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; 864077#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 864453#factENTRY ~n := #in~n; 864451#L25 assume !(~n <= 0); 861421#L26 call #t~ret0 := fact(~n - 1);< 864444#factENTRY ~n := #in~n; 864443#L25 assume !(~n <= 0); 861429#L26 call #t~ret0 := fact(~n - 1);< 864442#factENTRY ~n := #in~n; 864440#L25 assume !(~n <= 0); 861424#L26 call #t~ret0 := fact(~n - 1);< 864439#factENTRY ~n := #in~n; 864438#L25 assume !(~n <= 0); 861420#L26 call #t~ret0 := fact(~n - 1);< 864312#factENTRY ~n := #in~n; 864399#L25 assume !(~n <= 0); 861425#L26 call #t~ret0 := fact(~n - 1);< 864398#factENTRY ~n := #in~n; 864401#L25 assume ~n <= 0;#res := 1; 864400#factFINAL assume true; 864397#factEXIT >#66#return; 864396#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 864394#factFINAL assume true; 864393#factEXIT >#66#return; 864390#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 864388#factFINAL assume true; 864310#factEXIT >#66#return; 864308#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 864304#factFINAL assume true; 864292#factEXIT >#66#return; 864293#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 865219#factFINAL assume true; 861418#factEXIT >#66#return; 861430#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 864585#factFINAL assume true; 864425#factEXIT >#74#return; 864420#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 864436#factENTRY ~n := #in~n; 864446#L25 assume !(~n <= 0); 862792#L26 call #t~ret0 := fact(~n - 1);< 862821#factENTRY ~n := #in~n; 862819#L25 assume !(~n <= 0); 862755#L26 call #t~ret0 := fact(~n - 1);< 862794#factENTRY ~n := #in~n; 862824#L25 assume !(~n <= 0); 862759#L26 call #t~ret0 := fact(~n - 1);< 862807#factENTRY ~n := #in~n; 862824#L25 assume !(~n <= 0); 862759#L26 call #t~ret0 := fact(~n - 1);< 862807#factENTRY ~n := #in~n; 862824#L25 assume !(~n <= 0); 862759#L26 call #t~ret0 := fact(~n - 1);< 862807#factENTRY ~n := #in~n; 862820#L25 assume ~n <= 0;#res := 1; 862818#factFINAL assume true; 862804#factEXIT >#66#return; 862798#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 862788#factFINAL assume true; 862743#factEXIT >#66#return; 862762#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 864130#factFINAL assume true; 864127#factEXIT >#66#return; 864126#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 864115#factFINAL assume true; 864099#factEXIT >#66#return; 864100#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 866131#factFINAL assume true; 863317#factEXIT >#66#return; 863143#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 866100#factFINAL assume true; 864523#factEXIT >#76#return; 864324#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 861512#factENTRY ~n := #in~n; 864417#L25 assume !(~n <= 0); 864414#L26 call #t~ret0 := fact(~n - 1);< 864416#factENTRY ~n := #in~n; 864437#L25 assume ~n <= 0;#res := 1; 864418#factFINAL assume true; 864412#factEXIT >#66#return; 864410#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 864409#factFINAL assume true; 864323#factEXIT >#78#return; 862714#L30-8 [2022-11-20 09:43:33,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:43:33,583 INFO L85 PathProgramCache]: Analyzing trace with hash 478774201, now seen corresponding path program 48 times [2022-11-20 09:43:33,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:43:33,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681384622] [2022-11-20 09:43:33,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:43:33,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:43:33,606 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:43:33,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [882655845] [2022-11-20 09:43:33,606 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-20 09:43:33,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:43:33,607 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:43:33,615 INFO L229 MonitoredProcess]: Starting monitored process 359 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:43:33,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (359)] Waiting until timeout for monitored process [2022-11-20 09:43:34,371 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-11-20 09:43:34,371 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:43:34,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 09:43:34,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:43:34,514 INFO L134 CoverageAnalysis]: Checked inductivity of 39137 backedges. 7183 proven. 48 refuted. 0 times theorem prover too weak. 31906 trivial. 0 not checked. [2022-11-20 09:43:34,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:43:35,189 INFO L134 CoverageAnalysis]: Checked inductivity of 39137 backedges. 391 proven. 48 refuted. 0 times theorem prover too weak. 38698 trivial. 0 not checked. [2022-11-20 09:43:35,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:43:35,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681384622] [2022-11-20 09:43:35,190 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 09:43:35,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882655845] [2022-11-20 09:43:35,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [882655845] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:43:35,190 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:43:35,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2022-11-20 09:43:35,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190773009] [2022-11-20 09:43:35,191 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:43:35,192 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-20 09:43:35,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:43:35,192 INFO L85 PathProgramCache]: Analyzing trace with hash -882149077, now seen corresponding path program 43 times [2022-11-20 09:43:35,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:43:35,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293708697] [2022-11-20 09:43:35,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:43:35,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:43:35,209 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:43:35,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [33465030] [2022-11-20 09:43:35,210 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 09:43:35,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:43:35,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:43:35,212 INFO L229 MonitoredProcess]: Starting monitored process 360 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:43:35,212 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (360)] Waiting until timeout for monitored process [2022-11-20 09:43:36,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:43:36,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 1241 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-20 09:43:36,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:43:36,354 INFO L134 CoverageAnalysis]: Checked inductivity of 22885 backedges. 9869 proven. 590 refuted. 0 times theorem prover too weak. 12426 trivial. 0 not checked. [2022-11-20 09:43:36,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:43:39,630 INFO L134 CoverageAnalysis]: Checked inductivity of 22885 backedges. 447 proven. 3884 refuted. 0 times theorem prover too weak. 18554 trivial. 0 not checked. [2022-11-20 09:43:39,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:43:39,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293708697] [2022-11-20 09:43:39,631 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 09:43:39,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33465030] [2022-11-20 09:43:39,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33465030] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:43:39,631 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:43:39,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 29] total 35 [2022-11-20 09:43:39,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287752098] [2022-11-20 09:43:39,632 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:43:39,632 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 09:43:39,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:43:39,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-20 09:43:39,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1037, Unknown=0, NotChecked=0, Total=1190 [2022-11-20 09:43:39,635 INFO L87 Difference]: Start difference. First operand 5747 states and 9277 transitions. cyclomatic complexity: 3591 Second operand has 35 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 35 states have internal predecessors, (84), 20 states have call successors, (38), 2 states have call predecessors, (38), 13 states have return successors, (45), 16 states have call predecessors, (45), 20 states have call successors, (45) [2022-11-20 09:43:42,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:43:42,797 INFO L93 Difference]: Finished difference Result 6496 states and 10335 transitions. [2022-11-20 09:43:42,797 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6496 states and 10335 transitions. [2022-11-20 09:43:42,834 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 766 [2022-11-20 09:43:42,877 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6496 states to 6494 states and 10331 transitions. [2022-11-20 09:43:42,877 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 580 [2022-11-20 09:43:42,878 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 580 [2022-11-20 09:43:42,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6494 states and 10331 transitions. [2022-11-20 09:43:42,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 09:43:42,878 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6494 states and 10331 transitions. [2022-11-20 09:43:42,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6494 states and 10331 transitions. [2022-11-20 09:43:42,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6494 to 5748. [2022-11-20 09:43:42,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5748 states, 3568 states have (on average 1.0420403587443947) internal successors, (3718), 3543 states have internal predecessors, (3718), 1563 states have call successors, (1609), 714 states have call predecessors, (1609), 617 states have return successors, (3897), 1490 states have call predecessors, (3897), 1563 states have call successors, (3897) [2022-11-20 09:43:42,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5748 states to 5748 states and 9224 transitions. [2022-11-20 09:43:42,977 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5748 states and 9224 transitions. [2022-11-20 09:43:42,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-20 09:43:42,978 INFO L428 stractBuchiCegarLoop]: Abstraction has 5748 states and 9224 transitions. [2022-11-20 09:43:42,978 INFO L335 stractBuchiCegarLoop]: ======== Iteration 71 ============ [2022-11-20 09:43:42,978 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5748 states and 9224 transitions. [2022-11-20 09:43:42,991 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 680 [2022-11-20 09:43:42,992 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 09:43:42,992 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 09:43:42,994 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [128, 128, 77, 77, 77, 77, 51, 17, 16, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 7, 7, 7, 7, 7, 6, 6, 4, 3, 3, 1, 1, 1, 1] [2022-11-20 09:43:42,995 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [96, 96, 75, 75, 75, 75, 21, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:43:42,995 INFO L748 eck$LassoCheckResult]: Stem: 882203#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 882173#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; 882174#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 882202#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; 882189#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 882190#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 886785#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; 882143#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 882144#factENTRY ~n := #in~n; 886821#L25 assume ~n <= 0;#res := 1; 886819#factFINAL assume true; 886816#factEXIT >#68#return; 882221#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 882222#factENTRY ~n := #in~n; 886761#L25 assume ~n <= 0;#res := 1; 886759#factFINAL assume true; 886756#factEXIT >#70#return; 882139#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 882140#factENTRY ~n := #in~n; 886844#L25 assume ~n <= 0;#res := 1; 886843#factFINAL assume true; 886842#factEXIT >#72#return; 882198#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; 882195#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 882196#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 887485#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 887319#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; 887320#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 887349#factENTRY ~n := #in~n; 887357#L25 assume !(~n <= 0); 887355#L26 call #t~ret0 := fact(~n - 1);< 887356#factENTRY ~n := #in~n; 887360#L25 assume ~n <= 0;#res := 1; 887358#factFINAL assume true; 887354#factEXIT >#66#return; 887352#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 887350#factFINAL assume true; 887348#factEXIT >#74#return; 887346#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 887347#factENTRY ~n := #in~n; 887353#L25 assume ~n <= 0;#res := 1; 887351#factFINAL assume true; 887345#factEXIT >#76#return; 887343#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 887344#factENTRY ~n := #in~n; 887365#L25 assume !(~n <= 0); 887363#L26 call #t~ret0 := fact(~n - 1);< 887364#factENTRY ~n := #in~n; 887367#L25 assume ~n <= 0;#res := 1; 887366#factFINAL assume true; 887362#factEXIT >#66#return; 887361#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 887359#factFINAL assume true; 887342#factEXIT >#78#return; 887341#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; 887339#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 887337#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 887336#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 887335#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; 887256#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 887259#factENTRY ~n := #in~n; 887303#L25 assume !(~n <= 0); 887270#L26 call #t~ret0 := fact(~n - 1);< 887274#factENTRY ~n := #in~n; 887283#L25 assume !(~n <= 0); 887268#L26 call #t~ret0 := fact(~n - 1);< 887282#factENTRY ~n := #in~n; 887286#L25 assume ~n <= 0;#res := 1; 887284#factFINAL assume true; 887281#factEXIT >#66#return; 887280#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 887275#factFINAL assume true; 887267#factEXIT >#66#return; 887266#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 887264#factFINAL assume true; 887253#factEXIT >#74#return; 887258#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 887244#factENTRY ~n := #in~n; 887340#L25 assume ~n <= 0;#res := 1; 887338#factFINAL assume true; 887334#factEXIT >#76#return; 887328#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 887332#factENTRY ~n := #in~n; 887376#L25 assume !(~n <= 0); 887373#L26 call #t~ret0 := fact(~n - 1);< 887375#factENTRY ~n := #in~n; 887383#L25 assume !(~n <= 0); 887371#L26 call #t~ret0 := fact(~n - 1);< 887385#factENTRY ~n := #in~n; 887398#L25 assume ~n <= 0;#res := 1; 887397#factFINAL assume true; 887384#factEXIT >#66#return; 887382#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 887377#factFINAL assume true; 887369#factEXIT >#66#return; 887368#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 887333#factFINAL assume true; 887327#factEXIT >#78#return; 887326#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; 887325#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 887324#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 887323#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 887321#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; 886884#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 886978#factENTRY ~n := #in~n; 886897#L25 assume !(~n <= 0); 886892#L26 call #t~ret0 := fact(~n - 1);< 887081#factENTRY ~n := #in~n; 887060#L25 assume !(~n <= 0); 886893#L26 call #t~ret0 := fact(~n - 1);< 886922#factENTRY ~n := #in~n; 887060#L25 assume !(~n <= 0); 886893#L26 call #t~ret0 := fact(~n - 1);< 886922#factENTRY ~n := #in~n; 887075#L25 assume ~n <= 0;#res := 1; 887076#factFINAL assume true; 887085#factEXIT >#66#return; 887067#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 887068#factFINAL assume true; 886919#factEXIT >#66#return; 886920#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 886891#factFINAL assume true; 886894#factEXIT >#66#return; 886883#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 886885#factFINAL assume true; 886977#factEXIT >#74#return; 886950#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 886951#factENTRY ~n := #in~n; 886964#L25 assume ~n <= 0;#res := 1; 886963#factFINAL assume true; 886949#factEXIT >#76#return; 886940#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 886944#factENTRY ~n := #in~n; 886942#L25 assume !(~n <= 0); 886910#L26 call #t~ret0 := fact(~n - 1);< 886941#factENTRY ~n := #in~n; 887053#L25 assume !(~n <= 0); 886911#L26 call #t~ret0 := fact(~n - 1);< 886926#factENTRY ~n := #in~n; 886972#L25 assume !(~n <= 0); 886909#L26 call #t~ret0 := fact(~n - 1);< 886971#factENTRY ~n := #in~n; 886974#L25 assume ~n <= 0;#res := 1; 886973#factFINAL assume true; 886970#factEXIT >#66#return; 886969#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 886968#factFINAL assume true; 886961#factEXIT >#66#return; 886957#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 886956#factFINAL assume true; 886945#factEXIT >#66#return; 886915#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 887062#factFINAL assume true; 887051#factEXIT >#78#return; 883746#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; 883745#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 883744#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 883720#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 883719#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 883718#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 883434#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 883124#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; 883110#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 883112#factENTRY ~n := #in~n; 883123#L25 assume !(~n <= 0); 883120#L26 call #t~ret0 := fact(~n - 1);< 883121#factENTRY ~n := #in~n; 883128#L25 assume ~n <= 0;#res := 1; 883126#factFINAL assume true; 883119#factEXIT >#66#return; 883118#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 883117#factFINAL assume true; 883109#factEXIT >#68#return; 883089#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 883091#factENTRY ~n := #in~n; 883113#L25 assume ~n <= 0;#res := 1; 883107#factFINAL assume true; 883088#factEXIT >#70#return; 883083#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 883086#factENTRY ~n := #in~n; 883129#L25 assume !(~n <= 0); 883115#L26 call #t~ret0 := fact(~n - 1);< 883116#factENTRY ~n := #in~n; 883127#L25 assume ~n <= 0;#res := 1; 883125#factFINAL assume true; 883114#factEXIT >#66#return; 883108#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 883106#factFINAL assume true; 883082#factEXIT >#72#return; 883085#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; 883096#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 883095#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 883094#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 883072#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; 883060#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 883056#factENTRY ~n := #in~n; 883075#L25 assume !(~n <= 0); 883032#L26 call #t~ret0 := fact(~n - 1);< 883026#factENTRY ~n := #in~n; 883043#L25 assume ~n <= 0;#res := 1; 883031#factFINAL assume true; 883034#factEXIT >#66#return; 883073#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 883071#factFINAL assume true; 883059#factEXIT >#68#return; 883036#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 883057#factENTRY ~n := #in~n; 883142#L25 assume !(~n <= 0); 883139#L26 call #t~ret0 := fact(~n - 1);< 883140#factENTRY ~n := #in~n; 883143#L25 assume ~n <= 0;#res := 1; 883141#factFINAL assume true; 883138#factEXIT >#66#return; 883137#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 883136#factFINAL assume true; 883068#factEXIT >#70#return; 883062#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 883066#factENTRY ~n := #in~n; 883135#L25 assume ~n <= 0;#res := 1; 883067#factFINAL assume true; 883061#factEXIT >#72#return; 883065#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; 883087#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 883081#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 883027#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 883028#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; 883010#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 883070#factENTRY ~n := #in~n; 883038#L25 assume !(~n <= 0); 883022#L26 call #t~ret0 := fact(~n - 1);< 883051#factENTRY ~n := #in~n; 883049#L25 assume !(~n <= 0); 883023#L26 call #t~ret0 := fact(~n - 1);< 883047#factENTRY ~n := #in~n; 883050#L25 assume ~n <= 0;#res := 1; 883048#factFINAL assume true; 883046#factEXIT >#66#return; 883044#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 883045#factFINAL assume true; 883021#factEXIT >#66#return; 883024#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 883009#factFINAL assume true; 883012#factEXIT >#74#return; 882986#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 883900#factENTRY ~n := #in~n; 883898#L25 assume !(~n <= 0); 883785#L26 call #t~ret0 := fact(~n - 1);< 883792#factENTRY ~n := #in~n; 883800#L25 assume ~n <= 0;#res := 1; 883796#factFINAL assume true; 883784#factEXIT >#66#return; 883789#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 883930#factFINAL assume true; 882985#factEXIT >#76#return; 882980#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 882983#factENTRY ~n := #in~n; 883001#L25 assume !(~n <= 0); 882998#L26 call #t~ret0 := fact(~n - 1);< 882999#factENTRY ~n := #in~n; 883002#L25 assume ~n <= 0;#res := 1; 883000#factFINAL assume true; 882997#factEXIT >#66#return; 882995#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 882994#factFINAL assume true; 882979#factEXIT >#78#return; 882975#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; 882972#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 882971#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 882970#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 882967#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; 882838#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 882842#factENTRY ~n := #in~n; 882850#L25 assume !(~n <= 0); 882847#L26 call #t~ret0 := fact(~n - 1);< 882848#factENTRY ~n := #in~n; 882855#L25 assume !(~n <= 0); 882846#L26 call #t~ret0 := fact(~n - 1);< 882853#factENTRY ~n := #in~n; 882855#L25 assume !(~n <= 0); 882846#L26 call #t~ret0 := fact(~n - 1);< 882853#factENTRY ~n := #in~n; 882859#L25 assume ~n <= 0;#res := 1; 882858#factFINAL assume true; 882857#factEXIT >#66#return; 882856#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 882854#factFINAL assume true; 882852#factEXIT >#66#return; 882851#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 882849#factFINAL assume true; 882845#factEXIT >#66#return; 882844#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 882843#factFINAL assume true; 882837#factEXIT >#74#return; 882595#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 882835#factENTRY ~n := #in~n; 882655#L25 assume !(~n <= 0); 882649#L26 call #t~ret0 := fact(~n - 1);< 882652#factENTRY ~n := #in~n; 882654#L25 assume ~n <= 0;#res := 1; 882653#factFINAL assume true; 882648#factEXIT >#66#return; 882643#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 882644#factFINAL assume true; 882594#factEXIT >#76#return; 882570#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 882572#factENTRY ~n := #in~n; 882870#L25 assume !(~n <= 0); 882764#L26 call #t~ret0 := fact(~n - 1);< 882777#factENTRY ~n := #in~n; 882816#L25 assume !(~n <= 0); 882771#L26 call #t~ret0 := fact(~n - 1);< 882811#factENTRY ~n := #in~n; 882790#L25 assume ~n <= 0;#res := 1; 882788#factFINAL assume true; 882784#factEXIT >#66#return; 882783#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 882778#factFINAL assume true; 882763#factEXIT >#66#return; 882673#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 882668#factFINAL assume true; 882568#factEXIT >#78#return; 882571#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; 883908#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 883907#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 883906#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 883905#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 883903#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 883904#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 886307#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; 882522#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 882526#factENTRY ~n := #in~n; 882573#L25 assume !(~n <= 0); 882552#L26 call #t~ret0 := fact(~n - 1);< 882555#factENTRY ~n := #in~n; 882566#L25 assume !(~n <= 0); 882551#L26 call #t~ret0 := fact(~n - 1);< 882564#factENTRY ~n := #in~n; 882582#L25 assume ~n <= 0;#res := 1; 882581#factFINAL assume true; 882579#factEXIT >#66#return; 882577#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 882563#factFINAL assume true; 882550#factEXIT >#66#return; 882543#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 882529#factFINAL assume true; 882519#factEXIT >#68#return; 882525#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 882517#factENTRY ~n := #in~n; 886306#L25 assume ~n <= 0;#res := 1; 886305#factFINAL assume true; 886299#factEXIT >#70#return; 886295#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 886298#factENTRY ~n := #in~n; 886546#L25 assume !(~n <= 0); 886534#L26 call #t~ret0 := fact(~n - 1);< 886545#factENTRY ~n := #in~n; 886739#L25 assume !(~n <= 0); 886536#L26 call #t~ret0 := fact(~n - 1);< 886815#factENTRY ~n := #in~n; 886552#L25 assume ~n <= 0;#res := 1; 886551#factFINAL assume true; 886548#factEXIT >#66#return; 886547#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 886544#factFINAL assume true; 886533#factEXIT >#66#return; 886537#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 886448#factFINAL assume true; 886294#factEXIT >#72#return; 886297#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; 886760#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 886758#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 886757#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 886755#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; 886221#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 886224#factENTRY ~n := #in~n; 886240#L25 assume !(~n <= 0); 886233#L26 call #t~ret0 := fact(~n - 1);< 886234#factENTRY ~n := #in~n; 886577#L25 assume !(~n <= 0); 886342#L26 call #t~ret0 := fact(~n - 1);< 886343#factENTRY ~n := #in~n; 886346#L25 assume ~n <= 0;#res := 1; 886344#factFINAL assume true; 886341#factEXIT >#66#return; 886336#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 886335#factFINAL assume true; 886232#factEXIT >#66#return; 886230#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 886227#factFINAL assume true; 886217#factEXIT >#68#return; 886223#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 886242#factENTRY ~n := #in~n; 886360#L25 assume !(~n <= 0); 886355#L26 call #t~ret0 := fact(~n - 1);< 886357#factENTRY ~n := #in~n; 886361#L25 assume ~n <= 0;#res := 1; 886359#factFINAL assume true; 886353#factEXIT >#66#return; 886356#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 886278#factFINAL assume true; 886241#factEXIT >#70#return; 886236#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 886239#factENTRY ~n := #in~n; 886358#L25 assume !(~n <= 0); 886354#L26 call #t~ret0 := fact(~n - 1);< 886357#factENTRY ~n := #in~n; 886361#L25 assume ~n <= 0;#res := 1; 886359#factFINAL assume true; 886353#factEXIT >#66#return; 886352#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 886351#factFINAL assume true; 886235#factEXIT >#72#return; 886231#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; 886229#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 886228#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 886226#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 886225#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; 886220#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 886224#factENTRY ~n := #in~n; 886240#L25 assume !(~n <= 0); 886233#L26 call #t~ret0 := fact(~n - 1);< 886234#factENTRY ~n := #in~n; 886577#L25 assume !(~n <= 0); 886342#L26 call #t~ret0 := fact(~n - 1);< 886343#factENTRY ~n := #in~n; 886346#L25 assume ~n <= 0;#res := 1; 886344#factFINAL assume true; 886341#factEXIT >#66#return; 886336#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 886335#factFINAL assume true; 886232#factEXIT >#66#return; 886230#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 886227#factFINAL assume true; 886217#factEXIT >#68#return; 886210#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 886212#factENTRY ~n := #in~n; 886334#L25 assume !(~n <= 0); 886325#L26 call #t~ret0 := fact(~n - 1);< 886333#factENTRY ~n := #in~n; 886828#L25 assume !(~n <= 0); 886348#L26 call #t~ret0 := fact(~n - 1);< 886349#factENTRY ~n := #in~n; 886365#L25 assume ~n <= 0;#res := 1; 886364#factFINAL assume true; 886347#factEXIT >#66#return; 886345#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 886337#factFINAL assume true; 886321#factEXIT >#66#return; 886319#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 886216#factFINAL assume true; 886209#factEXIT >#70#return; 886205#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 886207#factENTRY ~n := #in~n; 886304#L25 assume ~n <= 0;#res := 1; 886303#factFINAL assume true; 886203#factEXIT >#72#return; 886206#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; 886248#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 886246#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 886244#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 886243#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; 886181#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 886182#factENTRY ~n := #in~n; 886215#L25 assume !(~n <= 0); 886188#L26 call #t~ret0 := fact(~n - 1);< 886191#factENTRY ~n := #in~n; 886289#L25 assume !(~n <= 0); 886189#L26 call #t~ret0 := fact(~n - 1);< 886287#factENTRY ~n := #in~n; 886289#L25 assume !(~n <= 0); 886189#L26 call #t~ret0 := fact(~n - 1);< 886287#factENTRY ~n := #in~n; 886411#L25 assume ~n <= 0;#res := 1; 886410#factFINAL assume true; 886409#factEXIT >#66#return; 886408#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 886406#factFINAL assume true; 886286#factEXIT >#66#return; 886284#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 886283#factFINAL assume true; 886186#factEXIT >#66#return; 886190#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 886214#factFINAL assume true; 886180#factEXIT >#74#return; 886028#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 886072#factENTRY ~n := #in~n; 886073#L25 assume !(~n <= 0); 886006#L26 call #t~ret0 := fact(~n - 1);< 886026#factENTRY ~n := #in~n; 886024#L25 assume !(~n <= 0); 886020#L26 call #t~ret0 := fact(~n - 1);< 886022#factENTRY ~n := #in~n; 886025#L25 assume ~n <= 0;#res := 1; 886023#factFINAL assume true; 886019#factEXIT >#66#return; 886018#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 886015#factFINAL assume true; 885992#factEXIT >#66#return; 886013#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 886841#factFINAL assume true; 886830#factEXIT >#76#return; 885942#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 885943#factENTRY ~n := #in~n; 886656#L25 assume !(~n <= 0); 886653#L26 call #t~ret0 := fact(~n - 1);< 886654#factENTRY ~n := #in~n; 886663#L25 assume ~n <= 0;#res := 1; 886661#factFINAL assume true; 886652#factEXIT >#66#return; 886651#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 886643#factFINAL assume true; 885941#factEXIT >#78#return; 885940#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; 885939#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 885938#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 885937#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 885936#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 885935#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 885933#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 882642#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; 882584#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 882592#factENTRY ~n := #in~n; 882603#L25 assume !(~n <= 0); 882553#L26 call #t~ret0 := fact(~n - 1);< 882555#factENTRY ~n := #in~n; 882566#L25 assume !(~n <= 0); 882551#L26 call #t~ret0 := fact(~n - 1);< 882564#factENTRY ~n := #in~n; 882566#L25 assume !(~n <= 0); 882551#L26 call #t~ret0 := fact(~n - 1);< 882564#factENTRY ~n := #in~n; 882582#L25 assume ~n <= 0;#res := 1; 882581#factFINAL assume true; 882579#factEXIT >#66#return; 882577#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 882563#factFINAL assume true; 882550#factEXIT >#66#return; 882554#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 882610#factFINAL assume true; 882608#factEXIT >#66#return; 882606#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 882602#factFINAL assume true; 882591#factEXIT >#68#return; 882511#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 882516#factENTRY ~n := #in~n; 882538#L25 assume ~n <= 0;#res := 1; 882528#factFINAL assume true; 882509#factEXIT >#70#return; 882514#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 882645#factENTRY ~n := #in~n; 882639#L25 assume !(~n <= 0); 882545#L26 call #t~ret0 := fact(~n - 1);< 882605#factENTRY ~n := #in~n; 882601#L25 assume !(~n <= 0); 882532#L26 call #t~ret0 := fact(~n - 1);< 882547#factENTRY ~n := #in~n; 882662#L25 assume !(~n <= 0); 882558#L26 call #t~ret0 := fact(~n - 1);< 882559#factENTRY ~n := #in~n; 882575#L25 assume ~n <= 0;#res := 1; 882574#factFINAL assume true; 882557#factEXIT >#66#return; 882556#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 882544#factFINAL assume true; 882530#factEXIT >#66#return; 882536#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 884959#factFINAL assume true; 884946#factEXIT >#66#return; 884947#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 885934#factFINAL assume true; 885931#factEXIT >#72#return; 885930#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; 885929#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 885927#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 885925#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 885924#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; 882327#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 882331#factENTRY ~n := #in~n; 884622#L25 assume !(~n <= 0); 884541#L26 call #t~ret0 := fact(~n - 1);< 884548#factENTRY ~n := #in~n; 887855#L25 assume !(~n <= 0); 882170#L26 call #t~ret0 := fact(~n - 1);< 882169#factENTRY ~n := #in~n; 882172#L25 assume !(~n <= 0); 882214#L26 call #t~ret0 := fact(~n - 1);< 882456#factENTRY ~n := #in~n; 882462#L25 assume ~n <= 0;#res := 1; 882461#factFINAL assume true; 882455#factEXIT >#66#return; 882452#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 882446#factFINAL assume true; 882334#factEXIT >#66#return; 882356#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 884606#factFINAL assume true; 884539#factEXIT >#66#return; 882399#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 882366#factFINAL assume true; 882322#factEXIT >#68#return; 882329#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 885866#factENTRY ~n := #in~n; 885891#L25 assume !(~n <= 0); 882351#L26 call #t~ret0 := fact(~n - 1);< 885890#factENTRY ~n := #in~n; 884393#L25 assume ~n <= 0;#res := 1; 884368#factFINAL assume true; 884354#factEXIT >#66#return; 884359#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 885867#factFINAL assume true; 885865#factEXIT >#70#return; 882448#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 885525#factENTRY ~n := #in~n; 885510#L25 assume !(~n <= 0); 882216#L26 call #t~ret0 := fact(~n - 1);< 882449#factENTRY ~n := #in~n; 882172#L25 assume !(~n <= 0); 882214#L26 call #t~ret0 := fact(~n - 1);< 882456#factENTRY ~n := #in~n; 882462#L25 assume ~n <= 0;#res := 1; 882461#factFINAL assume true; 882455#factEXIT >#66#return; 882452#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 882446#factFINAL assume true; 882334#factEXIT >#66#return; 882357#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 885923#factFINAL assume true; 885921#factEXIT >#72#return; 885920#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; 885919#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 885918#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 885916#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 885914#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; 882328#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 882331#factENTRY ~n := #in~n; 884622#L25 assume !(~n <= 0); 884541#L26 call #t~ret0 := fact(~n - 1);< 884548#factENTRY ~n := #in~n; 887855#L25 assume !(~n <= 0); 882170#L26 call #t~ret0 := fact(~n - 1);< 882169#factENTRY ~n := #in~n; 882172#L25 assume !(~n <= 0); 882214#L26 call #t~ret0 := fact(~n - 1);< 882456#factENTRY ~n := #in~n; 882462#L25 assume ~n <= 0;#res := 1; 882461#factFINAL assume true; 882455#factEXIT >#66#return; 882452#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 882446#factFINAL assume true; 882334#factEXIT >#66#return; 882356#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 884606#factFINAL assume true; 884539#factEXIT >#66#return; 882399#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 882366#factFINAL assume true; 882322#factEXIT >#68#return; 882239#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 882241#factENTRY ~n := #in~n; 882363#L25 assume !(~n <= 0); 882347#L26 call #t~ret0 := fact(~n - 1);< 882362#factENTRY ~n := #in~n; 886848#L25 assume !(~n <= 0); 882213#L26 call #t~ret0 := fact(~n - 1);< 882457#factENTRY ~n := #in~n; 882462#L25 assume ~n <= 0;#res := 1; 882461#factFINAL assume true; 882455#factEXIT >#66#return; 882452#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 882446#factFINAL assume true; 882334#factEXIT >#66#return; 882361#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 885910#factFINAL assume true; 885909#factEXIT >#70#return; 884370#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 885908#factENTRY ~n := #in~n; 885944#L25 assume !(~n <= 0); 884355#L26 call #t~ret0 := fact(~n - 1);< 884372#factENTRY ~n := #in~n; 884393#L25 assume ~n <= 0;#res := 1; 884368#factFINAL assume true; 884354#factEXIT >#66#return; 884358#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 885911#factFINAL assume true; 885906#factEXIT >#72#return; 885907#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; 885917#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 885915#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 885913#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 885912#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; 882323#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 882331#factENTRY ~n := #in~n; 884622#L25 assume !(~n <= 0); 884541#L26 call #t~ret0 := fact(~n - 1);< 884548#factENTRY ~n := #in~n; 887855#L25 assume !(~n <= 0); 882170#L26 call #t~ret0 := fact(~n - 1);< 882169#factENTRY ~n := #in~n; 882172#L25 assume !(~n <= 0); 882214#L26 call #t~ret0 := fact(~n - 1);< 882456#factENTRY ~n := #in~n; 882462#L25 assume ~n <= 0;#res := 1; 882461#factFINAL assume true; 882455#factEXIT >#66#return; 882452#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 882446#factFINAL assume true; 882334#factEXIT >#66#return; 882356#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 884606#factFINAL assume true; 884539#factEXIT >#66#return; 882399#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 882366#factFINAL assume true; 882322#factEXIT >#68#return; 882238#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 882241#factENTRY ~n := #in~n; 882363#L25 assume !(~n <= 0); 882347#L26 call #t~ret0 := fact(~n - 1);< 882362#factENTRY ~n := #in~n; 886848#L25 assume !(~n <= 0); 882213#L26 call #t~ret0 := fact(~n - 1);< 882457#factENTRY ~n := #in~n; 882172#L25 assume !(~n <= 0); 882214#L26 call #t~ret0 := fact(~n - 1);< 882456#factENTRY ~n := #in~n; 882462#L25 assume ~n <= 0;#res := 1; 882461#factFINAL assume true; 882455#factEXIT >#66#return; 882452#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 882446#factFINAL assume true; 882334#factEXIT >#66#return; 882356#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 884606#factFINAL assume true; 884539#factEXIT >#66#return; 882332#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 882333#factFINAL assume true; 882236#factEXIT >#70#return; 882230#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 882233#factENTRY ~n := #in~n; 882235#L25 assume ~n <= 0;#res := 1; 882234#factFINAL assume true; 882228#factEXIT >#72#return; 882232#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; 885046#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 885045#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 885043#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 885042#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; 884834#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 885041#factENTRY ~n := #in~n; 885040#L25 assume !(~n <= 0); 882123#L26 call #t~ret0 := fact(~n - 1);< 885038#factENTRY ~n := #in~n; 885036#L25 assume !(~n <= 0); 882133#L26 call #t~ret0 := fact(~n - 1);< 884101#factENTRY ~n := #in~n; 884150#L25 assume !(~n <= 0); 882127#L26 call #t~ret0 := fact(~n - 1);< 884144#factENTRY ~n := #in~n; 884150#L25 assume !(~n <= 0); 882127#L26 call #t~ret0 := fact(~n - 1);< 884144#factENTRY ~n := #in~n; 884149#L25 assume ~n <= 0;#res := 1; 884146#factFINAL assume true; 884143#factEXIT >#66#return; 884138#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 884132#factFINAL assume true; 884106#factEXIT >#66#return; 884104#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 884100#factFINAL assume true; 884089#factEXIT >#66#return; 884090#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 885086#factFINAL assume true; 885084#factEXIT >#66#return; 885082#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 885081#factFINAL assume true; 885079#factEXIT >#74#return; 884977#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 885078#factENTRY ~n := #in~n; 885077#L25 assume !(~n <= 0); 884070#L26 call #t~ret0 := fact(~n - 1);< 884082#factENTRY ~n := #in~n; 884076#L25 assume !(~n <= 0); 883983#L26 call #t~ret0 := fact(~n - 1);< 884064#factENTRY ~n := #in~n; 884060#L25 assume !(~n <= 0); 883981#L26 call #t~ret0 := fact(~n - 1);< 884036#factENTRY ~n := #in~n; 884027#L25 assume !(~n <= 0); 884021#L26 call #t~ret0 := fact(~n - 1);< 884024#factENTRY ~n := #in~n; 884028#L25 assume ~n <= 0;#res := 1; 884025#factFINAL assume true; 884020#factEXIT >#66#return; 884019#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 884006#factFINAL assume true; 883980#factEXIT >#66#return; 883999#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 884976#factFINAL assume true; 884971#factEXIT >#66#return; 884968#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 884967#factFINAL assume true; 884961#factEXIT >#66#return; 884966#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 885255#factFINAL assume true; 885253#factEXIT >#76#return; 885075#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 883976#factENTRY ~n := #in~n; 885250#L25 assume !(~n <= 0); 885246#L26 call #t~ret0 := fact(~n - 1);< 882183#factENTRY ~n := #in~n; 885263#L25 assume ~n <= 0;#res := 1; 885258#factFINAL assume true; 885245#factEXIT >#66#return; 885244#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 885242#factFINAL assume true; 885074#factEXIT >#78#return; 884854#L30-8 [2022-11-20 09:43:42,996 INFO L750 eck$LassoCheckResult]: Loop: 884854#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; 885068#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 885063#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 885055#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 885053#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 885051#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 885049#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 883008#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; 882861#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 882758#factENTRY ~n := #in~n; 882909#L25 assume !(~n <= 0); 882715#L26 call #t~ret0 := fact(~n - 1);< 882745#factENTRY ~n := #in~n; 882742#L25 assume !(~n <= 0); 882711#L26 call #t~ret0 := fact(~n - 1);< 882717#factENTRY ~n := #in~n; 882738#L25 assume !(~n <= 0); 882706#L26 call #t~ret0 := fact(~n - 1);< 882720#factENTRY ~n := #in~n; 882735#L25 assume !(~n <= 0); 882704#L26 call #t~ret0 := fact(~n - 1);< 882724#factENTRY ~n := #in~n; 882730#L25 assume !(~n <= 0); 882709#L26 call #t~ret0 := fact(~n - 1);< 882728#factENTRY ~n := #in~n; 882731#L25 assume ~n <= 0;#res := 1; 882729#factFINAL assume true; 882727#factEXIT >#66#return; 882726#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 882725#factFINAL assume true; 882723#factEXIT >#66#return; 882722#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 882721#factFINAL assume true; 882719#factEXIT >#66#return; 882718#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 882714#factFINAL assume true; 882703#factEXIT >#66#return; 882712#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 882916#factFINAL assume true; 882906#factEXIT >#66#return; 882905#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 882902#factFINAL assume true; 882860#factEXIT >#68#return; 882680#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 882692#factENTRY ~n := #in~n; 882694#L25 assume ~n <= 0;#res := 1; 882693#factFINAL assume true; 882679#factEXIT >#70#return; 882676#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 882751#factENTRY ~n := #in~n; 882675#L25 assume !(~n <= 0); 882678#L26 call #t~ret0 := fact(~n - 1);< 882672#factENTRY ~n := #in~n; 884937#L25 assume !(~n <= 0); 884928#L26 call #t~ret0 := fact(~n - 1);< 882660#factENTRY ~n := #in~n; 884949#L25 assume !(~n <= 0); 882546#L26 call #t~ret0 := fact(~n - 1);< 882605#factENTRY ~n := #in~n; 882601#L25 assume !(~n <= 0); 882532#L26 call #t~ret0 := fact(~n - 1);< 882547#factENTRY ~n := #in~n; 882662#L25 assume !(~n <= 0); 882558#L26 call #t~ret0 := fact(~n - 1);< 882559#factENTRY ~n := #in~n; 882575#L25 assume ~n <= 0;#res := 1; 882574#factFINAL assume true; 882557#factEXIT >#66#return; 882556#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 882544#factFINAL assume true; 882530#factEXIT >#66#return; 882536#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 884959#factFINAL assume true; 884946#factEXIT >#66#return; 884944#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 884943#factFINAL assume true; 884927#factEXIT >#66#return; 884925#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 884923#factFINAL assume true; 884866#factEXIT >#66#return; 884864#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 884856#factFINAL assume true; 884850#factEXIT >#72#return; 884851#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; 885863#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 885862#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 885861#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 885860#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; 884260#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 884275#factENTRY ~n := #in~n; 884381#L25 assume !(~n <= 0); 884378#L26 call #t~ret0 := fact(~n - 1);< 884380#factENTRY ~n := #in~n; 884739#L25 assume !(~n <= 0); 884472#L26 call #t~ret0 := fact(~n - 1);< 884481#factENTRY ~n := #in~n; 886880#L25 assume !(~n <= 0); 884540#L26 call #t~ret0 := fact(~n - 1);< 884548#factENTRY ~n := #in~n; 887855#L25 assume !(~n <= 0); 882170#L26 call #t~ret0 := fact(~n - 1);< 882169#factENTRY ~n := #in~n; 882172#L25 assume !(~n <= 0); 882214#L26 call #t~ret0 := fact(~n - 1);< 882456#factENTRY ~n := #in~n; 882462#L25 assume ~n <= 0;#res := 1; 882461#factFINAL assume true; 882455#factEXIT >#66#return; 882452#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 882446#factFINAL assume true; 882334#factEXIT >#66#return; 882356#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 884606#factFINAL assume true; 884539#factEXIT >#66#return; 884530#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 884522#factFINAL assume true; 884468#factEXIT >#66#return; 884448#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 884415#factFINAL assume true; 884373#factEXIT >#66#return; 884365#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 884279#factFINAL assume true; 884256#factEXIT >#68#return; 884273#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 884761#factENTRY ~n := #in~n; 884767#L25 assume !(~n <= 0); 884356#L26 call #t~ret0 := fact(~n - 1);< 884372#factENTRY ~n := #in~n; 884393#L25 assume ~n <= 0;#res := 1; 884368#factFINAL assume true; 884354#factEXIT >#66#return; 884357#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 884764#factFINAL assume true; 884760#factEXIT >#70#return; 884527#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 884821#factENTRY ~n := #in~n; 885681#L25 assume !(~n <= 0); 884473#L26 call #t~ret0 := fact(~n - 1);< 884481#factENTRY ~n := #in~n; 886880#L25 assume !(~n <= 0); 884540#L26 call #t~ret0 := fact(~n - 1);< 884548#factENTRY ~n := #in~n; 887855#L25 assume !(~n <= 0); 882170#L26 call #t~ret0 := fact(~n - 1);< 882169#factENTRY ~n := #in~n; 882172#L25 assume !(~n <= 0); 882214#L26 call #t~ret0 := fact(~n - 1);< 882456#factENTRY ~n := #in~n; 882462#L25 assume ~n <= 0;#res := 1; 882461#factFINAL assume true; 882455#factEXIT >#66#return; 882452#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 882446#factFINAL assume true; 882334#factEXIT >#66#return; 882356#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 884606#factFINAL assume true; 884539#factEXIT >#66#return; 884530#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 884522#factFINAL assume true; 884468#factEXIT >#66#return; 884476#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 884820#factFINAL assume true; 884790#factEXIT >#72#return; 884806#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; 885859#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 885858#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 885857#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 885856#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; 884272#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 884275#factENTRY ~n := #in~n; 884381#L25 assume !(~n <= 0); 884378#L26 call #t~ret0 := fact(~n - 1);< 884380#factENTRY ~n := #in~n; 884739#L25 assume !(~n <= 0); 884472#L26 call #t~ret0 := fact(~n - 1);< 884481#factENTRY ~n := #in~n; 886880#L25 assume !(~n <= 0); 884540#L26 call #t~ret0 := fact(~n - 1);< 884548#factENTRY ~n := #in~n; 887855#L25 assume !(~n <= 0); 882170#L26 call #t~ret0 := fact(~n - 1);< 882169#factENTRY ~n := #in~n; 882172#L25 assume !(~n <= 0); 882214#L26 call #t~ret0 := fact(~n - 1);< 882456#factENTRY ~n := #in~n; 882462#L25 assume ~n <= 0;#res := 1; 882461#factFINAL assume true; 882455#factEXIT >#66#return; 882452#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 882446#factFINAL assume true; 882334#factEXIT >#66#return; 882356#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 884606#factFINAL assume true; 884539#factEXIT >#66#return; 884530#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 884522#factFINAL assume true; 884468#factEXIT >#66#return; 884448#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 884415#factFINAL assume true; 884373#factEXIT >#66#return; 884365#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 884279#factFINAL assume true; 884256#factEXIT >#68#return; 882268#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 882364#factENTRY ~n := #in~n; 882365#L25 assume !(~n <= 0); 882345#L26 call #t~ret0 := fact(~n - 1);< 884418#factENTRY ~n := #in~n; 884483#L25 assume !(~n <= 0); 882354#L26 call #t~ret0 := fact(~n - 1);< 884586#factENTRY ~n := #in~n; 882462#L25 assume ~n <= 0;#res := 1; 882461#factFINAL assume true; 882455#factEXIT >#66#return; 882452#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 882446#factFINAL assume true; 882334#factEXIT >#66#return; 882358#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 885509#factFINAL assume true; 884754#factEXIT >#70#return; 884617#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 884741#factENTRY ~n := #in~n; 885440#L25 assume !(~n <= 0); 884471#L26 call #t~ret0 := fact(~n - 1);< 884549#factENTRY ~n := #in~n; 886847#L25 assume !(~n <= 0); 882337#L26 call #t~ret0 := fact(~n - 1);< 882362#factENTRY ~n := #in~n; 886848#L25 assume !(~n <= 0); 882213#L26 call #t~ret0 := fact(~n - 1);< 882457#factENTRY ~n := #in~n; 882462#L25 assume ~n <= 0;#res := 1; 882461#factFINAL assume true; 882455#factEXIT >#66#return; 882452#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 882446#factFINAL assume true; 882334#factEXIT >#66#return; 882356#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 884606#factFINAL assume true; 884539#factEXIT >#66#return; 884545#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 884740#factFINAL assume true; 884727#factEXIT >#72#return; 884733#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; 885846#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 885844#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 885842#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 885840#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; 884270#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 884275#factENTRY ~n := #in~n; 884381#L25 assume !(~n <= 0); 884378#L26 call #t~ret0 := fact(~n - 1);< 884380#factENTRY ~n := #in~n; 884739#L25 assume !(~n <= 0); 884472#L26 call #t~ret0 := fact(~n - 1);< 884481#factENTRY ~n := #in~n; 886880#L25 assume !(~n <= 0); 884540#L26 call #t~ret0 := fact(~n - 1);< 884548#factENTRY ~n := #in~n; 887855#L25 assume !(~n <= 0); 882170#L26 call #t~ret0 := fact(~n - 1);< 882169#factENTRY ~n := #in~n; 882172#L25 assume !(~n <= 0); 882214#L26 call #t~ret0 := fact(~n - 1);< 882456#factENTRY ~n := #in~n; 882462#L25 assume ~n <= 0;#res := 1; 882461#factFINAL assume true; 882455#factEXIT >#66#return; 882452#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 882446#factFINAL assume true; 882334#factEXIT >#66#return; 882356#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 884606#factFINAL assume true; 884539#factEXIT >#66#return; 884530#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 884522#factFINAL assume true; 884468#factEXIT >#66#return; 884448#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 884415#factFINAL assume true; 884373#factEXIT >#66#return; 884365#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 884279#factFINAL assume true; 884256#factEXIT >#68#return; 882297#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 882364#factENTRY ~n := #in~n; 882365#L25 assume !(~n <= 0); 882345#L26 call #t~ret0 := fact(~n - 1);< 884418#factENTRY ~n := #in~n; 884483#L25 assume !(~n <= 0); 882354#L26 call #t~ret0 := fact(~n - 1);< 884586#factENTRY ~n := #in~n; 884483#L25 assume !(~n <= 0); 882354#L26 call #t~ret0 := fact(~n - 1);< 884586#factENTRY ~n := #in~n; 884483#L25 assume !(~n <= 0); 882354#L26 call #t~ret0 := fact(~n - 1);< 884586#factENTRY ~n := #in~n; 884483#L25 assume !(~n <= 0); 882354#L26 call #t~ret0 := fact(~n - 1);< 884586#factENTRY ~n := #in~n; 882462#L25 assume ~n <= 0;#res := 1; 882461#factFINAL assume true; 882455#factEXIT >#66#return; 882452#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 882446#factFINAL assume true; 882334#factEXIT >#66#return; 882356#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 884606#factFINAL assume true; 884539#factEXIT >#66#return; 884530#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 884522#factFINAL assume true; 884468#factEXIT >#66#return; 884448#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 884415#factFINAL assume true; 884373#factEXIT >#66#return; 882403#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 882242#factFINAL assume true; 882321#factEXIT >#70#return; 884232#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 886811#factENTRY ~n := #in~n; 886808#L25 assume !(~n <= 0); 882339#L26 call #t~ret0 := fact(~n - 1);< 884360#factENTRY ~n := #in~n; 886846#L25 assume !(~n <= 0); 882335#L26 call #t~ret0 := fact(~n - 1);< 884547#factENTRY ~n := #in~n; 882462#L25 assume ~n <= 0;#res := 1; 882461#factFINAL assume true; 882455#factEXIT >#66#return; 882452#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 882446#factFINAL assume true; 882334#factEXIT >#66#return; 882360#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 884716#factFINAL assume true; 884684#factEXIT >#72#return; 884703#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; 885838#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 885836#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 885834#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 885833#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; 884259#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 884275#factENTRY ~n := #in~n; 884381#L25 assume !(~n <= 0); 884378#L26 call #t~ret0 := fact(~n - 1);< 884380#factENTRY ~n := #in~n; 884739#L25 assume !(~n <= 0); 884472#L26 call #t~ret0 := fact(~n - 1);< 884481#factENTRY ~n := #in~n; 886880#L25 assume !(~n <= 0); 884540#L26 call #t~ret0 := fact(~n - 1);< 884548#factENTRY ~n := #in~n; 887855#L25 assume !(~n <= 0); 882170#L26 call #t~ret0 := fact(~n - 1);< 882169#factENTRY ~n := #in~n; 882172#L25 assume !(~n <= 0); 882214#L26 call #t~ret0 := fact(~n - 1);< 882456#factENTRY ~n := #in~n; 882462#L25 assume ~n <= 0;#res := 1; 882461#factFINAL assume true; 882455#factEXIT >#66#return; 882452#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 882446#factFINAL assume true; 882334#factEXIT >#66#return; 882356#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 884606#factFINAL assume true; 884539#factEXIT >#66#return; 884530#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 884522#factFINAL assume true; 884468#factEXIT >#66#return; 884448#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 884415#factFINAL assume true; 884373#factEXIT >#66#return; 884365#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 884279#factFINAL assume true; 884256#factEXIT >#68#return; 882265#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 882364#factENTRY ~n := #in~n; 882365#L25 assume !(~n <= 0); 882345#L26 call #t~ret0 := fact(~n - 1);< 884418#factENTRY ~n := #in~n; 884483#L25 assume !(~n <= 0); 882354#L26 call #t~ret0 := fact(~n - 1);< 884586#factENTRY ~n := #in~n; 884483#L25 assume !(~n <= 0); 882354#L26 call #t~ret0 := fact(~n - 1);< 884586#factENTRY ~n := #in~n; 884483#L25 assume !(~n <= 0); 882354#L26 call #t~ret0 := fact(~n - 1);< 884586#factENTRY ~n := #in~n; 884483#L25 assume !(~n <= 0); 882354#L26 call #t~ret0 := fact(~n - 1);< 884586#factENTRY ~n := #in~n; 882462#L25 assume ~n <= 0;#res := 1; 882461#factFINAL assume true; 882455#factEXIT >#66#return; 882452#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 882446#factFINAL assume true; 882334#factEXIT >#66#return; 882356#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 884606#factFINAL assume true; 884539#factEXIT >#66#return; 884530#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 884522#factFINAL assume true; 884468#factEXIT >#66#return; 884448#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 884415#factFINAL assume true; 884373#factEXIT >#66#return; 882403#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 882242#factFINAL assume true; 882321#factEXIT >#70#return; 884217#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 886811#factENTRY ~n := #in~n; 886808#L25 assume !(~n <= 0); 882339#L26 call #t~ret0 := fact(~n - 1);< 884360#factENTRY ~n := #in~n; 884393#L25 assume ~n <= 0;#res := 1; 884368#factFINAL assume true; 884354#factEXIT >#66#return; 884352#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 884349#factFINAL assume true; 884290#factEXIT >#72#return; 884288#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; 884286#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 884285#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 884283#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 884281#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; 884269#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 884275#factENTRY ~n := #in~n; 884381#L25 assume !(~n <= 0); 884378#L26 call #t~ret0 := fact(~n - 1);< 884380#factENTRY ~n := #in~n; 884739#L25 assume !(~n <= 0); 884472#L26 call #t~ret0 := fact(~n - 1);< 884481#factENTRY ~n := #in~n; 886880#L25 assume !(~n <= 0); 884540#L26 call #t~ret0 := fact(~n - 1);< 884548#factENTRY ~n := #in~n; 887855#L25 assume !(~n <= 0); 882170#L26 call #t~ret0 := fact(~n - 1);< 882169#factENTRY ~n := #in~n; 882172#L25 assume !(~n <= 0); 882214#L26 call #t~ret0 := fact(~n - 1);< 882456#factENTRY ~n := #in~n; 882462#L25 assume ~n <= 0;#res := 1; 882461#factFINAL assume true; 882455#factEXIT >#66#return; 882452#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 882446#factFINAL assume true; 882334#factEXIT >#66#return; 882356#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 884606#factFINAL assume true; 884539#factEXIT >#66#return; 884530#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 884522#factFINAL assume true; 884468#factEXIT >#66#return; 884448#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 884415#factFINAL assume true; 884373#factEXIT >#66#return; 884365#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 884279#factFINAL assume true; 884256#factEXIT >#68#return; 882288#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 882364#factENTRY ~n := #in~n; 882365#L25 assume !(~n <= 0); 882345#L26 call #t~ret0 := fact(~n - 1);< 884418#factENTRY ~n := #in~n; 884483#L25 assume !(~n <= 0); 882354#L26 call #t~ret0 := fact(~n - 1);< 884586#factENTRY ~n := #in~n; 884483#L25 assume !(~n <= 0); 882354#L26 call #t~ret0 := fact(~n - 1);< 884586#factENTRY ~n := #in~n; 884483#L25 assume !(~n <= 0); 882354#L26 call #t~ret0 := fact(~n - 1);< 884586#factENTRY ~n := #in~n; 884483#L25 assume !(~n <= 0); 882354#L26 call #t~ret0 := fact(~n - 1);< 884586#factENTRY ~n := #in~n; 882462#L25 assume ~n <= 0;#res := 1; 882461#factFINAL assume true; 882455#factEXIT >#66#return; 882452#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 882446#factFINAL assume true; 882334#factEXIT >#66#return; 882356#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 884606#factFINAL assume true; 884539#factEXIT >#66#return; 884530#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 884522#factFINAL assume true; 884468#factEXIT >#66#return; 884448#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 884415#factFINAL assume true; 884373#factEXIT >#66#return; 882403#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 882242#factFINAL assume true; 882321#factEXIT >#70#return; 884245#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 884253#factENTRY ~n := #in~n; 884364#L25 assume ~n <= 0;#res := 1; 884362#factFINAL assume true; 884200#factEXIT >#72#return; 884251#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; 884361#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 884353#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 884351#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 884188#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; 884181#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 884186#factENTRY ~n := #in~n; 884183#L25 assume !(~n <= 0); 882131#L26 call #t~ret0 := fact(~n - 1);< 884179#factENTRY ~n := #in~n; 884177#L25 assume !(~n <= 0); 882132#L26 call #t~ret0 := fact(~n - 1);< 884176#factENTRY ~n := #in~n; 884174#L25 assume !(~n <= 0); 882129#L26 call #t~ret0 := fact(~n - 1);< 884168#factENTRY ~n := #in~n; 884166#L25 assume !(~n <= 0); 882126#L26 call #t~ret0 := fact(~n - 1);< 884101#factENTRY ~n := #in~n; 884150#L25 assume !(~n <= 0); 882127#L26 call #t~ret0 := fact(~n - 1);< 884144#factENTRY ~n := #in~n; 884150#L25 assume !(~n <= 0); 882127#L26 call #t~ret0 := fact(~n - 1);< 884144#factENTRY ~n := #in~n; 884150#L25 assume !(~n <= 0); 882127#L26 call #t~ret0 := fact(~n - 1);< 884144#factENTRY ~n := #in~n; 884149#L25 assume ~n <= 0;#res := 1; 884146#factFINAL assume true; 884143#factEXIT >#66#return; 884138#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 884132#factFINAL assume true; 884106#factEXIT >#66#return; 884104#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 884100#factFINAL assume true; 884089#factEXIT >#66#return; 884090#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 885086#factFINAL assume true; 885084#factEXIT >#66#return; 885085#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 885978#factFINAL assume true; 882122#factEXIT >#66#return; 882134#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 885980#factFINAL assume true; 885234#factEXIT >#66#return; 885231#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 885233#factFINAL assume true; 885230#factEXIT >#66#return; 885226#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 885222#factFINAL assume true; 885221#factEXIT >#74#return; 884044#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 885205#factENTRY ~n := #in~n; 885572#L25 assume !(~n <= 0); 884014#L26 call #t~ret0 := fact(~n - 1);< 884039#factENTRY ~n := #in~n; 884033#L25 assume !(~n <= 0); 883998#L26 call #t~ret0 := fact(~n - 1);< 884017#factENTRY ~n := #in~n; 884026#L25 assume !(~n <= 0); 883989#L26 call #t~ret0 := fact(~n - 1);< 884023#factENTRY ~n := #in~n; 884026#L25 assume !(~n <= 0); 883989#L26 call #t~ret0 := fact(~n - 1);< 884023#factENTRY ~n := #in~n; 884028#L25 assume ~n <= 0;#res := 1; 884025#factFINAL assume true; 884020#factEXIT >#66#return; 884019#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 884006#factFINAL assume true; 883980#factEXIT >#66#return; 883999#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 884976#factFINAL assume true; 884971#factEXIT >#66#return; 884968#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 884967#factFINAL assume true; 884961#factEXIT >#66#return; 884964#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 885893#factFINAL assume true; 885821#factEXIT >#76#return; 882182#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 882225#factENTRY ~n := #in~n; 885369#L25 assume !(~n <= 0); 882179#L26 call #t~ret0 := fact(~n - 1);< 882183#factENTRY ~n := #in~n; 885263#L25 assume ~n <= 0;#res := 1; 885258#factFINAL assume true; 885245#factEXIT >#66#return; 885247#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 885248#factFINAL assume true; 885076#factEXIT >#78#return; 884854#L30-8 [2022-11-20 09:43:42,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:43:42,997 INFO L85 PathProgramCache]: Analyzing trace with hash 478774201, now seen corresponding path program 49 times [2022-11-20 09:43:42,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:43:42,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766510544] [2022-11-20 09:43:42,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:43:42,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:43:43,100 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:43:43,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1431285818] [2022-11-20 09:43:43,100 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 09:43:43,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:43:43,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:43:43,103 INFO L229 MonitoredProcess]: Starting monitored process 361 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:43:43,104 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (361)] Waiting until timeout for monitored process [2022-11-20 09:43:44,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:43:44,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 1819 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-20 09:43:44,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:43:44,506 INFO L134 CoverageAnalysis]: Checked inductivity of 39137 backedges. 7095 proven. 298 refuted. 0 times theorem prover too weak. 31744 trivial. 0 not checked. [2022-11-20 09:43:44,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:43:45,436 INFO L134 CoverageAnalysis]: Checked inductivity of 39137 backedges. 89 proven. 512 refuted. 0 times theorem prover too weak. 38536 trivial. 0 not checked. [2022-11-20 09:43:45,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:43:45,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766510544] [2022-11-20 09:43:45,437 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 09:43:45,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431285818] [2022-11-20 09:43:45,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431285818] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:43:45,437 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:43:45,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2022-11-20 09:43:45,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450270086] [2022-11-20 09:43:45,438 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:43:45,438 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-20 09:43:45,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:43:45,439 INFO L85 PathProgramCache]: Analyzing trace with hash 241472043, now seen corresponding path program 44 times [2022-11-20 09:43:45,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:43:45,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483710548] [2022-11-20 09:43:45,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:43:45,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:43:45,458 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:43:45,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [627283229] [2022-11-20 09:43:45,458 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 09:43:45,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:43:45,458 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:43:45,462 INFO L229 MonitoredProcess]: Starting monitored process 362 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:43:45,462 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (362)] Waiting until timeout for monitored process [2022-11-20 09:43:46,283 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 09:43:46,283 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:43:46,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 1265 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-20 09:43:46,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:43:46,460 INFO L134 CoverageAnalysis]: Checked inductivity of 23935 backedges. 12927 proven. 51 refuted. 0 times theorem prover too weak. 10957 trivial. 0 not checked. [2022-11-20 09:43:46,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:43:47,751 INFO L134 CoverageAnalysis]: Checked inductivity of 23935 backedges. 947 proven. 880 refuted. 0 times theorem prover too weak. 22108 trivial. 0 not checked. [2022-11-20 09:43:47,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:43:47,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483710548] [2022-11-20 09:43:47,752 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 09:43:47,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627283229] [2022-11-20 09:43:47,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627283229] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:43:47,752 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:43:47,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 16 [2022-11-20 09:43:47,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003568034] [2022-11-20 09:43:47,753 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:43:47,753 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 09:43:47,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:43:47,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-20 09:43:47,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-11-20 09:43:47,754 INFO L87 Difference]: Start difference. First operand 5748 states and 9224 transitions. cyclomatic complexity: 3537 Second operand has 16 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 16 states have internal predecessors, (58), 11 states have call successors, (30), 2 states have call predecessors, (30), 6 states have return successors, (32), 10 states have call predecessors, (32), 11 states have call successors, (32) [2022-11-20 09:43:48,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:43:48,584 INFO L93 Difference]: Finished difference Result 6124 states and 9728 transitions. [2022-11-20 09:43:48,584 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6124 states and 9728 transitions. [2022-11-20 09:43:48,618 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 820 [2022-11-20 09:43:48,666 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6124 states to 6124 states and 9728 transitions. [2022-11-20 09:43:48,666 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 514 [2022-11-20 09:43:48,667 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 514 [2022-11-20 09:43:48,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6124 states and 9728 transitions. [2022-11-20 09:43:48,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 09:43:48,667 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6124 states and 9728 transitions. [2022-11-20 09:43:48,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6124 states and 9728 transitions. [2022-11-20 09:43:48,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6124 to 5748. [2022-11-20 09:43:48,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5748 states, 3568 states have (on average 1.0420403587443947) internal successors, (3718), 3543 states have internal predecessors, (3718), 1563 states have call successors, (1609), 714 states have call predecessors, (1609), 617 states have return successors, (3843), 1490 states have call predecessors, (3843), 1563 states have call successors, (3843) [2022-11-20 09:43:48,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5748 states to 5748 states and 9170 transitions. [2022-11-20 09:43:48,760 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5748 states and 9170 transitions. [2022-11-20 09:43:48,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 09:43:48,761 INFO L428 stractBuchiCegarLoop]: Abstraction has 5748 states and 9170 transitions. [2022-11-20 09:43:48,761 INFO L335 stractBuchiCegarLoop]: ======== Iteration 72 ============ [2022-11-20 09:43:48,761 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5748 states and 9170 transitions. [2022-11-20 09:43:48,777 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 680 [2022-11-20 09:43:48,777 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 09:43:48,778 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 09:43:48,781 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [128, 128, 77, 77, 77, 77, 51, 17, 16, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 7, 7, 7, 7, 7, 6, 6, 4, 3, 3, 1, 1, 1, 1] [2022-11-20 09:43:48,782 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [93, 93, 72, 72, 72, 72, 21, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:43:48,782 INFO L748 eck$LassoCheckResult]: Stem: 902533#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 902505#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; 902506#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 902532#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; 902519#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 902520#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 907164#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; 902490#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 902491#factENTRY ~n := #in~n; 906970#L25 assume ~n <= 0;#res := 1; 906969#factFINAL assume true; 906968#factEXIT >#68#return; 902552#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 902553#factENTRY ~n := #in~n; 907173#L25 assume ~n <= 0;#res := 1; 907171#factFINAL assume true; 907167#factEXIT >#70#return; 902481#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 902482#factENTRY ~n := #in~n; 907232#L25 assume ~n <= 0;#res := 1; 907231#factFINAL assume true; 907230#factEXIT >#72#return; 902525#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; 902526#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 902528#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 902551#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 902536#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; 902537#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 907831#factENTRY ~n := #in~n; 907840#L25 assume !(~n <= 0); 907836#L26 call #t~ret0 := fact(~n - 1);< 907837#factENTRY ~n := #in~n; 907841#L25 assume ~n <= 0;#res := 1; 907839#factFINAL assume true; 907835#factEXIT >#66#return; 907833#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 907832#factFINAL assume true; 907830#factEXIT >#74#return; 907800#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 907801#factENTRY ~n := #in~n; 907822#L25 assume ~n <= 0;#res := 1; 907820#factFINAL assume true; 907799#factEXIT >#76#return; 907793#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 907797#factENTRY ~n := #in~n; 907827#L25 assume !(~n <= 0); 907824#L26 call #t~ret0 := fact(~n - 1);< 907825#factENTRY ~n := #in~n; 907829#L25 assume ~n <= 0;#res := 1; 907828#factFINAL assume true; 907823#factEXIT >#66#return; 907821#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 907819#factFINAL assume true; 907792#factEXIT >#78#return; 907791#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; 907789#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 907788#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 907783#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 907781#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; 902479#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 907608#factENTRY ~n := #in~n; 907621#L25 assume !(~n <= 0); 907614#L26 call #t~ret0 := fact(~n - 1);< 907620#factENTRY ~n := #in~n; 907629#L25 assume !(~n <= 0); 907617#L26 call #t~ret0 := fact(~n - 1);< 907628#factENTRY ~n := #in~n; 907635#L25 assume ~n <= 0;#res := 1; 907632#factFINAL assume true; 907627#factEXIT >#66#return; 907626#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 907622#factFINAL assume true; 907613#factEXIT >#66#return; 907612#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 907609#factFINAL assume true; 907605#factEXIT >#74#return; 907606#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 907599#factENTRY ~n := #in~n; 907939#L25 assume ~n <= 0;#res := 1; 907938#factFINAL assume true; 907936#factEXIT >#76#return; 907931#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 907934#factENTRY ~n := #in~n; 907940#L25 assume !(~n <= 0); 907865#L26 call #t~ret0 := fact(~n - 1);< 907876#factENTRY ~n := #in~n; 907955#L25 assume !(~n <= 0); 907871#L26 call #t~ret0 := fact(~n - 1);< 907918#factENTRY ~n := #in~n; 908052#L25 assume ~n <= 0;#res := 1; 907919#factFINAL assume true; 907920#factEXIT >#66#return; 907941#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 907910#factFINAL assume true; 907911#factEXIT >#66#return; 907937#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 907935#factFINAL assume true; 907929#factEXIT >#78#return; 907928#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; 907927#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 907926#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 907924#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 907922#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; 907256#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 907257#factENTRY ~n := #in~n; 907421#L25 assume !(~n <= 0); 907409#L26 call #t~ret0 := fact(~n - 1);< 907428#factENTRY ~n := #in~n; 907429#L25 assume !(~n <= 0); 907408#L26 call #t~ret0 := fact(~n - 1);< 907424#factENTRY ~n := #in~n; 907429#L25 assume !(~n <= 0); 907408#L26 call #t~ret0 := fact(~n - 1);< 907424#factENTRY ~n := #in~n; 907443#L25 assume ~n <= 0;#res := 1; 907441#factFINAL assume true; 907442#factEXIT >#66#return; 907450#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 907436#factFINAL assume true; 907437#factEXIT >#66#return; 907419#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 907420#factFINAL assume true; 907407#factEXIT >#66#return; 907265#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 907266#factFINAL assume true; 907255#factEXIT >#74#return; 907248#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 907249#factENTRY ~n := #in~n; 907311#L25 assume ~n <= 0;#res := 1; 907308#factFINAL assume true; 907247#factEXIT >#76#return; 902539#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 907281#factENTRY ~n := #in~n; 907279#L25 assume !(~n <= 0); 907236#L26 call #t~ret0 := fact(~n - 1);< 907276#factENTRY ~n := #in~n; 907274#L25 assume !(~n <= 0); 907238#L26 call #t~ret0 := fact(~n - 1);< 907260#factENTRY ~n := #in~n; 907275#L25 assume !(~n <= 0); 907240#L26 call #t~ret0 := fact(~n - 1);< 907272#factENTRY ~n := #in~n; 907278#L25 assume ~n <= 0;#res := 1; 907273#factFINAL assume true; 907271#factEXIT >#66#return; 907270#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 907269#factFINAL assume true; 907267#factEXIT >#66#return; 907264#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 907258#factFINAL assume true; 907235#factEXIT >#66#return; 902538#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 902540#factFINAL assume true; 906942#factEXIT >#78#return; 906940#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; 906938#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 906937#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 906936#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 906935#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 906933#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 906929#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 905577#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; 905568#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 905570#factENTRY ~n := #in~n; 905588#L25 assume !(~n <= 0); 905583#L26 call #t~ret0 := fact(~n - 1);< 905584#factENTRY ~n := #in~n; 905590#L25 assume ~n <= 0;#res := 1; 905587#factFINAL assume true; 905582#factEXIT >#66#return; 905580#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 905576#factFINAL assume true; 905567#factEXIT >#68#return; 905562#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 905564#factENTRY ~n := #in~n; 905575#L25 assume ~n <= 0;#res := 1; 905566#factFINAL assume true; 905561#factEXIT >#70#return; 905556#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 905559#factENTRY ~n := #in~n; 905574#L25 assume !(~n <= 0); 905572#L26 call #t~ret0 := fact(~n - 1);< 905573#factENTRY ~n := #in~n; 905581#L25 assume ~n <= 0;#res := 1; 905578#factFINAL assume true; 905571#factEXIT >#66#return; 905565#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 905560#factFINAL assume true; 905555#factEXIT >#72#return; 905554#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; 905553#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 905552#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 905551#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 905550#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; 905547#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 905549#factENTRY ~n := #in~n; 905935#L25 assume !(~n <= 0); 905930#L26 call #t~ret0 := fact(~n - 1);< 905933#factENTRY ~n := #in~n; 905938#L25 assume ~n <= 0;#res := 1; 905936#factFINAL assume true; 905927#factEXIT >#66#return; 905925#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 905922#factFINAL assume true; 905546#factEXIT >#68#return; 905542#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 905545#factENTRY ~n := #in~n; 907161#L25 assume !(~n <= 0); 907159#L26 call #t~ret0 := fact(~n - 1);< 907160#factENTRY ~n := #in~n; 907163#L25 assume ~n <= 0;#res := 1; 907162#factFINAL assume true; 907158#factEXIT >#66#return; 906977#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 906972#factFINAL assume true; 905541#factEXIT >#70#return; 905536#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 905539#factENTRY ~n := #in~n; 906971#L25 assume ~n <= 0;#res := 1; 906966#factFINAL assume true; 905535#factEXIT >#72#return; 905533#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; 905531#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 905529#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 905526#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 905525#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; 905523#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 905524#factENTRY ~n := #in~n; 906973#L25 assume !(~n <= 0); 906847#L26 call #t~ret0 := fact(~n - 1);< 906850#factENTRY ~n := #in~n; 906857#L25 assume !(~n <= 0); 906848#L26 call #t~ret0 := fact(~n - 1);< 906856#factENTRY ~n := #in~n; 906879#L25 assume ~n <= 0;#res := 1; 906878#factFINAL assume true; 906855#factEXIT >#66#return; 906853#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 906851#factFINAL assume true; 906846#factEXIT >#66#return; 906849#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 906859#factFINAL assume true; 906858#factEXIT >#74#return; 905119#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 906881#factENTRY ~n := #in~n; 906880#L25 assume !(~n <= 0); 905941#L26 call #t~ret0 := fact(~n - 1);< 905945#factENTRY ~n := #in~n; 905948#L25 assume ~n <= 0;#res := 1; 905946#factFINAL assume true; 905939#factEXIT >#66#return; 905943#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 907229#factFINAL assume true; 905118#factEXIT >#76#return; 905114#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 905116#factENTRY ~n := #in~n; 905188#L25 assume !(~n <= 0); 905186#L26 call #t~ret0 := fact(~n - 1);< 905187#factENTRY ~n := #in~n; 905190#L25 assume ~n <= 0;#res := 1; 905189#factFINAL assume true; 905185#factEXIT >#66#return; 905184#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 905181#factFINAL assume true; 905112#factEXIT >#78#return; 905115#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; 905972#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 905971#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 905970#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 904452#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; 904444#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 904446#factENTRY ~n := #in~n; 904462#L25 assume !(~n <= 0); 904460#L26 call #t~ret0 := fact(~n - 1);< 904461#factENTRY ~n := #in~n; 904469#L25 assume !(~n <= 0); 904459#L26 call #t~ret0 := fact(~n - 1);< 904467#factENTRY ~n := #in~n; 904469#L25 assume !(~n <= 0); 904459#L26 call #t~ret0 := fact(~n - 1);< 904467#factENTRY ~n := #in~n; 904505#L25 assume ~n <= 0;#res := 1; 904503#factFINAL assume true; 904502#factEXIT >#66#return; 904500#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 904492#factFINAL assume true; 904466#factEXIT >#66#return; 904465#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 904463#factFINAL assume true; 904458#factEXIT >#66#return; 904456#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 904450#factFINAL assume true; 904441#factEXIT >#74#return; 904437#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 904440#factENTRY ~n := #in~n; 904475#L25 assume !(~n <= 0); 904472#L26 call #t~ret0 := fact(~n - 1);< 904474#factENTRY ~n := #in~n; 904490#L25 assume ~n <= 0;#res := 1; 904477#factFINAL assume true; 904470#factEXIT >#66#return; 904468#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 904464#factFINAL assume true; 904435#factEXIT >#76#return; 904431#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 904433#factENTRY ~n := #in~n; 905433#L25 assume !(~n <= 0); 904904#L26 call #t~ret0 := fact(~n - 1);< 905432#factENTRY ~n := #in~n; 905438#L25 assume !(~n <= 0); 905068#L26 call #t~ret0 := fact(~n - 1);< 905415#factENTRY ~n := #in~n; 905449#L25 assume ~n <= 0;#res := 1; 905453#factFINAL assume true; 905442#factEXIT >#66#return; 905439#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 905431#factFINAL assume true; 905409#factEXIT >#66#return; 905413#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 905989#factFINAL assume true; 904429#factEXIT >#78#return; 904428#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; 907103#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 907101#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 907100#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 902531#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 902521#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 902522#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 903943#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; 903306#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 903310#factENTRY ~n := #in~n; 903497#L25 assume !(~n <= 0); 903428#L26 call #t~ret0 := fact(~n - 1);< 903431#factENTRY ~n := #in~n; 903448#L25 assume !(~n <= 0); 903429#L26 call #t~ret0 := fact(~n - 1);< 903446#factENTRY ~n := #in~n; 903485#L25 assume ~n <= 0;#res := 1; 903484#factFINAL assume true; 903482#factEXIT >#66#return; 903481#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903445#factFINAL assume true; 903435#factEXIT >#66#return; 903434#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903433#factFINAL assume true; 903303#factEXIT >#68#return; 903309#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 903015#factENTRY ~n := #in~n; 906175#L25 assume ~n <= 0;#res := 1; 906174#factFINAL assume true; 906168#factEXIT >#70#return; 906164#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 906166#factENTRY ~n := #in~n; 906185#L25 assume !(~n <= 0); 906179#L26 call #t~ret0 := fact(~n - 1);< 906183#factENTRY ~n := #in~n; 906339#L25 assume !(~n <= 0); 906180#L26 call #t~ret0 := fact(~n - 1);< 906338#factENTRY ~n := #in~n; 906336#L25 assume ~n <= 0;#res := 1; 906335#factFINAL assume true; 906201#factEXIT >#66#return; 906199#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 906195#factFINAL assume true; 906178#factEXIT >#66#return; 906177#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 906176#factFINAL assume true; 906162#factEXIT >#72#return; 906165#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; 906172#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 906171#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 906167#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 906161#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; 906131#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 906136#factENTRY ~n := #in~n; 906152#L25 assume !(~n <= 0); 906145#L26 call #t~ret0 := fact(~n - 1);< 906146#factENTRY ~n := #in~n; 906360#L25 assume !(~n <= 0); 906345#L26 call #t~ret0 := fact(~n - 1);< 906346#factENTRY ~n := #in~n; 906540#L25 assume ~n <= 0;#res := 1; 906517#factFINAL assume true; 906344#factEXIT >#66#return; 906342#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 906340#factFINAL assume true; 906144#factEXIT >#66#return; 906142#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 906139#factFINAL assume true; 906129#factEXIT >#68#return; 906135#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 906154#factENTRY ~n := #in~n; 906191#L25 assume !(~n <= 0); 906187#L26 call #t~ret0 := fact(~n - 1);< 906190#factENTRY ~n := #in~n; 906194#L25 assume ~n <= 0;#res := 1; 906192#factFINAL assume true; 906186#factEXIT >#66#return; 906184#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 906157#factFINAL assume true; 906153#factEXIT >#70#return; 906149#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 906151#factENTRY ~n := #in~n; 906193#L25 assume !(~n <= 0); 906188#L26 call #t~ret0 := fact(~n - 1);< 906190#factENTRY ~n := #in~n; 906194#L25 assume ~n <= 0;#res := 1; 906192#factFINAL assume true; 906186#factEXIT >#66#return; 906189#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 906337#factFINAL assume true; 906147#factEXIT >#72#return; 906150#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; 906300#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 906299#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 906298#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 906266#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; 906132#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 906136#factENTRY ~n := #in~n; 906152#L25 assume !(~n <= 0); 906145#L26 call #t~ret0 := fact(~n - 1);< 906146#factENTRY ~n := #in~n; 906360#L25 assume !(~n <= 0); 906345#L26 call #t~ret0 := fact(~n - 1);< 906346#factENTRY ~n := #in~n; 906540#L25 assume ~n <= 0;#res := 1; 906517#factFINAL assume true; 906344#factEXIT >#66#return; 906342#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 906340#factFINAL assume true; 906144#factEXIT >#66#return; 906142#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 906139#factFINAL assume true; 906129#factEXIT >#68#return; 906127#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 906128#factENTRY ~n := #in~n; 906361#L25 assume !(~n <= 0); 906351#L26 call #t~ret0 := fact(~n - 1);< 906359#factENTRY ~n := #in~n; 906370#L25 assume !(~n <= 0); 906367#L26 call #t~ret0 := fact(~n - 1);< 906368#factENTRY ~n := #in~n; 906372#L25 assume ~n <= 0;#res := 1; 906371#factFINAL assume true; 906366#factEXIT >#66#return; 906365#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 906362#factFINAL assume true; 906347#factEXIT >#66#return; 906343#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 906341#factFINAL assume true; 906125#factEXIT >#70#return; 906121#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 906124#factENTRY ~n := #in~n; 906546#L25 assume ~n <= 0;#res := 1; 906544#factFINAL assume true; 906120#factEXIT >#72#return; 906123#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; 906327#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 906326#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 906325#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 906324#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; 906107#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 906320#factENTRY ~n := #in~n; 906318#L25 assume !(~n <= 0); 906311#L26 call #t~ret0 := fact(~n - 1);< 906315#factENTRY ~n := #in~n; 906323#L25 assume !(~n <= 0); 906312#L26 call #t~ret0 := fact(~n - 1);< 906322#factENTRY ~n := #in~n; 906323#L25 assume !(~n <= 0); 906312#L26 call #t~ret0 := fact(~n - 1);< 906322#factENTRY ~n := #in~n; 906332#L25 assume ~n <= 0;#res := 1; 906331#factFINAL assume true; 906330#factEXIT >#66#return; 906329#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 906328#factFINAL assume true; 906321#factEXIT >#66#return; 906319#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 906317#factFINAL assume true; 906310#factEXIT >#66#return; 906314#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 906450#factFINAL assume true; 906260#factEXIT >#74#return; 906255#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 906258#factENTRY ~n := #in~n; 906259#L25 assume !(~n <= 0); 906028#L26 call #t~ret0 := fact(~n - 1);< 906050#factENTRY ~n := #in~n; 906049#L25 assume !(~n <= 0); 906046#L26 call #t~ret0 := fact(~n - 1);< 906048#factENTRY ~n := #in~n; 906053#L25 assume ~n <= 0;#res := 1; 906051#factFINAL assume true; 906045#factEXIT >#66#return; 906044#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 906043#factFINAL assume true; 906020#factEXIT >#66#return; 906039#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 906892#factFINAL assume true; 906889#factEXIT >#76#return; 906004#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 906005#factENTRY ~n := #in~n; 906618#L25 assume !(~n <= 0); 906615#L26 call #t~ret0 := fact(~n - 1);< 906616#factENTRY ~n := #in~n; 906680#L25 assume ~n <= 0;#res := 1; 906679#factFINAL assume true; 906614#factEXIT >#66#return; 906609#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 906608#factFINAL assume true; 906606#factEXIT >#78#return; 905998#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; 905997#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 905995#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 905994#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 905993#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 905992#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 905991#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 903288#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; 903280#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 903282#factENTRY ~n := #in~n; 903495#L25 assume !(~n <= 0); 903430#L26 call #t~ret0 := fact(~n - 1);< 903431#factENTRY ~n := #in~n; 903448#L25 assume !(~n <= 0); 903429#L26 call #t~ret0 := fact(~n - 1);< 903446#factENTRY ~n := #in~n; 903448#L25 assume !(~n <= 0); 903429#L26 call #t~ret0 := fact(~n - 1);< 903446#factENTRY ~n := #in~n; 903485#L25 assume ~n <= 0;#res := 1; 903484#factFINAL assume true; 903482#factEXIT >#66#return; 903481#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903445#factFINAL assume true; 903435#factEXIT >#66#return; 903436#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903489#factFINAL assume true; 903427#factEXIT >#66#return; 903299#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903287#factFINAL assume true; 903279#factEXIT >#68#return; 903010#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 903016#factENTRY ~n := #in~n; 903314#L25 assume ~n <= 0;#res := 1; 903312#factFINAL assume true; 903008#factEXIT >#70#return; 903014#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 903272#factENTRY ~n := #in~n; 903292#L25 assume !(~n <= 0); 903259#L26 call #t~ret0 := fact(~n - 1);< 903286#factENTRY ~n := #in~n; 903380#L25 assume !(~n <= 0); 903254#L26 call #t~ret0 := fact(~n - 1);< 903261#factENTRY ~n := #in~n; 903548#L25 assume !(~n <= 0); 903267#L26 call #t~ret0 := fact(~n - 1);< 903269#factENTRY ~n := #in~n; 903276#L25 assume ~n <= 0;#res := 1; 903273#factFINAL assume true; 903266#factEXIT >#66#return; 903264#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903258#factFINAL assume true; 903249#factEXIT >#66#return; 903255#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903289#factFINAL assume true; 903283#factEXIT >#66#return; 903278#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903275#factFINAL assume true; 903270#factEXIT >#72#return; 903265#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; 903263#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 903257#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 903248#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 903246#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; 902876#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 902893#factENTRY ~n := #in~n; 902891#L25 assume !(~n <= 0); 902866#L26 call #t~ret0 := fact(~n - 1);< 902873#factENTRY ~n := #in~n; 902870#L25 assume !(~n <= 0); 902704#L26 call #t~ret0 := fact(~n - 1);< 902737#factENTRY ~n := #in~n; 902738#L25 assume !(~n <= 0); 902728#L26 call #t~ret0 := fact(~n - 1);< 902732#factENTRY ~n := #in~n; 902735#L25 assume ~n <= 0;#res := 1; 902734#factFINAL assume true; 902727#factEXIT >#66#return; 902724#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 902700#factFINAL assume true; 902719#factEXIT >#66#return; 903102#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903091#factFINAL assume true; 903083#factEXIT >#66#return; 903081#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903080#factFINAL assume true; 902963#factEXIT >#68#return; 902964#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 902982#factENTRY ~n := #in~n; 902998#L25 assume !(~n <= 0); 902707#L26 call #t~ret0 := fact(~n - 1);< 902996#factENTRY ~n := #in~n; 902770#L25 assume ~n <= 0;#res := 1; 903146#factFINAL assume true; 902990#factEXIT >#66#return; 902988#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 902984#factFINAL assume true; 902981#factEXIT >#70#return; 902861#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 902871#factENTRY ~n := #in~n; 902868#L25 assume !(~n <= 0); 902713#L26 call #t~ret0 := fact(~n - 1);< 902863#factENTRY ~n := #in~n; 902738#L25 assume !(~n <= 0); 902728#L26 call #t~ret0 := fact(~n - 1);< 902732#factENTRY ~n := #in~n; 902735#L25 assume ~n <= 0;#res := 1; 902734#factFINAL assume true; 902727#factEXIT >#66#return; 902724#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 902700#factFINAL assume true; 902719#factEXIT >#66#return; 903107#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903122#factFINAL assume true; 902979#factEXIT >#72#return; 902980#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; 903544#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 903517#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 903516#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 903515#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; 902880#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 902893#factENTRY ~n := #in~n; 902891#L25 assume !(~n <= 0); 902866#L26 call #t~ret0 := fact(~n - 1);< 902873#factENTRY ~n := #in~n; 902870#L25 assume !(~n <= 0); 902704#L26 call #t~ret0 := fact(~n - 1);< 902737#factENTRY ~n := #in~n; 902738#L25 assume !(~n <= 0); 902728#L26 call #t~ret0 := fact(~n - 1);< 902732#factENTRY ~n := #in~n; 902735#L25 assume ~n <= 0;#res := 1; 902734#factFINAL assume true; 902727#factEXIT >#66#return; 902724#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 902700#factFINAL assume true; 902719#factEXIT >#66#return; 903102#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903091#factFINAL assume true; 903083#factEXIT >#66#return; 903081#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903080#factFINAL assume true; 902963#factEXIT >#68#return; 902621#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 902658#factENTRY ~n := #in~n; 902657#L25 assume !(~n <= 0); 902655#L26 call #t~ret0 := fact(~n - 1);< 902656#factENTRY ~n := #in~n; 902743#L25 assume !(~n <= 0); 902718#L26 call #t~ret0 := fact(~n - 1);< 902739#factENTRY ~n := #in~n; 902735#L25 assume ~n <= 0;#res := 1; 902734#factFINAL assume true; 902727#factEXIT >#66#return; 902724#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 902700#factFINAL assume true; 902719#factEXIT >#66#return; 903101#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 902966#factFINAL assume true; 902962#factEXIT >#70#return; 902918#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 902920#factENTRY ~n := #in~n; 903082#L25 assume !(~n <= 0); 902992#L26 call #t~ret0 := fact(~n - 1);< 903079#factENTRY ~n := #in~n; 902770#L25 assume ~n <= 0;#res := 1; 903146#factFINAL assume true; 902990#factEXIT >#66#return; 902995#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 902961#factFINAL assume true; 902917#factEXIT >#72#return; 902915#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; 902913#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 902911#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 902909#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 902899#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; 902877#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 902893#factENTRY ~n := #in~n; 902891#L25 assume !(~n <= 0); 902866#L26 call #t~ret0 := fact(~n - 1);< 902873#factENTRY ~n := #in~n; 902870#L25 assume !(~n <= 0); 902704#L26 call #t~ret0 := fact(~n - 1);< 902737#factENTRY ~n := #in~n; 902738#L25 assume !(~n <= 0); 902728#L26 call #t~ret0 := fact(~n - 1);< 902732#factENTRY ~n := #in~n; 902735#L25 assume ~n <= 0;#res := 1; 902734#factFINAL assume true; 902727#factEXIT >#66#return; 902724#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 902700#factFINAL assume true; 902719#factEXIT >#66#return; 903102#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903091#factFINAL assume true; 903083#factEXIT >#66#return; 903081#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903080#factFINAL assume true; 902963#factEXIT >#68#return; 902620#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 902658#factENTRY ~n := #in~n; 902657#L25 assume !(~n <= 0); 902655#L26 call #t~ret0 := fact(~n - 1);< 902656#factENTRY ~n := #in~n; 902743#L25 assume !(~n <= 0); 902718#L26 call #t~ret0 := fact(~n - 1);< 902739#factENTRY ~n := #in~n; 902738#L25 assume !(~n <= 0); 902728#L26 call #t~ret0 := fact(~n - 1);< 902732#factENTRY ~n := #in~n; 902735#L25 assume ~n <= 0;#res := 1; 902734#factFINAL assume true; 902727#factEXIT >#66#return; 902724#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 902700#factFINAL assume true; 902719#factEXIT >#66#return; 903102#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903091#factFINAL assume true; 903083#factEXIT >#66#return; 902629#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 902627#factFINAL assume true; 902619#factEXIT >#70#return; 902612#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 902613#factENTRY ~n := #in~n; 902618#L25 assume ~n <= 0;#res := 1; 902614#factFINAL assume true; 902616#factEXIT >#72#return; 903144#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; 903890#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 903888#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 903886#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 903874#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; 902473#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 903871#factENTRY ~n := #in~n; 903866#L25 assume !(~n <= 0); 903823#L26 call #t~ret0 := fact(~n - 1);< 903862#factENTRY ~n := #in~n; 904132#L25 assume !(~n <= 0); 903821#L26 call #t~ret0 := fact(~n - 1);< 903870#factENTRY ~n := #in~n; 903921#L25 assume !(~n <= 0); 903822#L26 call #t~ret0 := fact(~n - 1);< 903911#factENTRY ~n := #in~n; 903921#L25 assume !(~n <= 0); 903822#L26 call #t~ret0 := fact(~n - 1);< 903911#factENTRY ~n := #in~n; 903920#L25 assume ~n <= 0;#res := 1; 903919#factFINAL assume true; 903910#factEXIT >#66#return; 903909#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903908#factFINAL assume true; 903904#factEXIT >#66#return; 903901#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903896#factFINAL assume true; 903868#factEXIT >#66#return; 903865#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903861#factFINAL assume true; 903856#factEXIT >#66#return; 903857#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 906965#factFINAL assume true; 902472#factEXIT >#74#return; 902474#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 904401#factENTRY ~n := #in~n; 904449#L25 assume !(~n <= 0); 904001#L26 call #t~ret0 := fact(~n - 1);< 904155#factENTRY ~n := #in~n; 904307#L25 assume !(~n <= 0); 903958#L26 call #t~ret0 := fact(~n - 1);< 904004#factENTRY ~n := #in~n; 904166#L25 assume !(~n <= 0); 903962#L26 call #t~ret0 := fact(~n - 1);< 904068#factENTRY ~n := #in~n; 904021#L25 assume !(~n <= 0); 904013#L26 call #t~ret0 := fact(~n - 1);< 904016#factENTRY ~n := #in~n; 904035#L25 assume ~n <= 0;#res := 1; 904019#factFINAL assume true; 904012#factEXIT >#66#return; 904009#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903998#factFINAL assume true; 903953#factEXIT >#66#return; 903971#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 904618#factFINAL assume true; 904195#factEXIT >#66#return; 904194#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 904156#factFINAL assume true; 904145#factEXIT >#66#return; 904150#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 904434#factFINAL assume true; 904423#factEXIT >#76#return; 903808#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 903815#factENTRY ~n := #in~n; 903809#L25 assume !(~n <= 0); 903799#L26 call #t~ret0 := fact(~n - 1);< 903801#factENTRY ~n := #in~n; 903814#L25 assume ~n <= 0;#res := 1; 903806#factFINAL assume true; 903797#factEXIT >#66#return; 903800#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 905996#factFINAL assume true; 904395#factEXIT >#78#return; 903775#L30-8 [2022-11-20 09:43:48,783 INFO L750 eck$LassoCheckResult]: Loop: 903775#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; 904391#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 904389#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 904388#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 904387#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 904386#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 904325#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 902534#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; 902535#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 902489#factENTRY ~n := #in~n; 903938#L25 assume !(~n <= 0); 903670#L26 call #t~ret0 := fact(~n - 1);< 903710#factENTRY ~n := #in~n; 903944#L25 assume !(~n <= 0); 903671#L26 call #t~ret0 := fact(~n - 1);< 903720#factENTRY ~n := #in~n; 903940#L25 assume !(~n <= 0); 903667#L26 call #t~ret0 := fact(~n - 1);< 903730#factENTRY ~n := #in~n; 907098#L25 assume !(~n <= 0); 903675#L26 call #t~ret0 := fact(~n - 1);< 903739#factENTRY ~n := #in~n; 903790#L25 assume !(~n <= 0); 903668#L26 call #t~ret0 := fact(~n - 1);< 903783#factENTRY ~n := #in~n; 903796#L25 assume ~n <= 0;#res := 1; 903789#factFINAL assume true; 903782#factEXIT >#66#return; 903768#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903766#factFINAL assume true; 903738#factEXIT >#66#return; 903735#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903732#factFINAL assume true; 903729#factEXIT >#66#return; 903724#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903721#factFINAL assume true; 903718#factEXIT >#66#return; 903717#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903716#factFINAL assume true; 903714#factEXIT >#66#return; 903715#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 904332#factFINAL assume true; 904331#factEXIT >#68#return; 903639#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 903646#factENTRY ~n := #in~n; 903660#L25 assume ~n <= 0;#res := 1; 903648#factFINAL assume true; 903631#factEXIT >#70#return; 903644#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 903708#factENTRY ~n := #in~n; 903703#L25 assume !(~n <= 0); 903693#L26 call #t~ret0 := fact(~n - 1);< 903696#factENTRY ~n := #in~n; 903712#L25 assume !(~n <= 0); 903291#L26 call #t~ret0 := fact(~n - 1);< 903461#factENTRY ~n := #in~n; 903459#L25 assume !(~n <= 0); 903260#L26 call #t~ret0 := fact(~n - 1);< 903286#factENTRY ~n := #in~n; 903380#L25 assume !(~n <= 0); 903254#L26 call #t~ret0 := fact(~n - 1);< 903261#factENTRY ~n := #in~n; 903548#L25 assume !(~n <= 0); 903267#L26 call #t~ret0 := fact(~n - 1);< 903269#factENTRY ~n := #in~n; 903276#L25 assume ~n <= 0;#res := 1; 903273#factFINAL assume true; 903266#factEXIT >#66#return; 903264#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903258#factFINAL assume true; 903249#factEXIT >#66#return; 903255#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903289#factFINAL assume true; 903283#factEXIT >#66#return; 903285#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903711#factFINAL assume true; 903706#factEXIT >#66#return; 903702#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903699#factFINAL assume true; 903692#factEXIT >#66#return; 903695#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 904887#factFINAL assume true; 904882#factEXIT >#72#return; 904883#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; 905661#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 905660#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 905659#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 905658#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; 902938#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 903006#factENTRY ~n := #in~n; 903005#L25 assume !(~n <= 0); 902904#L26 call #t~ret0 := fact(~n - 1);< 902935#factENTRY ~n := #in~n; 902933#L25 assume !(~n <= 0); 902874#L26 call #t~ret0 := fact(~n - 1);< 902897#factENTRY ~n := #in~n; 902890#L25 assume !(~n <= 0); 902867#L26 call #t~ret0 := fact(~n - 1);< 902873#factENTRY ~n := #in~n; 902870#L25 assume !(~n <= 0); 902704#L26 call #t~ret0 := fact(~n - 1);< 902737#factENTRY ~n := #in~n; 902738#L25 assume !(~n <= 0); 902728#L26 call #t~ret0 := fact(~n - 1);< 902732#factENTRY ~n := #in~n; 902735#L25 assume ~n <= 0;#res := 1; 902734#factFINAL assume true; 902727#factEXIT >#66#return; 902724#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 902700#factFINAL assume true; 902719#factEXIT >#66#return; 903102#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903091#factFINAL assume true; 903083#factEXIT >#66#return; 903087#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903377#factFINAL assume true; 903339#factEXIT >#66#return; 903340#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903325#factFINAL assume true; 903321#factEXIT >#66#return; 903319#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903318#factFINAL assume true; 903316#factEXIT >#68#return; 903155#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 903538#factENTRY ~n := #in~n; 903535#L25 assume !(~n <= 0); 902991#L26 call #t~ret0 := fact(~n - 1);< 903079#factENTRY ~n := #in~n; 902770#L25 assume ~n <= 0;#res := 1; 903146#factFINAL assume true; 902990#factEXIT >#66#return; 902993#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903554#factFINAL assume true; 903550#factEXIT >#70#return; 902903#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 902924#factENTRY ~n := #in~n; 902922#L25 assume !(~n <= 0); 902875#L26 call #t~ret0 := fact(~n - 1);< 902897#factENTRY ~n := #in~n; 902890#L25 assume !(~n <= 0); 902867#L26 call #t~ret0 := fact(~n - 1);< 902873#factENTRY ~n := #in~n; 902870#L25 assume !(~n <= 0); 902704#L26 call #t~ret0 := fact(~n - 1);< 902737#factENTRY ~n := #in~n; 902738#L25 assume !(~n <= 0); 902728#L26 call #t~ret0 := fact(~n - 1);< 902732#factENTRY ~n := #in~n; 902735#L25 assume ~n <= 0;#res := 1; 902734#factFINAL assume true; 902727#factEXIT >#66#return; 902724#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 902700#factFINAL assume true; 902719#factEXIT >#66#return; 903102#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903091#factFINAL assume true; 903083#factEXIT >#66#return; 903087#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903377#factFINAL assume true; 903339#factEXIT >#66#return; 903341#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 904365#factFINAL assume true; 904366#factEXIT >#72#return; 905636#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; 905635#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 905634#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 905633#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 905632#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; 902948#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 903006#factENTRY ~n := #in~n; 903005#L25 assume !(~n <= 0); 902904#L26 call #t~ret0 := fact(~n - 1);< 902935#factENTRY ~n := #in~n; 902933#L25 assume !(~n <= 0); 902874#L26 call #t~ret0 := fact(~n - 1);< 902897#factENTRY ~n := #in~n; 902890#L25 assume !(~n <= 0); 902867#L26 call #t~ret0 := fact(~n - 1);< 902873#factENTRY ~n := #in~n; 902870#L25 assume !(~n <= 0); 902704#L26 call #t~ret0 := fact(~n - 1);< 902737#factENTRY ~n := #in~n; 902738#L25 assume !(~n <= 0); 902728#L26 call #t~ret0 := fact(~n - 1);< 902732#factENTRY ~n := #in~n; 902735#L25 assume ~n <= 0;#res := 1; 902734#factFINAL assume true; 902727#factEXIT >#66#return; 902724#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 902700#factFINAL assume true; 902719#factEXIT >#66#return; 903102#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903091#factFINAL assume true; 903083#factEXIT >#66#return; 903087#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903377#factFINAL assume true; 903339#factEXIT >#66#return; 903340#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903325#factFINAL assume true; 903321#factEXIT >#66#return; 903319#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903318#factFINAL assume true; 903316#factEXIT >#68#return; 902830#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 903200#factENTRY ~n := #in~n; 903197#L25 assume !(~n <= 0); 902638#L26 call #t~ret0 := fact(~n - 1);< 902789#factENTRY ~n := #in~n; 902788#L25 assume !(~n <= 0); 902632#L26 call #t~ret0 := fact(~n - 1);< 902733#factENTRY ~n := #in~n; 902735#L25 assume ~n <= 0;#res := 1; 902734#factFINAL assume true; 902727#factEXIT >#66#return; 902724#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 902700#factFINAL assume true; 902719#factEXIT >#66#return; 903106#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903609#factFINAL assume true; 903588#factEXIT >#70#return; 903100#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 903605#factENTRY ~n := #in~n; 903685#L25 assume !(~n <= 0); 903085#L26 call #t~ret0 := fact(~n - 1);< 903094#factENTRY ~n := #in~n; 903509#L25 assume !(~n <= 0); 902706#L26 call #t~ret0 := fact(~n - 1);< 902656#factENTRY ~n := #in~n; 902743#L25 assume !(~n <= 0); 902718#L26 call #t~ret0 := fact(~n - 1);< 902739#factENTRY ~n := #in~n; 902735#L25 assume ~n <= 0;#res := 1; 902734#factFINAL assume true; 902727#factEXIT >#66#return; 902724#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 902700#factFINAL assume true; 902719#factEXIT >#66#return; 903102#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903091#factFINAL assume true; 903083#factEXIT >#66#return; 903089#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903604#factFINAL assume true; 903592#factEXIT >#72#return; 903593#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; 905630#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 905629#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 905627#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 905625#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; 902943#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 903006#factENTRY ~n := #in~n; 903005#L25 assume !(~n <= 0); 902904#L26 call #t~ret0 := fact(~n - 1);< 902935#factENTRY ~n := #in~n; 902933#L25 assume !(~n <= 0); 902874#L26 call #t~ret0 := fact(~n - 1);< 902897#factENTRY ~n := #in~n; 902890#L25 assume !(~n <= 0); 902867#L26 call #t~ret0 := fact(~n - 1);< 902873#factENTRY ~n := #in~n; 902870#L25 assume !(~n <= 0); 902704#L26 call #t~ret0 := fact(~n - 1);< 902737#factENTRY ~n := #in~n; 902738#L25 assume !(~n <= 0); 902728#L26 call #t~ret0 := fact(~n - 1);< 902732#factENTRY ~n := #in~n; 902735#L25 assume ~n <= 0;#res := 1; 902734#factFINAL assume true; 902727#factEXIT >#66#return; 902724#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 902700#factFINAL assume true; 902719#factEXIT >#66#return; 903102#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903091#factFINAL assume true; 903083#factEXIT >#66#return; 903087#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903377#factFINAL assume true; 903339#factEXIT >#66#return; 903340#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903325#factFINAL assume true; 903321#factEXIT >#66#return; 903319#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903318#factFINAL assume true; 903316#factEXIT >#68#return; 902846#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 903200#factENTRY ~n := #in~n; 903197#L25 assume !(~n <= 0); 902638#L26 call #t~ret0 := fact(~n - 1);< 902789#factENTRY ~n := #in~n; 902788#L25 assume !(~n <= 0); 902632#L26 call #t~ret0 := fact(~n - 1);< 902733#factENTRY ~n := #in~n; 902788#L25 assume !(~n <= 0); 902632#L26 call #t~ret0 := fact(~n - 1);< 902733#factENTRY ~n := #in~n; 902735#L25 assume ~n <= 0;#res := 1; 902734#factFINAL assume true; 902727#factEXIT >#66#return; 902724#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 902700#factFINAL assume true; 902719#factEXIT >#66#return; 903102#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903091#factFINAL assume true; 903083#factEXIT >#66#return; 903088#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903607#factFINAL assume true; 903585#factEXIT >#70#return; 903041#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 903073#factENTRY ~n := #in~n; 903537#L25 assume !(~n <= 0); 902705#L26 call #t~ret0 := fact(~n - 1);< 903157#factENTRY ~n := #in~n; 902752#L25 assume !(~n <= 0); 902709#L26 call #t~ret0 := fact(~n - 1);< 902746#factENTRY ~n := #in~n; 902735#L25 assume ~n <= 0;#res := 1; 902734#factFINAL assume true; 902727#factEXIT >#66#return; 902724#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 902700#factFINAL assume true; 902719#factEXIT >#66#return; 903105#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903606#factFINAL assume true; 903556#factEXIT >#72#return; 903562#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; 904986#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 904983#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 904951#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 903510#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; 902952#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 903006#factENTRY ~n := #in~n; 903005#L25 assume !(~n <= 0); 902904#L26 call #t~ret0 := fact(~n - 1);< 902935#factENTRY ~n := #in~n; 902933#L25 assume !(~n <= 0); 902874#L26 call #t~ret0 := fact(~n - 1);< 902897#factENTRY ~n := #in~n; 902890#L25 assume !(~n <= 0); 902867#L26 call #t~ret0 := fact(~n - 1);< 902873#factENTRY ~n := #in~n; 902870#L25 assume !(~n <= 0); 902704#L26 call #t~ret0 := fact(~n - 1);< 902737#factENTRY ~n := #in~n; 902738#L25 assume !(~n <= 0); 902728#L26 call #t~ret0 := fact(~n - 1);< 902732#factENTRY ~n := #in~n; 902735#L25 assume ~n <= 0;#res := 1; 902734#factFINAL assume true; 902727#factEXIT >#66#return; 902724#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 902700#factFINAL assume true; 902719#factEXIT >#66#return; 903102#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903091#factFINAL assume true; 903083#factEXIT >#66#return; 903087#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903377#factFINAL assume true; 903339#factEXIT >#66#return; 903340#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903325#factFINAL assume true; 903321#factEXIT >#66#return; 903319#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903318#factFINAL assume true; 903316#factEXIT >#68#return; 902827#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 903200#factENTRY ~n := #in~n; 903197#L25 assume !(~n <= 0); 902638#L26 call #t~ret0 := fact(~n - 1);< 902789#factENTRY ~n := #in~n; 902788#L25 assume !(~n <= 0); 902632#L26 call #t~ret0 := fact(~n - 1);< 902733#factENTRY ~n := #in~n; 902788#L25 assume !(~n <= 0); 902632#L26 call #t~ret0 := fact(~n - 1);< 902733#factENTRY ~n := #in~n; 902788#L25 assume !(~n <= 0); 902632#L26 call #t~ret0 := fact(~n - 1);< 902733#factENTRY ~n := #in~n; 902788#L25 assume !(~n <= 0); 902632#L26 call #t~ret0 := fact(~n - 1);< 902733#factENTRY ~n := #in~n; 902735#L25 assume ~n <= 0;#res := 1; 902734#factFINAL assume true; 902727#factEXIT >#66#return; 902724#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 902700#factFINAL assume true; 902719#factEXIT >#66#return; 903102#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903091#factFINAL assume true; 903083#factEXIT >#66#return; 903087#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903377#factFINAL assume true; 903339#factEXIT >#66#return; 903340#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903325#factFINAL assume true; 903321#factEXIT >#66#return; 902653#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903425#factFINAL assume true; 903422#factEXIT >#70#return; 902601#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 902725#factENTRY ~n := #in~n; 903536#L25 assume !(~n <= 0); 902705#L26 call #t~ret0 := fact(~n - 1);< 903157#factENTRY ~n := #in~n; 902770#L25 assume ~n <= 0;#res := 1; 903146#factFINAL assume true; 902990#factEXIT >#66#return; 902994#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903077#factFINAL assume true; 903039#factEXIT >#72#return; 903037#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; 903035#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 903021#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 903019#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 903017#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; 902946#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 903006#factENTRY ~n := #in~n; 903005#L25 assume !(~n <= 0); 902904#L26 call #t~ret0 := fact(~n - 1);< 902935#factENTRY ~n := #in~n; 902933#L25 assume !(~n <= 0); 902874#L26 call #t~ret0 := fact(~n - 1);< 902897#factENTRY ~n := #in~n; 902890#L25 assume !(~n <= 0); 902867#L26 call #t~ret0 := fact(~n - 1);< 902873#factENTRY ~n := #in~n; 902870#L25 assume !(~n <= 0); 902704#L26 call #t~ret0 := fact(~n - 1);< 902737#factENTRY ~n := #in~n; 902738#L25 assume !(~n <= 0); 902728#L26 call #t~ret0 := fact(~n - 1);< 902732#factENTRY ~n := #in~n; 902735#L25 assume ~n <= 0;#res := 1; 902734#factFINAL assume true; 902727#factEXIT >#66#return; 902724#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 902700#factFINAL assume true; 902719#factEXIT >#66#return; 903102#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903091#factFINAL assume true; 903083#factEXIT >#66#return; 903087#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903377#factFINAL assume true; 903339#factEXIT >#66#return; 903340#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903325#factFINAL assume true; 903321#factEXIT >#66#return; 903319#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903318#factFINAL assume true; 903316#factEXIT >#68#return; 902837#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 903200#factENTRY ~n := #in~n; 903197#L25 assume !(~n <= 0); 902638#L26 call #t~ret0 := fact(~n - 1);< 902789#factENTRY ~n := #in~n; 902788#L25 assume !(~n <= 0); 902632#L26 call #t~ret0 := fact(~n - 1);< 902733#factENTRY ~n := #in~n; 902788#L25 assume !(~n <= 0); 902632#L26 call #t~ret0 := fact(~n - 1);< 902733#factENTRY ~n := #in~n; 902788#L25 assume !(~n <= 0); 902632#L26 call #t~ret0 := fact(~n - 1);< 902733#factENTRY ~n := #in~n; 902788#L25 assume !(~n <= 0); 902632#L26 call #t~ret0 := fact(~n - 1);< 902733#factENTRY ~n := #in~n; 902735#L25 assume ~n <= 0;#res := 1; 902734#factFINAL assume true; 902727#factEXIT >#66#return; 902724#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 902700#factFINAL assume true; 902719#factEXIT >#66#return; 903102#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903091#factFINAL assume true; 903083#factEXIT >#66#return; 903087#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903377#factFINAL assume true; 903339#factEXIT >#66#return; 903340#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903325#factFINAL assume true; 903321#factEXIT >#66#return; 902653#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903425#factFINAL assume true; 903422#factEXIT >#70#return; 902595#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 902617#factENTRY ~n := #in~n; 903533#L25 assume ~n <= 0;#res := 1; 902785#factFINAL assume true; 902558#factEXIT >#72#return; 902611#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; 903933#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 903931#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 903930#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 903928#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; 903543#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 903926#factENTRY ~n := #in~n; 903935#L25 assume !(~n <= 0); 903820#L26 call #t~ret0 := fact(~n - 1);< 903934#factENTRY ~n := #in~n; 903932#L25 assume !(~n <= 0); 903819#L26 call #t~ret0 := fact(~n - 1);< 903929#factENTRY ~n := #in~n; 903927#L25 assume !(~n <= 0); 903818#L26 call #t~ret0 := fact(~n - 1);< 903923#factENTRY ~n := #in~n; 903922#L25 assume !(~n <= 0); 903817#L26 call #t~ret0 := fact(~n - 1);< 903870#factENTRY ~n := #in~n; 903921#L25 assume !(~n <= 0); 903822#L26 call #t~ret0 := fact(~n - 1);< 903911#factENTRY ~n := #in~n; 903920#L25 assume ~n <= 0;#res := 1; 903919#factFINAL assume true; 903910#factEXIT >#66#return; 903909#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903908#factFINAL assume true; 903904#factEXIT >#66#return; 903901#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903896#factFINAL assume true; 903868#factEXIT >#66#return; 903865#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903861#factFINAL assume true; 903856#factEXIT >#66#return; 903854#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903851#factFINAL assume true; 903846#factEXIT >#66#return; 903839#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903936#factFINAL assume true; 903925#factEXIT >#74#return; 903787#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 903788#factENTRY ~n := #in~n; 904006#L25 assume !(~n <= 0); 903979#L26 call #t~ret0 := fact(~n - 1);< 903997#factENTRY ~n := #in~n; 904079#L25 assume !(~n <= 0); 903968#L26 call #t~ret0 := fact(~n - 1);< 903999#factENTRY ~n := #in~n; 904020#L25 assume !(~n <= 0); 903954#L26 call #t~ret0 := fact(~n - 1);< 904015#factENTRY ~n := #in~n; 904020#L25 assume !(~n <= 0); 903954#L26 call #t~ret0 := fact(~n - 1);< 904015#factENTRY ~n := #in~n; 904020#L25 assume !(~n <= 0); 903954#L26 call #t~ret0 := fact(~n - 1);< 904015#factENTRY ~n := #in~n; 904035#L25 assume ~n <= 0;#res := 1; 904019#factFINAL assume true; 904012#factEXIT >#66#return; 904009#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903998#factFINAL assume true; 903953#factEXIT >#66#return; 903971#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 904618#factFINAL assume true; 904195#factEXIT >#66#return; 904194#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 904156#factFINAL assume true; 904145#factEXIT >#66#return; 904147#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 906839#factFINAL assume true; 904303#factEXIT >#66#return; 903951#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903947#factFINAL assume true; 903785#factEXIT >#76#return; 903778#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 903781#factENTRY ~n := #in~n; 903810#L25 assume !(~n <= 0); 903798#L26 call #t~ret0 := fact(~n - 1);< 903801#factENTRY ~n := #in~n; 903814#L25 assume ~n <= 0;#res := 1; 903806#factFINAL assume true; 903797#factEXIT >#66#return; 903791#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 903784#factFINAL assume true; 903777#factEXIT >#78#return; 903775#L30-8 [2022-11-20 09:43:48,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:43:48,784 INFO L85 PathProgramCache]: Analyzing trace with hash 478774201, now seen corresponding path program 50 times [2022-11-20 09:43:48,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:43:48,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598773350] [2022-11-20 09:43:48,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:43:48,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:43:48,805 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:43:48,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [16898277] [2022-11-20 09:43:48,805 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 09:43:48,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:43:48,805 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:43:48,810 INFO L229 MonitoredProcess]: Starting monitored process 363 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:43:48,811 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (363)] Waiting until timeout for monitored process [2022-11-20 09:43:49,725 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 09:43:49,726 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:43:49,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 1819 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-20 09:43:49,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:43:50,509 INFO L134 CoverageAnalysis]: Checked inductivity of 39137 backedges. 7131 proven. 313 refuted. 0 times theorem prover too weak. 31693 trivial. 0 not checked. [2022-11-20 09:43:50,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:43:51,606 INFO L134 CoverageAnalysis]: Checked inductivity of 39137 backedges. 338 proven. 313 refuted. 0 times theorem prover too weak. 38486 trivial. 0 not checked. [2022-11-20 09:43:51,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:43:51,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598773350] [2022-11-20 09:43:51,606 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 09:43:51,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16898277] [2022-11-20 09:43:51,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16898277] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:43:51,607 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:43:51,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2022-11-20 09:43:51,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261880873] [2022-11-20 09:43:51,607 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:43:51,608 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-20 09:43:51,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:43:51,608 INFO L85 PathProgramCache]: Analyzing trace with hash -2110596509, now seen corresponding path program 45 times [2022-11-20 09:43:51,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:43:51,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814781263] [2022-11-20 09:43:51,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:43:51,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:43:51,635 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:43:51,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1256888329] [2022-11-20 09:43:51,635 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 09:43:51,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:43:51,635 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:43:51,637 INFO L229 MonitoredProcess]: Starting monitored process 364 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:43:51,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (364)] Waiting until timeout for monitored process [2022-11-20 09:43:52,530 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2022-11-20 09:43:52,531 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:43:52,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-20 09:43:52,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:43:52,918 INFO L134 CoverageAnalysis]: Checked inductivity of 22369 backedges. 4352 proven. 672 refuted. 0 times theorem prover too weak. 17345 trivial. 0 not checked. [2022-11-20 09:43:52,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:43:56,257 INFO L134 CoverageAnalysis]: Checked inductivity of 22369 backedges. 3482 proven. 799 refuted. 0 times theorem prover too weak. 18088 trivial. 0 not checked. [2022-11-20 09:43:56,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:43:56,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814781263] [2022-11-20 09:43:56,257 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 09:43:56,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256888329] [2022-11-20 09:43:56,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256888329] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:43:56,258 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:43:56,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 29] total 32 [2022-11-20 09:43:56,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046254672] [2022-11-20 09:43:56,258 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:43:56,259 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 09:43:56,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:43:56,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-20 09:43:56,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=855, Unknown=0, NotChecked=0, Total=992 [2022-11-20 09:43:56,259 INFO L87 Difference]: Start difference. First operand 5748 states and 9170 transitions. cyclomatic complexity: 3483 Second operand has 32 states, 29 states have (on average 2.793103448275862) internal successors, (81), 32 states have internal predecessors, (81), 19 states have call successors, (29), 2 states have call predecessors, (29), 13 states have return successors, (36), 17 states have call predecessors, (36), 19 states have call successors, (36) [2022-11-20 09:43:59,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:43:59,241 INFO L93 Difference]: Finished difference Result 7742 states and 12717 transitions. [2022-11-20 09:43:59,242 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7742 states and 12717 transitions. [2022-11-20 09:43:59,284 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1772 [2022-11-20 09:43:59,338 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7742 states to 7734 states and 12694 transitions. [2022-11-20 09:43:59,338 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 641 [2022-11-20 09:43:59,339 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 641 [2022-11-20 09:43:59,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7734 states and 12694 transitions. [2022-11-20 09:43:59,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 09:43:59,340 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7734 states and 12694 transitions. [2022-11-20 09:43:59,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7734 states and 12694 transitions. [2022-11-20 09:43:59,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7734 to 6842. [2022-11-20 09:43:59,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6842 states, 4247 states have (on average 1.0367318106898988) internal successors, (4403), 4225 states have internal predecessors, (4403), 1973 states have call successors, (2019), 723 states have call predecessors, (2019), 622 states have return successors, (4740), 1893 states have call predecessors, (4740), 1973 states have call successors, (4740) [2022-11-20 09:43:59,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6842 states to 6842 states and 11162 transitions. [2022-11-20 09:43:59,473 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6842 states and 11162 transitions. [2022-11-20 09:43:59,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-20 09:43:59,474 INFO L428 stractBuchiCegarLoop]: Abstraction has 6842 states and 11162 transitions. [2022-11-20 09:43:59,474 INFO L335 stractBuchiCegarLoop]: ======== Iteration 73 ============ [2022-11-20 09:43:59,474 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6842 states and 11162 transitions. [2022-11-20 09:43:59,491 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1544 [2022-11-20 09:43:59,492 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 09:43:59,492 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 09:43:59,495 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [127, 127, 76, 76, 76, 76, 51, 17, 16, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 7, 7, 7, 7, 7, 6, 6, 4, 3, 3, 1, 1, 1, 1] [2022-11-20 09:43:59,495 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [95, 95, 74, 74, 74, 74, 21, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:43:59,496 INFO L748 eck$LassoCheckResult]: Stem: 924459#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 924431#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; 924432#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 924458#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; 924445#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 924446#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 930048#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; 924418#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 924419#factENTRY ~n := #in~n; 930065#L25 assume ~n <= 0;#res := 1; 930064#factFINAL assume true; 929776#factEXIT >#68#return; 924472#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 924473#factENTRY ~n := #in~n; 929772#L25 assume ~n <= 0;#res := 1; 929770#factFINAL assume true; 929767#factEXIT >#70#return; 924393#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 924394#factENTRY ~n := #in~n; 930694#L25 assume ~n <= 0;#res := 1; 930693#factFINAL assume true; 930692#factEXIT >#72#return; 930691#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; 930689#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 930686#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 930682#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 930680#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; 930676#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 930677#factENTRY ~n := #in~n; 930688#L25 assume !(~n <= 0); 930684#L26 call #t~ret0 := fact(~n - 1);< 930685#factENTRY ~n := #in~n; 930690#L25 assume ~n <= 0;#res := 1; 930687#factFINAL assume true; 930683#factEXIT >#66#return; 930681#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 930679#factFINAL assume true; 930675#factEXIT >#74#return; 930672#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 930673#factENTRY ~n := #in~n; 930678#L25 assume ~n <= 0;#res := 1; 930674#factFINAL assume true; 930671#factEXIT >#76#return; 930669#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 930670#factENTRY ~n := #in~n; 930702#L25 assume !(~n <= 0); 930699#L26 call #t~ret0 := fact(~n - 1);< 930700#factENTRY ~n := #in~n; 930704#L25 assume ~n <= 0;#res := 1; 930703#factFINAL assume true; 930698#factEXIT >#66#return; 930697#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 930695#factFINAL assume true; 930668#factEXIT >#78#return; 930667#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; 930666#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 930630#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 930631#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 930625#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; 930616#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 930620#factENTRY ~n := #in~n; 930652#L25 assume !(~n <= 0); 930643#L26 call #t~ret0 := fact(~n - 1);< 930648#factENTRY ~n := #in~n; 930789#L25 assume !(~n <= 0); 930642#L26 call #t~ret0 := fact(~n - 1);< 930787#factENTRY ~n := #in~n; 930796#L25 assume ~n <= 0;#res := 1; 930793#factFINAL assume true; 930786#factEXIT >#66#return; 930785#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 930781#factFINAL assume true; 930641#factEXIT >#66#return; 930636#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 930623#factFINAL assume true; 930613#factEXIT >#74#return; 930618#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 930422#factENTRY ~n := #in~n; 930701#L25 assume ~n <= 0;#res := 1; 930696#factFINAL assume true; 930664#factEXIT >#76#return; 930661#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 930663#factENTRY ~n := #in~n; 930715#L25 assume !(~n <= 0); 930710#L26 call #t~ret0 := fact(~n - 1);< 930713#factENTRY ~n := #in~n; 930776#L25 assume !(~n <= 0); 930708#L26 call #t~ret0 := fact(~n - 1);< 930767#factENTRY ~n := #in~n; 930779#L25 assume ~n <= 0;#res := 1; 930777#factFINAL assume true; 930766#factEXIT >#66#return; 930764#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 930742#factFINAL assume true; 930707#factEXIT >#66#return; 930706#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 930705#factFINAL assume true; 930658#factEXIT >#78#return; 930657#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; 930656#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 930655#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 930654#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 930653#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; 930184#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 930379#factENTRY ~n := #in~n; 930378#L25 assume !(~n <= 0); 930181#L26 call #t~ret0 := fact(~n - 1);< 930185#factENTRY ~n := #in~n; 930364#L25 assume !(~n <= 0); 930182#L26 call #t~ret0 := fact(~n - 1);< 930215#factENTRY ~n := #in~n; 930364#L25 assume !(~n <= 0); 930182#L26 call #t~ret0 := fact(~n - 1);< 930215#factENTRY ~n := #in~n; 930370#L25 assume ~n <= 0;#res := 1; 930371#factFINAL assume true; 930384#factEXIT >#66#return; 930366#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 930360#factFINAL assume true; 930361#factEXIT >#66#return; 930194#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 930195#factFINAL assume true; 930180#factEXIT >#66#return; 930183#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 930383#factFINAL assume true; 930380#factEXIT >#74#return; 930164#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 930165#factENTRY ~n := #in~n; 930171#L25 assume ~n <= 0;#res := 1; 930167#factFINAL assume true; 930163#factEXIT >#76#return; 924464#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 926566#factENTRY ~n := #in~n; 930258#L25 assume !(~n <= 0); 930198#L26 call #t~ret0 := fact(~n - 1);< 930238#factENTRY ~n := #in~n; 930349#L25 assume !(~n <= 0); 930202#L26 call #t~ret0 := fact(~n - 1);< 930218#factENTRY ~n := #in~n; 930357#L25 assume !(~n <= 0); 930201#L26 call #t~ret0 := fact(~n - 1);< 930348#factENTRY ~n := #in~n; 930355#L25 assume ~n <= 0;#res := 1; 930353#factFINAL assume true; 930347#factEXIT >#66#return; 930346#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 930344#factFINAL assume true; 930338#factEXIT >#66#return; 930316#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 930315#factFINAL assume true; 930252#factEXIT >#66#return; 924463#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 924465#factFINAL assume true; 926565#factEXIT >#78#return; 926563#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; 926562#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 926561#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 926560#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 926559#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 926557#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 926556#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 926554#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; 926543#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 926544#factENTRY ~n := #in~n; 926652#L25 assume !(~n <= 0); 926649#L26 call #t~ret0 := fact(~n - 1);< 926650#factENTRY ~n := #in~n; 926659#L25 assume ~n <= 0;#res := 1; 926657#factFINAL assume true; 926648#factEXIT >#66#return; 926647#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 926645#factFINAL assume true; 926541#factEXIT >#68#return; 926365#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 926367#factENTRY ~n := #in~n; 926976#L25 assume ~n <= 0;#res := 1; 926974#factFINAL assume true; 926364#factEXIT >#70#return; 926357#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 926359#factENTRY ~n := #in~n; 927884#L25 assume !(~n <= 0); 926956#L26 call #t~ret0 := fact(~n - 1);< 926957#factENTRY ~n := #in~n; 926962#L25 assume ~n <= 0;#res := 1; 926961#factFINAL assume true; 926955#factEXIT >#66#return; 926953#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 926951#factFINAL assume true; 926355#factEXIT >#72#return; 926358#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; 926540#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 926538#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 926537#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 926535#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; 926301#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 926302#factENTRY ~n := #in~n; 926600#L25 assume !(~n <= 0); 926593#L26 call #t~ret0 := fact(~n - 1);< 926598#factENTRY ~n := #in~n; 926622#L25 assume ~n <= 0;#res := 1; 926611#factFINAL assume true; 926592#factEXIT >#66#return; 926591#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 926330#factFINAL assume true; 926299#factEXIT >#68#return; 926289#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 926293#factENTRY ~n := #in~n; 928230#L25 assume !(~n <= 0); 928228#L26 call #t~ret0 := fact(~n - 1);< 928229#factENTRY ~n := #in~n; 928232#L25 assume ~n <= 0;#res := 1; 928231#factFINAL assume true; 928227#factEXIT >#66#return; 928226#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 926297#factFINAL assume true; 926288#factEXIT >#70#return; 926291#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 926282#factENTRY ~n := #in~n; 927904#L25 assume ~n <= 0;#res := 1; 927902#factFINAL assume true; 927897#factEXIT >#72#return; 927896#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; 927895#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 927894#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 927893#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 927891#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; 926259#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 926260#factENTRY ~n := #in~n; 927910#L25 assume !(~n <= 0); 927907#L26 call #t~ret0 := fact(~n - 1);< 927909#factENTRY ~n := #in~n; 927915#L25 assume !(~n <= 0); 927908#L26 call #t~ret0 := fact(~n - 1);< 927914#factENTRY ~n := #in~n; 927917#L25 assume ~n <= 0;#res := 1; 927916#factFINAL assume true; 927913#factEXIT >#66#return; 927912#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 927911#factFINAL assume true; 927906#factEXIT >#66#return; 927905#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 927903#factFINAL assume true; 927892#factEXIT >#74#return; 927193#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 930028#factENTRY ~n := #in~n; 928321#L25 assume !(~n <= 0); 926926#L26 call #t~ret0 := fact(~n - 1);< 926932#factENTRY ~n := #in~n; 926966#L25 assume ~n <= 0;#res := 1; 926948#factFINAL assume true; 926925#factEXIT >#66#return; 926930#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 930032#factFINAL assume true; 930030#factEXIT >#76#return; 925433#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 925436#factENTRY ~n := #in~n; 925479#L25 assume !(~n <= 0); 925476#L26 call #t~ret0 := fact(~n - 1);< 925477#factENTRY ~n := #in~n; 925946#L25 assume ~n <= 0;#res := 1; 925696#factFINAL assume true; 925475#factEXIT >#66#return; 925474#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 925465#factFINAL assume true; 925432#factEXIT >#78#return; 925431#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; 925430#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 925428#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 925426#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 925424#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; 925419#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 925422#factENTRY ~n := #in~n; 925859#L25 assume !(~n <= 0); 925620#L26 call #t~ret0 := fact(~n - 1);< 925622#factENTRY ~n := #in~n; 925672#L25 assume !(~n <= 0); 925621#L26 call #t~ret0 := fact(~n - 1);< 925671#factENTRY ~n := #in~n; 925672#L25 assume !(~n <= 0); 925621#L26 call #t~ret0 := fact(~n - 1);< 925671#factENTRY ~n := #in~n; 925678#L25 assume ~n <= 0;#res := 1; 925677#factFINAL assume true; 925676#factEXIT >#66#return; 925675#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 925673#factFINAL assume true; 925670#factEXIT >#66#return; 925669#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 925667#factFINAL assume true; 925619#factEXIT >#66#return; 925617#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 925427#factFINAL assume true; 925417#factEXIT >#74#return; 925288#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 925291#factENTRY ~n := #in~n; 925503#L25 assume !(~n <= 0); 925353#L26 call #t~ret0 := fact(~n - 1);< 925355#factENTRY ~n := #in~n; 925490#L25 assume ~n <= 0;#res := 1; 925374#factFINAL assume true; 925351#factEXIT >#66#return; 925349#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 925347#factFINAL assume true; 925286#factEXIT >#76#return; 925283#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 925266#factENTRY ~n := #in~n; 925489#L25 assume !(~n <= 0); 925322#L26 call #t~ret0 := fact(~n - 1);< 925335#factENTRY ~n := #in~n; 925829#L25 assume !(~n <= 0); 925323#L26 call #t~ret0 := fact(~n - 1);< 925549#factENTRY ~n := #in~n; 925561#L25 assume ~n <= 0;#res := 1; 925697#factFINAL assume true; 925480#factEXIT >#66#return; 925478#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 925472#factFINAL assume true; 925321#factEXIT >#66#return; 925319#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 925284#factFINAL assume true; 925282#factEXIT >#78#return; 925264#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; 926251#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 926249#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 926207#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 926205#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 926202#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 926203#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 928704#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; 925197#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 925203#factENTRY ~n := #in~n; 925255#L25 assume !(~n <= 0); 925229#L26 call #t~ret0 := fact(~n - 1);< 925233#factENTRY ~n := #in~n; 925239#L25 assume !(~n <= 0); 925230#L26 call #t~ret0 := fact(~n - 1);< 925237#factENTRY ~n := #in~n; 925254#L25 assume ~n <= 0;#res := 1; 925252#factFINAL assume true; 925244#factEXIT >#66#return; 925240#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 925236#factFINAL assume true; 925228#factEXIT >#66#return; 925223#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 925222#factFINAL assume true; 925196#factEXIT >#68#return; 925201#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 925193#factENTRY ~n := #in~n; 928703#L25 assume ~n <= 0;#res := 1; 928681#factFINAL assume true; 928605#factEXIT >#70#return; 928600#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 928603#factENTRY ~n := #in~n; 928722#L25 assume !(~n <= 0); 928711#L26 call #t~ret0 := fact(~n - 1);< 928714#factENTRY ~n := #in~n; 929493#L25 assume !(~n <= 0); 928710#L26 call #t~ret0 := fact(~n - 1);< 929495#factENTRY ~n := #in~n; 928754#L25 assume ~n <= 0;#res := 1; 928748#factFINAL assume true; 928741#factEXIT >#66#return; 928734#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 928719#factFINAL assume true; 928709#factEXIT >#66#return; 928702#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 928680#factFINAL assume true; 928599#factEXIT >#72#return; 928602#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; 928608#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 928604#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 928598#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 928596#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; 928571#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 928577#factENTRY ~n := #in~n; 928646#L25 assume !(~n <= 0); 928644#L26 call #t~ret0 := fact(~n - 1);< 928645#factENTRY ~n := #in~n; 928658#L25 assume !(~n <= 0); 928651#L26 call #t~ret0 := fact(~n - 1);< 928652#factENTRY ~n := #in~n; 928665#L25 assume ~n <= 0;#res := 1; 928663#factFINAL assume true; 928650#factEXIT >#66#return; 928648#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 928647#factFINAL assume true; 928643#factEXIT >#66#return; 928641#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 928640#factFINAL assume true; 928570#factEXIT >#68#return; 928576#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 928590#factENTRY ~n := #in~n; 928661#L25 assume !(~n <= 0); 928654#L26 call #t~ret0 := fact(~n - 1);< 928657#factENTRY ~n := #in~n; 928662#L25 assume ~n <= 0;#res := 1; 928660#factFINAL assume true; 928653#factEXIT >#66#return; 928656#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 928592#factFINAL assume true; 928589#factEXIT >#70#return; 928585#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 928588#factENTRY ~n := #in~n; 928659#L25 assume !(~n <= 0); 928655#L26 call #t~ret0 := fact(~n - 1);< 928657#factENTRY ~n := #in~n; 928662#L25 assume ~n <= 0;#res := 1; 928660#factFINAL assume true; 928653#factEXIT >#66#return; 928649#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 928642#factFINAL assume true; 928584#factEXIT >#72#return; 928587#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; 928774#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 928768#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 928639#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 928638#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; 928572#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 928577#factENTRY ~n := #in~n; 928646#L25 assume !(~n <= 0); 928644#L26 call #t~ret0 := fact(~n - 1);< 928645#factENTRY ~n := #in~n; 928658#L25 assume !(~n <= 0); 928651#L26 call #t~ret0 := fact(~n - 1);< 928652#factENTRY ~n := #in~n; 928665#L25 assume ~n <= 0;#res := 1; 928663#factFINAL assume true; 928650#factEXIT >#66#return; 928648#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 928647#factFINAL assume true; 928643#factEXIT >#66#return; 928641#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 928640#factFINAL assume true; 928570#factEXIT >#68#return; 928567#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 928568#factENTRY ~n := #in~n; 928633#L25 assume !(~n <= 0); 928535#L26 call #t~ret0 := fact(~n - 1);< 928540#factENTRY ~n := #in~n; 928627#L25 assume !(~n <= 0); 928624#L26 call #t~ret0 := fact(~n - 1);< 928626#factENTRY ~n := #in~n; 928666#L25 assume ~n <= 0;#res := 1; 928664#factFINAL assume true; 928623#factEXIT >#66#return; 928621#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 928543#factFINAL assume true; 928532#factEXIT >#66#return; 928539#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 928630#factFINAL assume true; 928565#factEXIT >#70#return; 928558#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 928561#factENTRY ~n := #in~n; 928667#L25 assume ~n <= 0;#res := 1; 928622#factFINAL assume true; 928557#factEXIT >#72#return; 928560#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; 929644#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 929642#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 929640#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 929639#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; 928528#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 929728#factENTRY ~n := #in~n; 929735#L25 assume !(~n <= 0); 929733#L26 call #t~ret0 := fact(~n - 1);< 929653#factENTRY ~n := #in~n; 929740#L25 assume !(~n <= 0); 929732#L26 call #t~ret0 := fact(~n - 1);< 929739#factENTRY ~n := #in~n; 929740#L25 assume !(~n <= 0); 929732#L26 call #t~ret0 := fact(~n - 1);< 929739#factENTRY ~n := #in~n; 929741#L25 assume ~n <= 0;#res := 1; 929745#factFINAL assume true; 929744#factEXIT >#66#return; 929743#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 929742#factFINAL assume true; 929738#factEXIT >#66#return; 929737#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 929736#factFINAL assume true; 929731#factEXIT >#66#return; 929730#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 929729#factFINAL assume true; 929727#factEXIT >#74#return; 929725#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 929726#factENTRY ~n := #in~n; 929747#L25 assume !(~n <= 0); 928108#L26 call #t~ret0 := fact(~n - 1);< 929627#factENTRY ~n := #in~n; 929626#L25 assume !(~n <= 0); 929621#L26 call #t~ret0 := fact(~n - 1);< 929623#factENTRY ~n := #in~n; 929674#L25 assume ~n <= 0;#res := 1; 929672#factFINAL assume true; 929620#factEXIT >#66#return; 929619#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 928156#factFINAL assume true; 928105#factEXIT >#66#return; 928123#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 929746#factFINAL assume true; 929724#factEXIT >#76#return; 928073#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 929720#factENTRY ~n := #in~n; 929719#L25 assume !(~n <= 0); 929716#L26 call #t~ret0 := fact(~n - 1);< 929718#factENTRY ~n := #in~n; 929750#L25 assume ~n <= 0;#res := 1; 929748#factFINAL assume true; 929715#factEXIT >#66#return; 929717#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 929723#factFINAL assume true; 929722#factEXIT >#78#return; 924485#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; 924484#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 924483#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 924482#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 924451#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 924447#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 924448#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 926575#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; 925293#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 925383#factENTRY ~n := #in~n; 925381#L25 assume !(~n <= 0); 925231#L26 call #t~ret0 := fact(~n - 1);< 925233#factENTRY ~n := #in~n; 925239#L25 assume !(~n <= 0); 925230#L26 call #t~ret0 := fact(~n - 1);< 925237#factENTRY ~n := #in~n; 925239#L25 assume !(~n <= 0); 925230#L26 call #t~ret0 := fact(~n - 1);< 925237#factENTRY ~n := #in~n; 925254#L25 assume ~n <= 0;#res := 1; 925252#factFINAL assume true; 925244#factEXIT >#66#return; 925240#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 925236#factFINAL assume true; 925228#factEXIT >#66#return; 925232#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 926483#factFINAL assume true; 926480#factEXIT >#66#return; 926478#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 926476#factFINAL assume true; 926473#factEXIT >#68#return; 925186#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 925192#factENTRY ~n := #in~n; 925221#L25 assume ~n <= 0;#res := 1; 925195#factFINAL assume true; 925185#factEXIT >#70#return; 925190#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 926465#factENTRY ~n := #in~n; 926675#L25 assume !(~n <= 0); 925225#L26 call #t~ret0 := fact(~n - 1);< 926673#factENTRY ~n := #in~n; 926428#L25 assume !(~n <= 0); 925208#L26 call #t~ret0 := fact(~n - 1);< 925227#factENTRY ~n := #in~n; 928042#L25 assume !(~n <= 0); 925248#L26 call #t~ret0 := fact(~n - 1);< 925249#factENTRY ~n := #in~n; 925259#L25 assume ~n <= 0;#res := 1; 925257#factFINAL assume true; 925247#factEXIT >#66#return; 925242#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 925224#factFINAL assume true; 925204#factEXIT >#66#return; 925210#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 927008#factFINAL assume true; 926671#factEXIT >#66#return; 926669#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 926668#factFINAL assume true; 926463#factEXIT >#72#return; 926464#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; 927865#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 927864#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 927863#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 927861#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; 924955#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 924979#factENTRY ~n := #in~n; 924971#L25 assume !(~n <= 0); 924945#L26 call #t~ret0 := fact(~n - 1);< 924952#factENTRY ~n := #in~n; 924949#L25 assume !(~n <= 0); 924807#L26 call #t~ret0 := fact(~n - 1);< 924819#factENTRY ~n := #in~n; 924818#L25 assume !(~n <= 0); 924802#L26 call #t~ret0 := fact(~n - 1);< 924808#factENTRY ~n := #in~n; 924814#L25 assume ~n <= 0;#res := 1; 924813#factFINAL assume true; 924797#factEXIT >#66#return; 924804#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 925740#factFINAL assume true; 925732#factEXIT >#66#return; 925731#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 925707#factFINAL assume true; 925700#factEXIT >#66#return; 925699#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 925698#factFINAL assume true; 925695#factEXIT >#68#return; 924931#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 925588#factENTRY ~n := #in~n; 925587#L25 assume !(~n <= 0); 924823#L26 call #t~ret0 := fact(~n - 1);< 924933#factENTRY ~n := #in~n; 924874#L25 assume ~n <= 0;#res := 1; 926093#factFINAL assume true; 926085#factEXIT >#66#return; 926090#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 926446#factFINAL assume true; 926131#factEXIT >#70#return; 924943#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 924951#factENTRY ~n := #in~n; 924948#L25 assume !(~n <= 0); 924805#L26 call #t~ret0 := fact(~n - 1);< 924944#factENTRY ~n := #in~n; 924818#L25 assume !(~n <= 0); 924802#L26 call #t~ret0 := fact(~n - 1);< 924808#factENTRY ~n := #in~n; 924814#L25 assume ~n <= 0;#res := 1; 924813#factFINAL assume true; 924797#factEXIT >#66#return; 924804#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 925740#factFINAL assume true; 925732#factEXIT >#66#return; 925736#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 926042#factFINAL assume true; 926037#factEXIT >#72#return; 926035#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; 926034#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 926032#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 926030#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 926029#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; 924959#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 924979#factENTRY ~n := #in~n; 924971#L25 assume !(~n <= 0); 924945#L26 call #t~ret0 := fact(~n - 1);< 924952#factENTRY ~n := #in~n; 924949#L25 assume !(~n <= 0); 924807#L26 call #t~ret0 := fact(~n - 1);< 924819#factENTRY ~n := #in~n; 924818#L25 assume !(~n <= 0); 924802#L26 call #t~ret0 := fact(~n - 1);< 924808#factENTRY ~n := #in~n; 924814#L25 assume ~n <= 0;#res := 1; 924813#factFINAL assume true; 924797#factEXIT >#66#return; 924804#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 925740#factFINAL assume true; 925732#factEXIT >#66#return; 925731#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 925707#factFINAL assume true; 925700#factEXIT >#66#return; 925699#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 925698#factFINAL assume true; 925695#factEXIT >#68#return; 924936#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 925694#factENTRY ~n := #in~n; 925693#L25 assume !(~n <= 0); 924824#L26 call #t~ret0 := fact(~n - 1);< 924830#factENTRY ~n := #in~n; 924826#L25 assume !(~n <= 0); 924800#L26 call #t~ret0 := fact(~n - 1);< 924817#factENTRY ~n := #in~n; 924814#L25 assume ~n <= 0;#res := 1; 924813#factFINAL assume true; 924797#factEXIT >#66#return; 924804#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 925740#factFINAL assume true; 925732#factEXIT >#66#return; 925737#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 926010#factFINAL assume true; 925941#factEXIT >#70#return; 925936#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 925939#factENTRY ~n := #in~n; 926092#L25 assume !(~n <= 0); 926087#L26 call #t~ret0 := fact(~n - 1);< 926091#factENTRY ~n := #in~n; 924874#L25 assume ~n <= 0;#res := 1; 926093#factFINAL assume true; 926085#factEXIT >#66#return; 926084#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 926006#factFINAL assume true; 925935#factEXIT >#72#return; 925933#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; 925931#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 925929#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 925927#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 925925#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; 924956#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 924979#factENTRY ~n := #in~n; 924971#L25 assume !(~n <= 0); 924945#L26 call #t~ret0 := fact(~n - 1);< 924952#factENTRY ~n := #in~n; 924949#L25 assume !(~n <= 0); 924807#L26 call #t~ret0 := fact(~n - 1);< 924819#factENTRY ~n := #in~n; 924818#L25 assume !(~n <= 0); 924802#L26 call #t~ret0 := fact(~n - 1);< 924808#factENTRY ~n := #in~n; 924814#L25 assume ~n <= 0;#res := 1; 924813#factFINAL assume true; 924797#factEXIT >#66#return; 924804#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 925740#factFINAL assume true; 925732#factEXIT >#66#return; 925731#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 925707#factFINAL assume true; 925700#factEXIT >#66#return; 925699#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 925698#factFINAL assume true; 925695#factEXIT >#68#return; 924939#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 925694#factENTRY ~n := #in~n; 925693#L25 assume !(~n <= 0); 924824#L26 call #t~ret0 := fact(~n - 1);< 924830#factENTRY ~n := #in~n; 924826#L25 assume !(~n <= 0); 924800#L26 call #t~ret0 := fact(~n - 1);< 924817#factENTRY ~n := #in~n; 924814#L25 assume ~n <= 0;#res := 1; 924813#factFINAL assume true; 924797#factEXIT >#66#return; 924804#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 925740#factFINAL assume true; 925732#factEXIT >#66#return; 925737#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 926010#factFINAL assume true; 925941#factEXIT >#70#return; 925943#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 926523#factENTRY ~n := #in~n; 926532#L25 assume ~n <= 0;#res := 1; 926531#factFINAL assume true; 926521#factEXIT >#72#return; 926522#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; 927715#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 927714#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 927713#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 927712#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; 926515#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 927710#factENTRY ~n := #in~n; 927723#L25 assume !(~n <= 0); 927719#L26 call #t~ret0 := fact(~n - 1);< 927722#factENTRY ~n := #in~n; 927748#L25 assume !(~n <= 0); 927670#L26 call #t~ret0 := fact(~n - 1);< 927684#factENTRY ~n := #in~n; 927696#L25 assume !(~n <= 0); 927673#L26 call #t~ret0 := fact(~n - 1);< 927689#factENTRY ~n := #in~n; 927696#L25 assume !(~n <= 0); 927673#L26 call #t~ret0 := fact(~n - 1);< 927689#factENTRY ~n := #in~n; 927711#L25 assume ~n <= 0;#res := 1; 927708#factFINAL assume true; 927688#factEXIT >#66#return; 927687#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 927685#factFINAL assume true; 927683#factEXIT >#66#return; 927681#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 927678#factFINAL assume true; 927669#factEXIT >#66#return; 927675#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 927724#factFINAL assume true; 927718#factEXIT >#66#return; 927717#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 927716#factFINAL assume true; 927709#factEXIT >#74#return; 927572#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 927592#factENTRY ~n := #in~n; 927742#L25 assume !(~n <= 0); 927324#L26 call #t~ret0 := fact(~n - 1);< 927339#factENTRY ~n := #in~n; 927329#L25 assume !(~n <= 0); 927279#L26 call #t~ret0 := fact(~n - 1);< 927320#factENTRY ~n := #in~n; 927319#L25 assume !(~n <= 0); 927278#L26 call #t~ret0 := fact(~n - 1);< 927315#factENTRY ~n := #in~n; 927311#L25 assume !(~n <= 0); 927305#L26 call #t~ret0 := fact(~n - 1);< 927306#factENTRY ~n := #in~n; 927314#L25 assume ~n <= 0;#res := 1; 927313#factFINAL assume true; 927304#factEXIT >#66#return; 927303#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 927288#factFINAL assume true; 927261#factEXIT >#66#return; 927280#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 927771#factFINAL assume true; 927759#factEXIT >#66#return; 927757#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 927746#factFINAL assume true; 927731#factEXIT >#66#return; 927729#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 927728#factFINAL assume true; 927591#factEXIT >#76#return; 927050#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 927569#factENTRY ~n := #in~n; 927600#L25 assume !(~n <= 0); 927596#L26 call #t~ret0 := fact(~n - 1);< 927599#factENTRY ~n := #in~n; 927608#L25 assume ~n <= 0;#res := 1; 927601#factFINAL assume true; 927595#factEXIT >#66#return; 927593#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 927590#factFINAL assume true; 927048#factEXIT >#78#return; 927051#L30-8 [2022-11-20 09:43:59,496 INFO L750 eck$LassoCheckResult]: Loop: 927051#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; 929604#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 929602#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 929599#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 929596#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 929550#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 929546#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 929498#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; 929022#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 924417#factENTRY ~n := #in~n; 929166#L25 assume !(~n <= 0); 927018#L26 call #t~ret0 := fact(~n - 1);< 927022#factENTRY ~n := #in~n; 927020#L25 assume !(~n <= 0); 926935#L26 call #t~ret0 := fact(~n - 1);< 927017#factENTRY ~n := #in~n; 927016#L25 assume !(~n <= 0); 926939#L26 call #t~ret0 := fact(~n - 1);< 927014#factENTRY ~n := #in~n; 927011#L25 assume !(~n <= 0); 926938#L26 call #t~ret0 := fact(~n - 1);< 926950#factENTRY ~n := #in~n; 926972#L25 assume !(~n <= 0); 926937#L26 call #t~ret0 := fact(~n - 1);< 926971#factENTRY ~n := #in~n; 926975#L25 assume ~n <= 0;#res := 1; 926973#factFINAL assume true; 926970#factEXIT >#66#return; 926968#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 926967#factFINAL assume true; 926965#factEXIT >#66#return; 926964#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 926963#factFINAL assume true; 926949#factEXIT >#66#return; 926947#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 926945#factFINAL assume true; 926933#factEXIT >#66#return; 926942#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 929337#factFINAL assume true; 929334#factEXIT >#66#return; 929335#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 929336#factFINAL assume true; 929332#factEXIT >#68#return; 926902#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 926911#factENTRY ~n := #in~n; 926921#L25 assume ~n <= 0;#res := 1; 926919#factFINAL assume true; 926884#factEXIT >#70#return; 926910#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 929327#factENTRY ~n := #in~n; 929342#L25 assume !(~n <= 0); 926985#L26 call #t~ret0 := fact(~n - 1);< 926988#factENTRY ~n := #in~n; 926987#L25 assume !(~n <= 0); 926980#L26 call #t~ret0 := fact(~n - 1);< 926982#factENTRY ~n := #in~n; 926990#L25 assume !(~n <= 0); 925226#L26 call #t~ret0 := fact(~n - 1);< 926673#factENTRY ~n := #in~n; 926428#L25 assume !(~n <= 0); 925208#L26 call #t~ret0 := fact(~n - 1);< 925227#factENTRY ~n := #in~n; 928042#L25 assume !(~n <= 0); 925248#L26 call #t~ret0 := fact(~n - 1);< 925249#factENTRY ~n := #in~n; 925259#L25 assume ~n <= 0;#res := 1; 925257#factFINAL assume true; 925247#factEXIT >#66#return; 925242#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 925224#factFINAL assume true; 925204#factEXIT >#66#return; 925210#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 927008#factFINAL assume true; 926671#factEXIT >#66#return; 926672#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 926984#factFINAL assume true; 926978#factEXIT >#66#return; 926981#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 929343#factFINAL assume true; 929340#factEXIT >#66#return; 929339#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 929338#factFINAL assume true; 929323#factEXIT >#72#return; 929325#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; 929461#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 929458#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 929409#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 929408#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; 925013#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 925084#factENTRY ~n := #in~n; 925082#L25 assume !(~n <= 0); 924725#L26 call #t~ret0 := fact(~n - 1);< 924993#factENTRY ~n := #in~n; 924984#L25 assume !(~n <= 0); 924954#L26 call #t~ret0 := fact(~n - 1);< 924970#factENTRY ~n := #in~n; 924969#L25 assume !(~n <= 0); 924946#L26 call #t~ret0 := fact(~n - 1);< 924952#factENTRY ~n := #in~n; 924949#L25 assume !(~n <= 0); 924807#L26 call #t~ret0 := fact(~n - 1);< 924819#factENTRY ~n := #in~n; 924818#L25 assume !(~n <= 0); 924802#L26 call #t~ret0 := fact(~n - 1);< 924808#factENTRY ~n := #in~n; 924814#L25 assume ~n <= 0;#res := 1; 924813#factFINAL assume true; 924797#factEXIT >#66#return; 924804#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 925740#factFINAL assume true; 925732#factEXIT >#66#return; 925731#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 925707#factFINAL assume true; 925700#factEXIT >#66#return; 925702#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 926619#factFINAL assume true; 926615#factEXIT >#66#return; 924796#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 924790#factFINAL assume true; 924718#factEXIT >#66#return; 924748#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 929282#factFINAL assume true; 929278#factEXIT >#68#return; 926108#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 926119#factENTRY ~n := #in~n; 926117#L25 assume !(~n <= 0); 926086#L26 call #t~ret0 := fact(~n - 1);< 926091#factENTRY ~n := #in~n; 924874#L25 assume ~n <= 0;#res := 1; 926093#factFINAL assume true; 926085#factEXIT >#66#return; 926088#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 926871#factFINAL assume true; 926857#factEXIT >#70#return; 924976#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 924990#factENTRY ~n := #in~n; 924983#L25 assume !(~n <= 0); 924953#L26 call #t~ret0 := fact(~n - 1);< 924970#factENTRY ~n := #in~n; 924969#L25 assume !(~n <= 0); 924946#L26 call #t~ret0 := fact(~n - 1);< 924952#factENTRY ~n := #in~n; 924949#L25 assume !(~n <= 0); 924807#L26 call #t~ret0 := fact(~n - 1);< 924819#factENTRY ~n := #in~n; 924818#L25 assume !(~n <= 0); 924802#L26 call #t~ret0 := fact(~n - 1);< 924808#factENTRY ~n := #in~n; 924814#L25 assume ~n <= 0;#res := 1; 924813#factFINAL assume true; 924797#factEXIT >#66#return; 924804#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 925740#factFINAL assume true; 925732#factEXIT >#66#return; 925731#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 925707#factFINAL assume true; 925700#factEXIT >#66#return; 925702#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 926619#factFINAL assume true; 926615#factEXIT >#66#return; 926616#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 926875#factFINAL assume true; 926793#factEXIT >#72#return; 926816#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; 929405#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 929404#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 929403#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 929402#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; 925025#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 925084#factENTRY ~n := #in~n; 925082#L25 assume !(~n <= 0); 924725#L26 call #t~ret0 := fact(~n - 1);< 924993#factENTRY ~n := #in~n; 924984#L25 assume !(~n <= 0); 924954#L26 call #t~ret0 := fact(~n - 1);< 924970#factENTRY ~n := #in~n; 924969#L25 assume !(~n <= 0); 924946#L26 call #t~ret0 := fact(~n - 1);< 924952#factENTRY ~n := #in~n; 924949#L25 assume !(~n <= 0); 924807#L26 call #t~ret0 := fact(~n - 1);< 924819#factENTRY ~n := #in~n; 924818#L25 assume !(~n <= 0); 924802#L26 call #t~ret0 := fact(~n - 1);< 924808#factENTRY ~n := #in~n; 924814#L25 assume ~n <= 0;#res := 1; 924813#factFINAL assume true; 924797#factEXIT >#66#return; 924804#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 925740#factFINAL assume true; 925732#factEXIT >#66#return; 925731#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 925707#factFINAL assume true; 925700#factEXIT >#66#return; 925702#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 926619#factFINAL assume true; 926615#factEXIT >#66#return; 924796#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 924790#factFINAL assume true; 924718#factEXIT >#66#return; 924748#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 929282#factFINAL assume true; 929278#factEXIT >#68#return; 924619#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 926253#factENTRY ~n := #in~n; 926555#L25 assume !(~n <= 0); 924741#L26 call #t~ret0 := fact(~n - 1);< 924905#factENTRY ~n := #in~n; 924904#L25 assume !(~n <= 0); 924744#L26 call #t~ret0 := fact(~n - 1);< 924809#factENTRY ~n := #in~n; 924814#L25 assume ~n <= 0;#res := 1; 924813#factFINAL assume true; 924797#factEXIT >#66#return; 924804#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 925740#factFINAL assume true; 925732#factEXIT >#66#return; 925735#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 926996#factFINAL assume true; 926760#factEXIT >#70#return; 925602#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 925785#factENTRY ~n := #in~n; 925766#L25 assume !(~n <= 0); 924935#L26 call #t~ret0 := fact(~n - 1);< 925592#factENTRY ~n := #in~n; 925590#L25 assume !(~n <= 0); 924822#L26 call #t~ret0 := fact(~n - 1);< 924830#factENTRY ~n := #in~n; 924826#L25 assume !(~n <= 0); 924800#L26 call #t~ret0 := fact(~n - 1);< 924817#factENTRY ~n := #in~n; 924814#L25 assume ~n <= 0;#res := 1; 924813#factFINAL assume true; 924797#factEXIT >#66#return; 924804#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 925740#factFINAL assume true; 925732#factEXIT >#66#return; 925731#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 925707#factFINAL assume true; 925700#factEXIT >#66#return; 925701#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 926992#factFINAL assume true; 926761#factEXIT >#72#return; 926783#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; 929394#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 929393#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 929392#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 929391#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; 925017#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 925084#factENTRY ~n := #in~n; 925082#L25 assume !(~n <= 0); 924725#L26 call #t~ret0 := fact(~n - 1);< 924993#factENTRY ~n := #in~n; 924984#L25 assume !(~n <= 0); 924954#L26 call #t~ret0 := fact(~n - 1);< 924970#factENTRY ~n := #in~n; 924969#L25 assume !(~n <= 0); 924946#L26 call #t~ret0 := fact(~n - 1);< 924952#factENTRY ~n := #in~n; 924949#L25 assume !(~n <= 0); 924807#L26 call #t~ret0 := fact(~n - 1);< 924819#factENTRY ~n := #in~n; 924818#L25 assume !(~n <= 0); 924802#L26 call #t~ret0 := fact(~n - 1);< 924808#factENTRY ~n := #in~n; 924814#L25 assume ~n <= 0;#res := 1; 924813#factFINAL assume true; 924797#factEXIT >#66#return; 924804#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 925740#factFINAL assume true; 925732#factEXIT >#66#return; 925731#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 925707#factFINAL assume true; 925700#factEXIT >#66#return; 925702#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 926619#factFINAL assume true; 926615#factEXIT >#66#return; 924796#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 924790#factFINAL assume true; 924718#factEXIT >#66#return; 924748#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 929282#factFINAL assume true; 929278#factEXIT >#68#return; 924575#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 926253#factENTRY ~n := #in~n; 926555#L25 assume !(~n <= 0); 924741#L26 call #t~ret0 := fact(~n - 1);< 924905#factENTRY ~n := #in~n; 924904#L25 assume !(~n <= 0); 924744#L26 call #t~ret0 := fact(~n - 1);< 924809#factENTRY ~n := #in~n; 924904#L25 assume !(~n <= 0); 924744#L26 call #t~ret0 := fact(~n - 1);< 924809#factENTRY ~n := #in~n; 924814#L25 assume ~n <= 0;#res := 1; 924813#factFINAL assume true; 924797#factEXIT >#66#return; 924804#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 925740#factFINAL assume true; 925732#factEXIT >#66#return; 925731#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 925707#factFINAL assume true; 925700#factEXIT >#66#return; 925703#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 926997#factFINAL assume true; 926751#factEXIT >#70#return; 925746#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 926180#factENTRY ~n := #in~n; 926178#L25 assume !(~n <= 0); 924832#L26 call #t~ret0 := fact(~n - 1);< 925763#factENTRY ~n := #in~n; 924837#L25 assume !(~n <= 0); 924799#L26 call #t~ret0 := fact(~n - 1);< 924829#factENTRY ~n := #in~n; 924814#L25 assume ~n <= 0;#res := 1; 924813#factFINAL assume true; 924797#factEXIT >#66#return; 924804#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 925740#factFINAL assume true; 925732#factEXIT >#66#return; 925734#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 927006#factFINAL assume true; 926683#factEXIT >#72#return; 926702#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; 929387#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 929385#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 929383#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 929382#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; 925040#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 925084#factENTRY ~n := #in~n; 925082#L25 assume !(~n <= 0); 924725#L26 call #t~ret0 := fact(~n - 1);< 924993#factENTRY ~n := #in~n; 924984#L25 assume !(~n <= 0); 924954#L26 call #t~ret0 := fact(~n - 1);< 924970#factENTRY ~n := #in~n; 924969#L25 assume !(~n <= 0); 924946#L26 call #t~ret0 := fact(~n - 1);< 924952#factENTRY ~n := #in~n; 924949#L25 assume !(~n <= 0); 924807#L26 call #t~ret0 := fact(~n - 1);< 924819#factENTRY ~n := #in~n; 924818#L25 assume !(~n <= 0); 924802#L26 call #t~ret0 := fact(~n - 1);< 924808#factENTRY ~n := #in~n; 924814#L25 assume ~n <= 0;#res := 1; 924813#factFINAL assume true; 924797#factEXIT >#66#return; 924804#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 925740#factFINAL assume true; 925732#factEXIT >#66#return; 925731#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 925707#factFINAL assume true; 925700#factEXIT >#66#return; 925702#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 926619#factFINAL assume true; 926615#factEXIT >#66#return; 924796#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 924790#factFINAL assume true; 924718#factEXIT >#66#return; 924748#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 929282#factFINAL assume true; 929278#factEXIT >#68#return; 924639#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 926253#factENTRY ~n := #in~n; 926555#L25 assume !(~n <= 0); 924741#L26 call #t~ret0 := fact(~n - 1);< 924905#factENTRY ~n := #in~n; 924904#L25 assume !(~n <= 0); 924744#L26 call #t~ret0 := fact(~n - 1);< 924809#factENTRY ~n := #in~n; 924904#L25 assume !(~n <= 0); 924744#L26 call #t~ret0 := fact(~n - 1);< 924809#factENTRY ~n := #in~n; 924904#L25 assume !(~n <= 0); 924744#L26 call #t~ret0 := fact(~n - 1);< 924809#factENTRY ~n := #in~n; 924814#L25 assume ~n <= 0;#res := 1; 924813#factFINAL assume true; 924797#factEXIT >#66#return; 924804#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 925740#factFINAL assume true; 925732#factEXIT >#66#return; 925731#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 925707#factFINAL assume true; 925700#factEXIT >#66#return; 925702#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 926619#factFINAL assume true; 926615#factEXIT >#66#return; 926617#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 926678#factFINAL assume true; 926676#factEXIT >#70#return; 925749#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 926180#factENTRY ~n := #in~n; 926178#L25 assume !(~n <= 0); 924832#L26 call #t~ret0 := fact(~n - 1);< 925763#factENTRY ~n := #in~n; 924874#L25 assume ~n <= 0;#res := 1; 926093#factFINAL assume true; 926085#factEXIT >#66#return; 926089#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 926492#factFINAL assume true; 926208#factEXIT >#72#return; 926235#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; 929379#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 929377#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 929375#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 929374#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; 925031#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 925084#factENTRY ~n := #in~n; 925082#L25 assume !(~n <= 0); 924725#L26 call #t~ret0 := fact(~n - 1);< 924993#factENTRY ~n := #in~n; 924984#L25 assume !(~n <= 0); 924954#L26 call #t~ret0 := fact(~n - 1);< 924970#factENTRY ~n := #in~n; 924969#L25 assume !(~n <= 0); 924946#L26 call #t~ret0 := fact(~n - 1);< 924952#factENTRY ~n := #in~n; 924949#L25 assume !(~n <= 0); 924807#L26 call #t~ret0 := fact(~n - 1);< 924819#factENTRY ~n := #in~n; 924818#L25 assume !(~n <= 0); 924802#L26 call #t~ret0 := fact(~n - 1);< 924808#factENTRY ~n := #in~n; 924814#L25 assume ~n <= 0;#res := 1; 924813#factFINAL assume true; 924797#factEXIT >#66#return; 924804#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 925740#factFINAL assume true; 925732#factEXIT >#66#return; 925731#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 925707#factFINAL assume true; 925700#factEXIT >#66#return; 925702#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 926619#factFINAL assume true; 926615#factEXIT >#66#return; 924796#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 924790#factFINAL assume true; 924718#factEXIT >#66#return; 924748#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 929282#factFINAL assume true; 929278#factEXIT >#68#return; 924711#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 926253#factENTRY ~n := #in~n; 926555#L25 assume !(~n <= 0); 924741#L26 call #t~ret0 := fact(~n - 1);< 924905#factENTRY ~n := #in~n; 924904#L25 assume !(~n <= 0); 924744#L26 call #t~ret0 := fact(~n - 1);< 924809#factENTRY ~n := #in~n; 924904#L25 assume !(~n <= 0); 924744#L26 call #t~ret0 := fact(~n - 1);< 924809#factENTRY ~n := #in~n; 924904#L25 assume !(~n <= 0); 924744#L26 call #t~ret0 := fact(~n - 1);< 924809#factENTRY ~n := #in~n; 924904#L25 assume !(~n <= 0); 924744#L26 call #t~ret0 := fact(~n - 1);< 924809#factENTRY ~n := #in~n; 924814#L25 assume ~n <= 0;#res := 1; 924813#factFINAL assume true; 924797#factEXIT >#66#return; 924804#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 925740#factFINAL assume true; 925732#factEXIT >#66#return; 925731#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 925707#factFINAL assume true; 925700#factEXIT >#66#return; 925702#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 926619#factFINAL assume true; 926615#factEXIT >#66#return; 924796#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 924790#factFINAL assume true; 924718#factEXIT >#66#return; 924717#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 924715#factFINAL assume true; 924556#factEXIT >#70#return; 924533#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 924552#factENTRY ~n := #in~n; 924554#L25 assume ~n <= 0;#res := 1; 924553#factFINAL assume true; 924490#factEXIT >#72#return; 924543#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; 929371#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 929369#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 929367#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 927925#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; 927777#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 927781#factENTRY ~n := #in~n; 927779#L25 assume !(~n <= 0); 927726#L26 call #t~ret0 := fact(~n - 1);< 927776#factENTRY ~n := #in~n; 927774#L25 assume !(~n <= 0); 927679#L26 call #t~ret0 := fact(~n - 1);< 927727#factENTRY ~n := #in~n; 927888#L25 assume !(~n <= 0); 927671#L26 call #t~ret0 := fact(~n - 1);< 927680#factENTRY ~n := #in~n; 927807#L25 assume !(~n <= 0); 927674#L26 call #t~ret0 := fact(~n - 1);< 927684#factENTRY ~n := #in~n; 927696#L25 assume !(~n <= 0); 927673#L26 call #t~ret0 := fact(~n - 1);< 927689#factENTRY ~n := #in~n; 927696#L25 assume !(~n <= 0); 927673#L26 call #t~ret0 := fact(~n - 1);< 927689#factENTRY ~n := #in~n; 927696#L25 assume !(~n <= 0); 927673#L26 call #t~ret0 := fact(~n - 1);< 927689#factENTRY ~n := #in~n; 927711#L25 assume ~n <= 0;#res := 1; 927708#factFINAL assume true; 927688#factEXIT >#66#return; 927687#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 927685#factFINAL assume true; 927683#factEXIT >#66#return; 927681#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 927678#factFINAL assume true; 927669#factEXIT >#66#return; 927675#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 927724#factFINAL assume true; 927718#factEXIT >#66#return; 927721#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 929018#factFINAL assume true; 929008#factEXIT >#66#return; 929006#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 929004#factFINAL assume true; 928996#factEXIT >#66#return; 928994#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 928995#factFINAL assume true; 928993#factEXIT >#66#return; 928992#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 928991#factFINAL assume true; 928959#factEXIT >#74#return; 928314#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 928327#factENTRY ~n := #in~n; 928330#L25 assume !(~n <= 0); 927298#L26 call #t~ret0 := fact(~n - 1);< 927318#factENTRY ~n := #in~n; 927316#L25 assume !(~n <= 0); 927266#L26 call #t~ret0 := fact(~n - 1);< 927300#factENTRY ~n := #in~n; 927309#L25 assume !(~n <= 0); 927267#L26 call #t~ret0 := fact(~n - 1);< 927308#factENTRY ~n := #in~n; 927309#L25 assume !(~n <= 0); 927267#L26 call #t~ret0 := fact(~n - 1);< 927308#factENTRY ~n := #in~n; 927309#L25 assume !(~n <= 0); 927267#L26 call #t~ret0 := fact(~n - 1);< 927308#factENTRY ~n := #in~n; 927309#L25 assume !(~n <= 0); 927267#L26 call #t~ret0 := fact(~n - 1);< 927308#factENTRY ~n := #in~n; 927314#L25 assume ~n <= 0;#res := 1; 927313#factFINAL assume true; 927304#factEXIT >#66#return; 927303#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 927288#factFINAL assume true; 927261#factEXIT >#66#return; 927280#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 927771#factFINAL assume true; 927759#factEXIT >#66#return; 927757#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 927746#factFINAL assume true; 927731#factEXIT >#66#return; 927733#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 927848#factFINAL assume true; 927843#factEXIT >#66#return; 927842#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 927841#factFINAL assume true; 927839#factEXIT >#66#return; 927546#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 929169#factFINAL assume true; 929167#factEXIT >#76#return; 927604#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 927609#factENTRY ~n := #in~n; 927607#L25 assume !(~n <= 0); 927597#L26 call #t~ret0 := fact(~n - 1);< 927599#factENTRY ~n := #in~n; 927608#L25 assume ~n <= 0;#res := 1; 927601#factFINAL assume true; 927595#factEXIT >#66#return; 927598#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 928413#factFINAL assume true; 928304#factEXIT >#78#return; 927051#L30-8 [2022-11-20 09:43:59,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:43:59,496 INFO L85 PathProgramCache]: Analyzing trace with hash 291195713, now seen corresponding path program 51 times [2022-11-20 09:43:59,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:43:59,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720719984] [2022-11-20 09:43:59,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:43:59,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:43:59,518 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:43:59,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1508934587] [2022-11-20 09:43:59,518 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 09:43:59,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:43:59,518 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:43:59,523 INFO L229 MonitoredProcess]: Starting monitored process 365 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:43:59,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (365)] Waiting until timeout for monitored process [2022-11-20 09:44:00,320 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-20 09:44:00,321 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:44:00,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 09:44:00,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:44:00,473 INFO L134 CoverageAnalysis]: Checked inductivity of 38477 backedges. 7117 proven. 48 refuted. 0 times theorem prover too weak. 31312 trivial. 0 not checked. [2022-11-20 09:44:00,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:44:01,176 INFO L134 CoverageAnalysis]: Checked inductivity of 38477 backedges. 391 proven. 48 refuted. 0 times theorem prover too weak. 38038 trivial. 0 not checked. [2022-11-20 09:44:01,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:44:01,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720719984] [2022-11-20 09:44:01,176 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 09:44:01,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508934587] [2022-11-20 09:44:01,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508934587] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:44:01,176 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:44:01,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2022-11-20 09:44:01,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414020793] [2022-11-20 09:44:01,177 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:44:01,177 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-20 09:44:01,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:44:01,178 INFO L85 PathProgramCache]: Analyzing trace with hash 558196595, now seen corresponding path program 46 times [2022-11-20 09:44:01,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:44:01,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885422229] [2022-11-20 09:44:01,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:44:01,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:44:01,197 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:44:01,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1841036749] [2022-11-20 09:44:01,197 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 09:44:01,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:44:01,198 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:44:01,203 INFO L229 MonitoredProcess]: Starting monitored process 366 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:44:01,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (366)] Waiting until timeout for monitored process [2022-11-20 09:44:02,144 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 09:44:02,144 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:44:02,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 1253 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-20 09:44:02,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:44:02,529 INFO L134 CoverageAnalysis]: Checked inductivity of 23407 backedges. 6602 proven. 145 refuted. 0 times theorem prover too weak. 16660 trivial. 0 not checked. [2022-11-20 09:44:02,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:44:05,601 INFO L134 CoverageAnalysis]: Checked inductivity of 23407 backedges. 2568 proven. 468 refuted. 0 times theorem prover too weak. 20371 trivial. 0 not checked. [2022-11-20 09:44:05,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:44:05,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885422229] [2022-11-20 09:44:05,602 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 09:44:05,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841036749] [2022-11-20 09:44:05,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841036749] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:44:05,602 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:44:05,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 24] total 25 [2022-11-20 09:44:05,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700371319] [2022-11-20 09:44:05,603 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:44:05,603 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 09:44:05,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:44:05,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-20 09:44:05,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2022-11-20 09:44:05,604 INFO L87 Difference]: Start difference. First operand 6842 states and 11162 transitions. cyclomatic complexity: 4389 Second operand has 25 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 25 states have internal predecessors, (79), 17 states have call successors, (33), 2 states have call predecessors, (33), 9 states have return successors, (38), 15 states have call predecessors, (38), 17 states have call successors, (38) [2022-11-20 09:44:08,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:44:08,134 INFO L93 Difference]: Finished difference Result 11652 states and 21818 transitions. [2022-11-20 09:44:08,134 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11652 states and 21818 transitions. [2022-11-20 09:44:08,220 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 3812 [2022-11-20 09:44:08,323 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11652 states to 11462 states and 21485 transitions. [2022-11-20 09:44:08,323 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 832 [2022-11-20 09:44:08,324 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 832 [2022-11-20 09:44:08,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11462 states and 21485 transitions. [2022-11-20 09:44:08,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 09:44:08,324 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11462 states and 21485 transitions. [2022-11-20 09:44:08,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11462 states and 21485 transitions. [2022-11-20 09:44:08,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11462 to 7332. [2022-11-20 09:44:08,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7332 states, 4474 states have (on average 1.0426911041573537) internal successors, (4665), 4462 states have internal predecessors, (4665), 2230 states have call successors, (2310), 723 states have call predecessors, (2310), 628 states have return successors, (5323), 2146 states have call predecessors, (5323), 2230 states have call successors, (5323) [2022-11-20 09:44:08,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7332 states to 7332 states and 12298 transitions. [2022-11-20 09:44:08,534 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7332 states and 12298 transitions. [2022-11-20 09:44:08,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-20 09:44:08,535 INFO L428 stractBuchiCegarLoop]: Abstraction has 7332 states and 12298 transitions. [2022-11-20 09:44:08,535 INFO L335 stractBuchiCegarLoop]: ======== Iteration 74 ============ [2022-11-20 09:44:08,535 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7332 states and 12298 transitions. [2022-11-20 09:44:08,558 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1564 [2022-11-20 09:44:08,558 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 09:44:08,558 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 09:44:08,561 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [128, 128, 77, 77, 77, 77, 51, 17, 16, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 7, 7, 7, 7, 7, 6, 6, 4, 3, 3, 1, 1, 1, 1] [2022-11-20 09:44:08,561 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [93, 93, 72, 72, 72, 72, 21, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:44:08,562 INFO L748 eck$LassoCheckResult]: Stem: 951356#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 951329#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; 951330#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 951355#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; 951377#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 954080#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 954079#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; 954071#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 954078#factENTRY ~n := #in~n; 954075#L25 assume ~n <= 0;#res := 1; 954076#factFINAL assume true; 954070#factEXIT >#68#return; 951371#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 951372#factENTRY ~n := #in~n; 955300#L25 assume ~n <= 0;#res := 1; 955298#factFINAL assume true; 955261#factEXIT >#70#return; 951286#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 951287#factENTRY ~n := #in~n; 957530#L25 assume ~n <= 0;#res := 1; 957529#factFINAL assume true; 957528#factEXIT >#72#return; 951347#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; 951348#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 951350#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 957889#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 957881#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; 951284#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 951285#factENTRY ~n := #in~n; 958181#L25 assume !(~n <= 0); 958178#L26 call #t~ret0 := fact(~n - 1);< 958179#factENTRY ~n := #in~n; 958182#L25 assume ~n <= 0;#res := 1; 958180#factFINAL assume true; 958177#factEXIT >#66#return; 958175#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 958172#factFINAL assume true; 958167#factEXIT >#74#return; 958163#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 958164#factENTRY ~n := #in~n; 958171#L25 assume ~n <= 0;#res := 1; 958166#factFINAL assume true; 958162#factEXIT >#76#return; 958159#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 958160#factENTRY ~n := #in~n; 958174#L25 assume !(~n <= 0); 958169#L26 call #t~ret0 := fact(~n - 1);< 958170#factENTRY ~n := #in~n; 958176#L25 assume ~n <= 0;#res := 1; 958173#factFINAL assume true; 958168#factEXIT >#66#return; 958165#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 958161#factFINAL assume true; 958158#factEXIT >#78#return; 958157#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; 958156#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 958155#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 958154#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 951358#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; 951359#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 957999#factENTRY ~n := #in~n; 958036#L25 assume !(~n <= 0); 951299#L26 call #t~ret0 := fact(~n - 1);< 958034#factENTRY ~n := #in~n; 958050#L25 assume !(~n <= 0); 951297#L26 call #t~ret0 := fact(~n - 1);< 958047#factENTRY ~n := #in~n; 958064#L25 assume ~n <= 0;#res := 1; 958063#factFINAL assume true; 958053#factEXIT >#66#return; 958049#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 958041#factFINAL assume true; 958031#factEXIT >#66#return; 958029#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 958027#factFINAL assume true; 957989#factEXIT >#74#return; 957995#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 957927#factENTRY ~n := #in~n; 958295#L25 assume ~n <= 0;#res := 1; 958294#factFINAL assume true; 958292#factEXIT >#76#return; 958231#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 958253#factENTRY ~n := #in~n; 958251#L25 assume !(~n <= 0); 957805#L26 call #t~ret0 := fact(~n - 1);< 958227#factENTRY ~n := #in~n; 958221#L25 assume !(~n <= 0); 957803#L26 call #t~ret0 := fact(~n - 1);< 958220#factENTRY ~n := #in~n; 958217#L25 assume ~n <= 0;#res := 1; 958210#factFINAL assume true; 958209#factEXIT >#66#return; 958204#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 958205#factFINAL assume true; 958190#factEXIT >#66#return; 958191#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 958506#factFINAL assume true; 958505#factEXIT >#78#return; 958504#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; 958503#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 958502#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 958501#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 957752#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; 957705#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 957706#factENTRY ~n := #in~n; 957720#L25 assume !(~n <= 0); 957713#L26 call #t~ret0 := fact(~n - 1);< 957730#factENTRY ~n := #in~n; 957731#L25 assume !(~n <= 0); 957714#L26 call #t~ret0 := fact(~n - 1);< 957726#factENTRY ~n := #in~n; 957731#L25 assume !(~n <= 0); 957714#L26 call #t~ret0 := fact(~n - 1);< 957726#factENTRY ~n := #in~n; 957735#L25 assume ~n <= 0;#res := 1; 957736#factFINAL assume true; 957732#factEXIT >#66#return; 957729#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 957727#factFINAL assume true; 957725#factEXIT >#66#return; 957721#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 957722#factFINAL assume true; 957712#factEXIT >#66#return; 957710#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 957711#factFINAL assume true; 957704#factEXIT >#74#return; 957700#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 957701#factENTRY ~n := #in~n; 957703#L25 assume ~n <= 0;#res := 1; 957702#factFINAL assume true; 957699#factEXIT >#76#return; 951361#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 957574#factENTRY ~n := #in~n; 957572#L25 assume !(~n <= 0); 957540#L26 call #t~ret0 := fact(~n - 1);< 957567#factENTRY ~n := #in~n; 957565#L25 assume !(~n <= 0); 957537#L26 call #t~ret0 := fact(~n - 1);< 957553#factENTRY ~n := #in~n; 957566#L25 assume !(~n <= 0); 957535#L26 call #t~ret0 := fact(~n - 1);< 957563#factENTRY ~n := #in~n; 957571#L25 assume ~n <= 0;#res := 1; 957564#factFINAL assume true; 957562#factEXIT >#66#return; 957560#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 957558#factFINAL assume true; 957556#factEXIT >#66#return; 957557#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 957550#factFINAL assume true; 957551#factEXIT >#66#return; 951360#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 951362#factFINAL assume true; 954285#factEXIT >#78#return; 954280#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; 954267#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 954230#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 954068#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 954067#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 951343#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 951344#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 956631#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; 954073#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 951312#factENTRY ~n := #in~n; 954111#L25 assume !(~n <= 0); 954092#L26 call #t~ret0 := fact(~n - 1);< 954103#factENTRY ~n := #in~n; 954104#L25 assume ~n <= 0;#res := 1; 954091#factFINAL assume true; 954093#factEXIT >#66#return; 954077#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 954072#factFINAL assume true; 954074#factEXIT >#68#return; 954145#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 954147#factENTRY ~n := #in~n; 954149#L25 assume ~n <= 0;#res := 1; 954148#factFINAL assume true; 954144#factEXIT >#70#return; 954133#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 954135#factENTRY ~n := #in~n; 954142#L25 assume !(~n <= 0); 954139#L26 call #t~ret0 := fact(~n - 1);< 954140#factENTRY ~n := #in~n; 954143#L25 assume ~n <= 0;#res := 1; 954141#factFINAL assume true; 954138#factEXIT >#66#return; 954137#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 954136#factFINAL assume true; 954131#factEXIT >#72#return; 954134#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; 956630#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 956629#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 956628#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 956627#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; 954089#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 954102#factENTRY ~n := #in~n; 954096#L25 assume !(~n <= 0); 954082#L26 call #t~ret0 := fact(~n - 1);< 954090#factENTRY ~n := #in~n; 954097#L25 assume ~n <= 0;#res := 1; 954098#factFINAL assume true; 954081#factEXIT >#66#return; 954086#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 954110#factFINAL assume true; 954109#factEXIT >#68#return; 954101#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 954107#factENTRY ~n := #in~n; 955271#L25 assume !(~n <= 0); 955269#L26 call #t~ret0 := fact(~n - 1);< 955270#factENTRY ~n := #in~n; 955273#L25 assume ~n <= 0;#res := 1; 955272#factFINAL assume true; 955268#factEXIT >#66#return; 955267#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 955266#factFINAL assume true; 955262#factEXIT >#70#return; 955263#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 956579#factENTRY ~n := #in~n; 956607#L25 assume ~n <= 0;#res := 1; 956606#factFINAL assume true; 956577#factEXIT >#72#return; 956578#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; 956668#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 956561#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 956556#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 956554#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; 956518#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 956521#factENTRY ~n := #in~n; 956640#L25 assume !(~n <= 0); 956636#L26 call #t~ret0 := fact(~n - 1);< 956637#factENTRY ~n := #in~n; 956710#L25 assume !(~n <= 0); 956635#L26 call #t~ret0 := fact(~n - 1);< 956705#factENTRY ~n := #in~n; 956713#L25 assume ~n <= 0;#res := 1; 956709#factFINAL assume true; 956704#factEXIT >#66#return; 956699#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 956696#factFINAL assume true; 956634#factEXIT >#66#return; 956632#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 956563#factFINAL assume true; 956517#factEXIT >#74#return; 956330#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 956300#factENTRY ~n := #in~n; 957113#L25 assume !(~n <= 0); 956798#L26 call #t~ret0 := fact(~n - 1);< 956805#factENTRY ~n := #in~n; 956892#L25 assume ~n <= 0;#res := 1; 956886#factFINAL assume true; 956797#factEXIT >#66#return; 956802#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 957169#factFINAL assume true; 957167#factEXIT >#76#return; 956293#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 956295#factENTRY ~n := #in~n; 956360#L25 assume !(~n <= 0); 956358#L26 call #t~ret0 := fact(~n - 1);< 956359#factENTRY ~n := #in~n; 956419#L25 assume ~n <= 0;#res := 1; 956405#factFINAL assume true; 956357#factEXIT >#66#return; 956356#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 956329#factFINAL assume true; 956292#factEXIT >#78#return; 956290#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; 956288#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 956286#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 956284#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 956280#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; 956281#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 957178#factENTRY ~n := #in~n; 957186#L25 assume !(~n <= 0); 957182#L26 call #t~ret0 := fact(~n - 1);< 957184#factENTRY ~n := #in~n; 957191#L25 assume !(~n <= 0); 957183#L26 call #t~ret0 := fact(~n - 1);< 957189#factENTRY ~n := #in~n; 957191#L25 assume !(~n <= 0); 957183#L26 call #t~ret0 := fact(~n - 1);< 957189#factENTRY ~n := #in~n; 957195#L25 assume ~n <= 0;#res := 1; 957194#factFINAL assume true; 957193#factEXIT >#66#return; 957192#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 957190#factFINAL assume true; 957188#factEXIT >#66#return; 957187#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 957185#factFINAL assume true; 957181#factEXIT >#66#return; 957180#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 957179#factFINAL assume true; 957177#factEXIT >#74#return; 956056#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 956080#factENTRY ~n := #in~n; 956077#L25 assume !(~n <= 0); 956048#L26 call #t~ret0 := fact(~n - 1);< 956051#factENTRY ~n := #in~n; 956072#L25 assume ~n <= 0;#res := 1; 956055#factFINAL assume true; 956047#factEXIT >#66#return; 956050#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 957218#factFINAL assume true; 957217#factEXIT >#76#return; 955944#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 955946#factENTRY ~n := #in~n; 955971#L25 assume !(~n <= 0); 955952#L26 call #t~ret0 := fact(~n - 1);< 955964#factENTRY ~n := #in~n; 956008#L25 assume !(~n <= 0); 955962#L26 call #t~ret0 := fact(~n - 1);< 956002#factENTRY ~n := #in~n; 955979#L25 assume ~n <= 0;#res := 1; 955977#factFINAL assume true; 955973#factEXIT >#66#return; 955972#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 955965#factFINAL assume true; 955951#factEXIT >#66#return; 955950#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 955948#factFINAL assume true; 955942#factEXIT >#78#return; 955941#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; 955888#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 955887#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 955885#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 951353#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 951354#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 953036#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 953579#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; 951980#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 951986#factENTRY ~n := #in~n; 952014#L25 assume !(~n <= 0); 952006#L26 call #t~ret0 := fact(~n - 1);< 952009#factENTRY ~n := #in~n; 952020#L25 assume !(~n <= 0); 952005#L26 call #t~ret0 := fact(~n - 1);< 952013#factENTRY ~n := #in~n; 952027#L25 assume ~n <= 0;#res := 1; 952026#factFINAL assume true; 952023#factEXIT >#66#return; 952019#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952012#factFINAL assume true; 952004#factEXIT >#66#return; 951997#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 951996#factFINAL assume true; 951979#factEXIT >#68#return; 951984#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 951975#factENTRY ~n := #in~n; 953593#L25 assume ~n <= 0;#res := 1; 953591#factFINAL assume true; 953576#factEXIT >#70#return; 953571#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 953574#factENTRY ~n := #in~n; 953592#L25 assume !(~n <= 0); 953588#L26 call #t~ret0 := fact(~n - 1);< 953590#factENTRY ~n := #in~n; 953680#L25 assume !(~n <= 0); 953587#L26 call #t~ret0 := fact(~n - 1);< 953684#factENTRY ~n := #in~n; 953603#L25 assume ~n <= 0;#res := 1; 953602#factFINAL assume true; 953598#factEXIT >#66#return; 953597#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 953594#factFINAL assume true; 953585#factEXIT >#66#return; 953584#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 953581#factFINAL assume true; 953570#factEXIT >#72#return; 953567#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; 953566#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 953558#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 953555#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 953554#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; 953438#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 953443#factENTRY ~n := #in~n; 953601#L25 assume !(~n <= 0); 953527#L26 call #t~ret0 := fact(~n - 1);< 953528#factENTRY ~n := #in~n; 953544#L25 assume !(~n <= 0); 953540#L26 call #t~ret0 := fact(~n - 1);< 953541#factENTRY ~n := #in~n; 953550#L25 assume ~n <= 0;#res := 1; 953543#factFINAL assume true; 953539#factEXIT >#66#return; 953537#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 953534#factFINAL assume true; 953526#factEXIT >#66#return; 953524#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 953523#factFINAL assume true; 953436#factEXIT >#68#return; 953442#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 953553#factENTRY ~n := #in~n; 953565#L25 assume !(~n <= 0); 953561#L26 call #t~ret0 := fact(~n - 1);< 953563#factENTRY ~n := #in~n; 953575#L25 assume ~n <= 0;#res := 1; 953568#factFINAL assume true; 953559#factEXIT >#66#return; 953562#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 953557#factFINAL assume true; 953552#factEXIT >#70#return; 953546#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 953549#factENTRY ~n := #in~n; 953564#L25 assume !(~n <= 0); 953560#L26 call #t~ret0 := fact(~n - 1);< 953563#factENTRY ~n := #in~n; 953575#L25 assume ~n <= 0;#res := 1; 953568#factFINAL assume true; 953559#factEXIT >#66#return; 953556#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 953551#factFINAL assume true; 953545#factEXIT >#72#return; 953542#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; 953538#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 953536#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 953533#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 953525#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; 953439#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 953443#factENTRY ~n := #in~n; 953601#L25 assume !(~n <= 0); 953527#L26 call #t~ret0 := fact(~n - 1);< 953528#factENTRY ~n := #in~n; 953544#L25 assume !(~n <= 0); 953540#L26 call #t~ret0 := fact(~n - 1);< 953541#factENTRY ~n := #in~n; 953550#L25 assume ~n <= 0;#res := 1; 953543#factFINAL assume true; 953539#factEXIT >#66#return; 953537#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 953534#factFINAL assume true; 953526#factEXIT >#66#return; 953524#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 953523#factFINAL assume true; 953436#factEXIT >#68#return; 953433#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 953435#factENTRY ~n := #in~n; 953502#L25 assume !(~n <= 0); 953380#L26 call #t~ret0 := fact(~n - 1);< 953384#factENTRY ~n := #in~n; 953494#L25 assume !(~n <= 0); 953427#L26 call #t~ret0 := fact(~n - 1);< 953429#factENTRY ~n := #in~n; 953475#L25 assume ~n <= 0;#res := 1; 953474#factFINAL assume true; 953426#factEXIT >#66#return; 953423#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 953417#factFINAL assume true; 953376#factEXIT >#66#return; 953383#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 953481#factFINAL assume true; 953432#factEXIT >#70#return; 953387#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 953390#factENTRY ~n := #in~n; 953479#L25 assume ~n <= 0;#res := 1; 953430#factFINAL assume true; 953386#factEXIT >#72#return; 953389#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; 953983#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 953981#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 953979#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 953977#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; 953266#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 953973#factENTRY ~n := #in~n; 953970#L25 assume !(~n <= 0); 953964#L26 call #t~ret0 := fact(~n - 1);< 953966#factENTRY ~n := #in~n; 953975#L25 assume !(~n <= 0); 953962#L26 call #t~ret0 := fact(~n - 1);< 953972#factENTRY ~n := #in~n; 953975#L25 assume !(~n <= 0); 953962#L26 call #t~ret0 := fact(~n - 1);< 953972#factENTRY ~n := #in~n; 953982#L25 assume ~n <= 0;#res := 1; 953980#factFINAL assume true; 953978#factEXIT >#66#return; 953976#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 953974#factFINAL assume true; 953971#factEXIT >#66#return; 953969#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 953967#factFINAL assume true; 953961#factEXIT >#66#return; 953965#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 954041#factFINAL assume true; 954034#factEXIT >#74#return; 954009#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 954014#factENTRY ~n := #in~n; 954012#L25 assume !(~n <= 0); 953889#L26 call #t~ret0 := fact(~n - 1);< 954010#factENTRY ~n := #in~n; 954021#L25 assume !(~n <= 0); 954016#L26 call #t~ret0 := fact(~n - 1);< 954017#factENTRY ~n := #in~n; 954025#L25 assume ~n <= 0;#res := 1; 954024#factFINAL assume true; 954015#factEXIT >#66#return; 954013#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 954008#factFINAL assume true; 953886#factEXIT >#66#return; 953899#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 954175#factFINAL assume true; 954173#factEXIT >#76#return; 954160#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 954162#factENTRY ~n := #in~n; 954171#L25 assume !(~n <= 0); 954168#L26 call #t~ret0 := fact(~n - 1);< 954169#factENTRY ~n := #in~n; 954172#L25 assume ~n <= 0;#res := 1; 954170#factFINAL assume true; 954167#factEXIT >#66#return; 954166#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 954164#factFINAL assume true; 954159#factEXIT >#78#return; 954153#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; 954069#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 953133#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 953132#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 953078#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 952738#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 952737#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 952246#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; 952062#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 952120#factENTRY ~n := #in~n; 952116#L25 assume !(~n <= 0); 952007#L26 call #t~ret0 := fact(~n - 1);< 952009#factENTRY ~n := #in~n; 952020#L25 assume !(~n <= 0); 952005#L26 call #t~ret0 := fact(~n - 1);< 952013#factENTRY ~n := #in~n; 952020#L25 assume !(~n <= 0); 952005#L26 call #t~ret0 := fact(~n - 1);< 952013#factENTRY ~n := #in~n; 952027#L25 assume ~n <= 0;#res := 1; 952026#factFINAL assume true; 952023#factEXIT >#66#return; 952019#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952012#factFINAL assume true; 952004#factEXIT >#66#return; 952008#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952405#factFINAL assume true; 952404#factEXIT >#66#return; 952401#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952400#factFINAL assume true; 952397#factEXIT >#68#return; 951972#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 951976#factENTRY ~n := #in~n; 951995#L25 assume ~n <= 0;#res := 1; 951978#factFINAL assume true; 951968#factEXIT >#70#return; 951974#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 952349#factENTRY ~n := #in~n; 952350#L25 assume !(~n <= 0); 952001#L26 call #t~ret0 := fact(~n - 1);< 952055#factENTRY ~n := #in~n; 952050#L25 assume !(~n <= 0); 951988#L26 call #t~ret0 := fact(~n - 1);< 952003#factENTRY ~n := #in~n; 952239#L25 assume !(~n <= 0); 952016#L26 call #t~ret0 := fact(~n - 1);< 952017#factENTRY ~n := #in~n; 952024#L25 assume ~n <= 0;#res := 1; 952021#factFINAL assume true; 952015#factEXIT >#66#return; 952011#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952000#factFINAL assume true; 951987#factEXIT >#66#return; 951993#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952403#factFINAL assume true; 952398#factEXIT >#66#return; 952396#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952395#factFINAL assume true; 952394#factEXIT >#72#return; 952392#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; 952390#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 952358#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 952359#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 952348#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; 952034#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 952051#factENTRY ~n := #in~n; 952042#L25 assume !(~n <= 0); 951897#L26 call #t~ret0 := fact(~n - 1);< 952029#factENTRY ~n := #in~n; 952028#L25 assume !(~n <= 0); 951821#L26 call #t~ret0 := fact(~n - 1);< 951828#factENTRY ~n := #in~n; 951829#L25 assume !(~n <= 0); 951814#L26 call #t~ret0 := fact(~n - 1);< 951822#factENTRY ~n := #in~n; 951825#L25 assume ~n <= 0;#res := 1; 951824#factFINAL assume true; 951811#factEXIT >#66#return; 951817#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952344#factFINAL assume true; 952338#factEXIT >#66#return; 952337#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952325#factFINAL assume true; 952320#factEXIT >#66#return; 952319#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952317#factFINAL assume true; 952310#factEXIT >#68#return; 952243#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 952245#factENTRY ~n := #in~n; 952296#L25 assume !(~n <= 0); 951831#L26 call #t~ret0 := fact(~n - 1);< 952255#factENTRY ~n := #in~n; 951885#L25 assume ~n <= 0;#res := 1; 952256#factFINAL assume true; 952249#factEXIT >#66#return; 952248#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952247#factFINAL assume true; 952242#factEXIT >#70#return; 951895#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 951902#factENTRY ~n := #in~n; 951900#L25 assume !(~n <= 0); 951820#L26 call #t~ret0 := fact(~n - 1);< 951896#factENTRY ~n := #in~n; 951829#L25 assume !(~n <= 0); 951814#L26 call #t~ret0 := fact(~n - 1);< 951822#factENTRY ~n := #in~n; 951825#L25 assume ~n <= 0;#res := 1; 951824#factFINAL assume true; 951811#factEXIT >#66#return; 951817#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952344#factFINAL assume true; 952338#factEXIT >#66#return; 952342#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952388#factFINAL assume true; 952382#factEXIT >#72#return; 952381#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; 952379#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 952377#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 952376#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 952375#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; 952032#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 952051#factENTRY ~n := #in~n; 952042#L25 assume !(~n <= 0); 951897#L26 call #t~ret0 := fact(~n - 1);< 952029#factENTRY ~n := #in~n; 952028#L25 assume !(~n <= 0); 951821#L26 call #t~ret0 := fact(~n - 1);< 951828#factENTRY ~n := #in~n; 951829#L25 assume !(~n <= 0); 951814#L26 call #t~ret0 := fact(~n - 1);< 951822#factENTRY ~n := #in~n; 951825#L25 assume ~n <= 0;#res := 1; 951824#factFINAL assume true; 951811#factEXIT >#66#return; 951817#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952344#factFINAL assume true; 952338#factEXIT >#66#return; 952337#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952325#factFINAL assume true; 952320#factEXIT >#66#return; 952319#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952317#factFINAL assume true; 952310#factEXIT >#68#return; 952313#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 952364#factENTRY ~n := #in~n; 952367#L25 assume !(~n <= 0); 951832#L26 call #t~ret0 := fact(~n - 1);< 951838#factENTRY ~n := #in~n; 951836#L25 assume !(~n <= 0); 951812#L26 call #t~ret0 := fact(~n - 1);< 951830#factENTRY ~n := #in~n; 951825#L25 assume ~n <= 0;#res := 1; 951824#factFINAL assume true; 951811#factEXIT >#66#return; 951817#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952344#factFINAL assume true; 952338#factEXIT >#66#return; 952343#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952365#factFINAL assume true; 952363#factEXIT >#70#return; 952347#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 952351#factENTRY ~n := #in~n; 952345#L25 assume !(~n <= 0); 952250#L26 call #t~ret0 := fact(~n - 1);< 952294#factENTRY ~n := #in~n; 951885#L25 assume ~n <= 0;#res := 1; 952256#factFINAL assume true; 952249#factEXIT >#66#return; 952253#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952378#factFINAL assume true; 952373#factEXIT >#72#return; 952372#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; 952370#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 952369#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 952368#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 952366#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; 952031#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 952051#factENTRY ~n := #in~n; 952042#L25 assume !(~n <= 0); 951897#L26 call #t~ret0 := fact(~n - 1);< 952029#factENTRY ~n := #in~n; 952028#L25 assume !(~n <= 0); 951821#L26 call #t~ret0 := fact(~n - 1);< 951828#factENTRY ~n := #in~n; 951829#L25 assume !(~n <= 0); 951814#L26 call #t~ret0 := fact(~n - 1);< 951822#factENTRY ~n := #in~n; 951825#L25 assume ~n <= 0;#res := 1; 951824#factFINAL assume true; 951811#factEXIT >#66#return; 951817#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952344#factFINAL assume true; 952338#factEXIT >#66#return; 952337#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952325#factFINAL assume true; 952320#factEXIT >#66#return; 952319#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952317#factFINAL assume true; 952310#factEXIT >#68#return; 952311#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 952364#factENTRY ~n := #in~n; 952367#L25 assume !(~n <= 0); 951832#L26 call #t~ret0 := fact(~n - 1);< 951838#factENTRY ~n := #in~n; 951836#L25 assume !(~n <= 0); 951812#L26 call #t~ret0 := fact(~n - 1);< 951830#factENTRY ~n := #in~n; 951829#L25 assume !(~n <= 0); 951814#L26 call #t~ret0 := fact(~n - 1);< 951822#factENTRY ~n := #in~n; 951825#L25 assume ~n <= 0;#res := 1; 951824#factFINAL assume true; 951811#factEXIT >#66#return; 951817#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952344#factFINAL assume true; 952338#factEXIT >#66#return; 952337#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952325#factFINAL assume true; 952320#factEXIT >#66#return; 952324#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952642#factFINAL assume true; 952639#factEXIT >#70#return; 951467#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 952636#factENTRY ~n := #in~n; 951465#L25 assume ~n <= 0;#res := 1; 951468#factFINAL assume true; 952634#factEXIT >#72#return; 952635#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; 955106#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 955103#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 955099#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 955094#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; 952594#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 955060#factENTRY ~n := #in~n; 955079#L25 assume !(~n <= 0); 955070#L26 call #t~ret0 := fact(~n - 1);< 955077#factENTRY ~n := #in~n; 955227#L25 assume !(~n <= 0); 955068#L26 call #t~ret0 := fact(~n - 1);< 955097#factENTRY ~n := #in~n; 955143#L25 assume !(~n <= 0); 955074#L26 call #t~ret0 := fact(~n - 1);< 955131#factENTRY ~n := #in~n; 955143#L25 assume !(~n <= 0); 955074#L26 call #t~ret0 := fact(~n - 1);< 955131#factENTRY ~n := #in~n; 955145#L25 assume ~n <= 0;#res := 1; 955141#factFINAL assume true; 955130#factEXIT >#66#return; 955127#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 955124#factFINAL assume true; 955111#factEXIT >#66#return; 955104#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 955100#factFINAL assume true; 955095#factEXIT >#66#return; 955092#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 955085#factFINAL assume true; 955067#factEXIT >#66#return; 955066#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 955065#factFINAL assume true; 955059#factEXIT >#74#return; 954530#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 955051#factENTRY ~n := #in~n; 954969#L25 assume !(~n <= 0); 954402#L26 call #t~ret0 := fact(~n - 1);< 954412#factENTRY ~n := #in~n; 954410#L25 assume !(~n <= 0); 954311#L26 call #t~ret0 := fact(~n - 1);< 954400#factENTRY ~n := #in~n; 954397#L25 assume !(~n <= 0); 954310#L26 call #t~ret0 := fact(~n - 1);< 954352#factENTRY ~n := #in~n; 954347#L25 assume !(~n <= 0); 954341#L26 call #t~ret0 := fact(~n - 1);< 954343#factENTRY ~n := #in~n; 954348#L25 assume ~n <= 0;#res := 1; 954345#factFINAL assume true; 954340#factEXIT >#66#return; 954339#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 954333#factFINAL assume true; 954307#factEXIT >#66#return; 954327#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 954529#factFINAL assume true; 954526#factEXIT >#66#return; 954525#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 954524#factFINAL assume true; 954518#factEXIT >#66#return; 954520#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 955721#factFINAL assume true; 955722#factEXIT >#76#return; 951335#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 951378#factENTRY ~n := #in~n; 955304#L25 assume !(~n <= 0); 951321#L26 call #t~ret0 := fact(~n - 1);< 951320#factENTRY ~n := #in~n; 951323#L25 assume ~n <= 0;#res := 1; 955622#factFINAL assume true; 955619#factEXIT >#66#return; 955620#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 955840#factFINAL assume true; 955839#factEXIT >#78#return; 953050#L30-8 [2022-11-20 09:44:08,562 INFO L750 eck$LassoCheckResult]: Loop: 953050#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; 955834#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 955830#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 955827#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 955824#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 955535#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 955534#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 955425#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; 952546#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 952651#factENTRY ~n := #in~n; 952543#L25 assume !(~n <= 0); 952522#L26 call #t~ret0 := fact(~n - 1);< 952535#factENTRY ~n := #in~n; 952521#L25 assume !(~n <= 0); 952460#L26 call #t~ret0 := fact(~n - 1);< 952530#factENTRY ~n := #in~n; 952527#L25 assume !(~n <= 0); 952457#L26 call #t~ret0 := fact(~n - 1);< 952526#factENTRY ~n := #in~n; 952524#L25 assume !(~n <= 0); 952456#L26 call #t~ret0 := fact(~n - 1);< 952472#factENTRY ~n := #in~n; 952525#L25 assume !(~n <= 0); 952459#L26 call #t~ret0 := fact(~n - 1);< 952517#factENTRY ~n := #in~n; 952519#L25 assume ~n <= 0;#res := 1; 952518#factFINAL assume true; 952516#factEXIT >#66#return; 952515#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952513#factFINAL assume true; 952511#factEXIT >#66#return; 952493#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952490#factFINAL assume true; 952471#factEXIT >#66#return; 952466#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952464#factFINAL assume true; 952453#factEXIT >#66#return; 952462#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952821#factFINAL assume true; 952819#factEXIT >#66#return; 952818#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952817#factFINAL assume true; 952816#factEXIT >#68#return; 952427#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 952439#factENTRY ~n := #in~n; 952441#L25 assume ~n <= 0;#res := 1; 952440#factFINAL assume true; 952416#factEXIT >#70#return; 952409#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 952443#factENTRY ~n := #in~n; 952444#L25 assume !(~n <= 0); 952355#L26 call #t~ret0 := fact(~n - 1);< 952406#factENTRY ~n := #in~n; 952407#L25 assume !(~n <= 0); 952059#L26 call #t~ret0 := fact(~n - 1);< 952356#factENTRY ~n := #in~n; 952308#L25 assume !(~n <= 0); 952002#L26 call #t~ret0 := fact(~n - 1);< 952055#factENTRY ~n := #in~n; 952050#L25 assume !(~n <= 0); 951988#L26 call #t~ret0 := fact(~n - 1);< 952003#factENTRY ~n := #in~n; 952239#L25 assume !(~n <= 0); 952016#L26 call #t~ret0 := fact(~n - 1);< 952017#factENTRY ~n := #in~n; 952024#L25 assume ~n <= 0;#res := 1; 952021#factFINAL assume true; 952015#factEXIT >#66#return; 952011#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952000#factFINAL assume true; 951987#factEXIT >#66#return; 951993#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952403#factFINAL assume true; 952398#factEXIT >#66#return; 952399#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952708#factFINAL assume true; 952706#factEXIT >#66#return; 952707#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 953072#factFINAL assume true; 953070#factEXIT >#66#return; 953071#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 953077#factFINAL assume true; 953073#factEXIT >#72#return; 953075#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; 955399#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 955398#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 955396#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 955393#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; 952102#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 952122#factENTRY ~n := #in~n; 952118#L25 assume !(~n <= 0); 952044#L26 call #t~ret0 := fact(~n - 1);< 952056#factENTRY ~n := #in~n; 952052#L25 assume !(~n <= 0); 951790#L26 call #t~ret0 := fact(~n - 1);< 952039#factENTRY ~n := #in~n; 952037#L25 assume !(~n <= 0); 951898#L26 call #t~ret0 := fact(~n - 1);< 952029#factENTRY ~n := #in~n; 952028#L25 assume !(~n <= 0); 951821#L26 call #t~ret0 := fact(~n - 1);< 951828#factENTRY ~n := #in~n; 951829#L25 assume !(~n <= 0); 951814#L26 call #t~ret0 := fact(~n - 1);< 951822#factENTRY ~n := #in~n; 951825#L25 assume ~n <= 0;#res := 1; 951824#factFINAL assume true; 951811#factEXIT >#66#return; 951817#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952344#factFINAL assume true; 952338#factEXIT >#66#return; 952337#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952325#factFINAL assume true; 952320#factEXIT >#66#return; 951810#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 951804#factFINAL assume true; 951764#factEXIT >#66#return; 951795#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952815#factFINAL assume true; 952811#factEXIT >#66#return; 952813#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 953011#factFINAL assume true; 953010#factEXIT >#68#return; 952274#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 952357#factENTRY ~n := #in~n; 952384#L25 assume !(~n <= 0); 952251#L26 call #t~ret0 := fact(~n - 1);< 952294#factENTRY ~n := #in~n; 951885#L25 assume ~n <= 0;#res := 1; 952256#factFINAL assume true; 952249#factEXIT >#66#return; 952254#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952733#factFINAL assume true; 952731#factEXIT >#70#return; 952046#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 952057#factENTRY ~n := #in~n; 952053#L25 assume !(~n <= 0); 951774#L26 call #t~ret0 := fact(~n - 1);< 952039#factENTRY ~n := #in~n; 952037#L25 assume !(~n <= 0); 951898#L26 call #t~ret0 := fact(~n - 1);< 952029#factENTRY ~n := #in~n; 952028#L25 assume !(~n <= 0); 951821#L26 call #t~ret0 := fact(~n - 1);< 951828#factENTRY ~n := #in~n; 951829#L25 assume !(~n <= 0); 951814#L26 call #t~ret0 := fact(~n - 1);< 951822#factENTRY ~n := #in~n; 951825#L25 assume ~n <= 0;#res := 1; 951824#factFINAL assume true; 951811#factEXIT >#66#return; 951817#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952344#factFINAL assume true; 952338#factEXIT >#66#return; 952337#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952325#factFINAL assume true; 952320#factEXIT >#66#return; 951810#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 951804#factFINAL assume true; 951764#factEXIT >#66#return; 951796#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 953125#factFINAL assume true; 953126#factEXIT >#72#return; 954263#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; 955388#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 955386#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 955383#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 955380#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; 952080#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 952122#factENTRY ~n := #in~n; 952118#L25 assume !(~n <= 0); 952044#L26 call #t~ret0 := fact(~n - 1);< 952056#factENTRY ~n := #in~n; 952052#L25 assume !(~n <= 0); 951790#L26 call #t~ret0 := fact(~n - 1);< 952039#factENTRY ~n := #in~n; 952037#L25 assume !(~n <= 0); 951898#L26 call #t~ret0 := fact(~n - 1);< 952029#factENTRY ~n := #in~n; 952028#L25 assume !(~n <= 0); 951821#L26 call #t~ret0 := fact(~n - 1);< 951828#factENTRY ~n := #in~n; 951829#L25 assume !(~n <= 0); 951814#L26 call #t~ret0 := fact(~n - 1);< 951822#factENTRY ~n := #in~n; 951825#L25 assume ~n <= 0;#res := 1; 951824#factFINAL assume true; 951811#factEXIT >#66#return; 951817#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952344#factFINAL assume true; 952338#factEXIT >#66#return; 952337#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952325#factFINAL assume true; 952320#factEXIT >#66#return; 951810#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 951804#factFINAL assume true; 951764#factEXIT >#66#return; 951795#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952815#factFINAL assume true; 952811#factEXIT >#66#return; 952813#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 953011#factFINAL assume true; 953010#factEXIT >#68#return; 951639#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 952468#factENTRY ~n := #in~n; 952467#L25 assume !(~n <= 0); 951777#L26 call #t~ret0 := fact(~n - 1);< 951888#factENTRY ~n := #in~n; 951887#L25 assume !(~n <= 0); 951780#L26 call #t~ret0 := fact(~n - 1);< 951818#factENTRY ~n := #in~n; 951825#L25 assume ~n <= 0;#res := 1; 951824#factFINAL assume true; 951811#factEXIT >#66#return; 951817#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952344#factFINAL assume true; 952338#factEXIT >#66#return; 952339#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 954184#factFINAL assume true; 954182#factEXIT >#70#return; 952333#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 952647#factENTRY ~n := #in~n; 952646#L25 assume !(~n <= 0); 951792#L26 call #t~ret0 := fact(~n - 1);< 952326#factENTRY ~n := #in~n; 952645#L25 assume !(~n <= 0); 951833#L26 call #t~ret0 := fact(~n - 1);< 951838#factENTRY ~n := #in~n; 951836#L25 assume !(~n <= 0); 951812#L26 call #t~ret0 := fact(~n - 1);< 951830#factENTRY ~n := #in~n; 951825#L25 assume ~n <= 0;#res := 1; 951824#factFINAL assume true; 951811#factEXIT >#66#return; 951817#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952344#factFINAL assume true; 952338#factEXIT >#66#return; 952337#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952325#factFINAL assume true; 952320#factEXIT >#66#return; 952321#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 953109#factFINAL assume true; 953086#factEXIT >#72#return; 953087#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; 955376#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 955374#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 955371#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 955368#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; 952095#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 952122#factENTRY ~n := #in~n; 952118#L25 assume !(~n <= 0); 952044#L26 call #t~ret0 := fact(~n - 1);< 952056#factENTRY ~n := #in~n; 952052#L25 assume !(~n <= 0); 951790#L26 call #t~ret0 := fact(~n - 1);< 952039#factENTRY ~n := #in~n; 952037#L25 assume !(~n <= 0); 951898#L26 call #t~ret0 := fact(~n - 1);< 952029#factENTRY ~n := #in~n; 952028#L25 assume !(~n <= 0); 951821#L26 call #t~ret0 := fact(~n - 1);< 951828#factENTRY ~n := #in~n; 951829#L25 assume !(~n <= 0); 951814#L26 call #t~ret0 := fact(~n - 1);< 951822#factENTRY ~n := #in~n; 951825#L25 assume ~n <= 0;#res := 1; 951824#factFINAL assume true; 951811#factEXIT >#66#return; 951817#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952344#factFINAL assume true; 952338#factEXIT >#66#return; 952337#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952325#factFINAL assume true; 952320#factEXIT >#66#return; 951810#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 951804#factFINAL assume true; 951764#factEXIT >#66#return; 951795#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952815#factFINAL assume true; 952811#factEXIT >#66#return; 952813#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 953011#factFINAL assume true; 953010#factEXIT >#68#return; 951494#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 952468#factENTRY ~n := #in~n; 952467#L25 assume !(~n <= 0); 951777#L26 call #t~ret0 := fact(~n - 1);< 951888#factENTRY ~n := #in~n; 951887#L25 assume !(~n <= 0); 951780#L26 call #t~ret0 := fact(~n - 1);< 951818#factENTRY ~n := #in~n; 951887#L25 assume !(~n <= 0); 951780#L26 call #t~ret0 := fact(~n - 1);< 951818#factENTRY ~n := #in~n; 951825#L25 assume ~n <= 0;#res := 1; 951824#factFINAL assume true; 951811#factEXIT >#66#return; 951817#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952344#factFINAL assume true; 952338#factEXIT >#66#return; 952337#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952325#factFINAL assume true; 952320#factEXIT >#66#return; 952323#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 954183#factFINAL assume true; 954177#factEXIT >#70#return; 952270#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 952318#factENTRY ~n := #in~n; 952315#L25 assume !(~n <= 0); 951788#L26 call #t~ret0 := fact(~n - 1);< 952271#factENTRY ~n := #in~n; 951843#L25 assume !(~n <= 0); 951813#L26 call #t~ret0 := fact(~n - 1);< 951839#factENTRY ~n := #in~n; 951825#L25 assume ~n <= 0;#res := 1; 951824#factFINAL assume true; 951811#factEXIT >#66#return; 951817#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952344#factFINAL assume true; 952338#factEXIT >#66#return; 952340#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952993#factFINAL assume true; 952920#factEXIT >#72#return; 952943#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; 955364#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 955361#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 955358#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 955355#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; 952092#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 952122#factENTRY ~n := #in~n; 952118#L25 assume !(~n <= 0); 952044#L26 call #t~ret0 := fact(~n - 1);< 952056#factENTRY ~n := #in~n; 952052#L25 assume !(~n <= 0); 951790#L26 call #t~ret0 := fact(~n - 1);< 952039#factENTRY ~n := #in~n; 952037#L25 assume !(~n <= 0); 951898#L26 call #t~ret0 := fact(~n - 1);< 952029#factENTRY ~n := #in~n; 952028#L25 assume !(~n <= 0); 951821#L26 call #t~ret0 := fact(~n - 1);< 951828#factENTRY ~n := #in~n; 951829#L25 assume !(~n <= 0); 951814#L26 call #t~ret0 := fact(~n - 1);< 951822#factENTRY ~n := #in~n; 951825#L25 assume ~n <= 0;#res := 1; 951824#factFINAL assume true; 951811#factEXIT >#66#return; 951817#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952344#factFINAL assume true; 952338#factEXIT >#66#return; 952337#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952325#factFINAL assume true; 952320#factEXIT >#66#return; 951810#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 951804#factFINAL assume true; 951764#factEXIT >#66#return; 951795#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952815#factFINAL assume true; 952811#factEXIT >#66#return; 952813#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 953011#factFINAL assume true; 953010#factEXIT >#68#return; 951579#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 952468#factENTRY ~n := #in~n; 952467#L25 assume !(~n <= 0); 951777#L26 call #t~ret0 := fact(~n - 1);< 951888#factENTRY ~n := #in~n; 951887#L25 assume !(~n <= 0); 951780#L26 call #t~ret0 := fact(~n - 1);< 951818#factENTRY ~n := #in~n; 951887#L25 assume !(~n <= 0); 951780#L26 call #t~ret0 := fact(~n - 1);< 951818#factENTRY ~n := #in~n; 951887#L25 assume !(~n <= 0); 951780#L26 call #t~ret0 := fact(~n - 1);< 951818#factENTRY ~n := #in~n; 951825#L25 assume ~n <= 0;#res := 1; 951824#factFINAL assume true; 951811#factEXIT >#66#return; 951817#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952344#factFINAL assume true; 952338#factEXIT >#66#return; 952337#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952325#factFINAL assume true; 952320#factEXIT >#66#return; 951810#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 951804#factFINAL assume true; 951764#factEXIT >#66#return; 951798#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952845#factFINAL assume true; 951474#factEXIT >#70#return; 951716#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 952318#factENTRY ~n := #in~n; 952315#L25 assume !(~n <= 0); 951788#L26 call #t~ret0 := fact(~n - 1);< 952271#factENTRY ~n := #in~n; 951885#L25 assume ~n <= 0;#res := 1; 952256#factFINAL assume true; 952249#factEXIT >#66#return; 952252#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952903#factFINAL assume true; 952866#factEXIT >#72#return; 952886#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; 955348#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 955347#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 955346#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 955345#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; 952109#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 952122#factENTRY ~n := #in~n; 952118#L25 assume !(~n <= 0); 952044#L26 call #t~ret0 := fact(~n - 1);< 952056#factENTRY ~n := #in~n; 952052#L25 assume !(~n <= 0); 951790#L26 call #t~ret0 := fact(~n - 1);< 952039#factENTRY ~n := #in~n; 952037#L25 assume !(~n <= 0); 951898#L26 call #t~ret0 := fact(~n - 1);< 952029#factENTRY ~n := #in~n; 952028#L25 assume !(~n <= 0); 951821#L26 call #t~ret0 := fact(~n - 1);< 951828#factENTRY ~n := #in~n; 951829#L25 assume !(~n <= 0); 951814#L26 call #t~ret0 := fact(~n - 1);< 951822#factENTRY ~n := #in~n; 951825#L25 assume ~n <= 0;#res := 1; 951824#factFINAL assume true; 951811#factEXIT >#66#return; 951817#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952344#factFINAL assume true; 952338#factEXIT >#66#return; 952337#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952325#factFINAL assume true; 952320#factEXIT >#66#return; 951810#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 951804#factFINAL assume true; 951764#factEXIT >#66#return; 951795#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952815#factFINAL assume true; 952811#factEXIT >#66#return; 952813#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 953011#factFINAL assume true; 953010#factEXIT >#68#return; 951641#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 952468#factENTRY ~n := #in~n; 952467#L25 assume !(~n <= 0); 951777#L26 call #t~ret0 := fact(~n - 1);< 951888#factENTRY ~n := #in~n; 951887#L25 assume !(~n <= 0); 951780#L26 call #t~ret0 := fact(~n - 1);< 951818#factENTRY ~n := #in~n; 951887#L25 assume !(~n <= 0); 951780#L26 call #t~ret0 := fact(~n - 1);< 951818#factENTRY ~n := #in~n; 951887#L25 assume !(~n <= 0); 951780#L26 call #t~ret0 := fact(~n - 1);< 951818#factENTRY ~n := #in~n; 951887#L25 assume !(~n <= 0); 951780#L26 call #t~ret0 := fact(~n - 1);< 951818#factENTRY ~n := #in~n; 951825#L25 assume ~n <= 0;#res := 1; 951824#factFINAL assume true; 951811#factEXIT >#66#return; 951817#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952344#factFINAL assume true; 952338#factEXIT >#66#return; 952337#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952325#factFINAL assume true; 952320#factEXIT >#66#return; 951810#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 951804#factFINAL assume true; 951764#factEXIT >#66#return; 951795#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952815#factFINAL assume true; 952811#factEXIT >#66#return; 952814#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 952846#factFINAL assume true; 952844#factEXIT >#70#return; 951411#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 951463#factENTRY ~n := #in~n; 952644#L25 assume ~n <= 0;#res := 1; 951464#factFINAL assume true; 951383#factEXIT >#72#return; 951456#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; 955338#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 955337#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 955336#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 955319#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; 955185#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 955196#factENTRY ~n := #in~n; 955192#L25 assume !(~n <= 0); 955170#L26 call #t~ret0 := fact(~n - 1);< 955180#factENTRY ~n := #in~n; 955177#L25 assume !(~n <= 0); 955071#L26 call #t~ret0 := fact(~n - 1);< 955166#factENTRY ~n := #in~n; 955155#L25 assume !(~n <= 0); 955069#L26 call #t~ret0 := fact(~n - 1);< 955147#factENTRY ~n := #in~n; 955142#L25 assume !(~n <= 0); 955075#L26 call #t~ret0 := fact(~n - 1);< 955097#factENTRY ~n := #in~n; 955143#L25 assume !(~n <= 0); 955074#L26 call #t~ret0 := fact(~n - 1);< 955131#factENTRY ~n := #in~n; 955145#L25 assume ~n <= 0;#res := 1; 955141#factFINAL assume true; 955130#factEXIT >#66#return; 955127#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 955124#factFINAL assume true; 955111#factEXIT >#66#return; 955104#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 955100#factFINAL assume true; 955095#factEXIT >#66#return; 955092#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 955085#factFINAL assume true; 955067#factEXIT >#66#return; 955076#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 955286#factFINAL assume true; 955276#factEXIT >#66#return; 955275#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 955274#factFINAL assume true; 955259#factEXIT >#74#return; 954420#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 955023#factENTRY ~n := #in~n; 954905#L25 assume !(~n <= 0); 954335#L26 call #t~ret0 := fact(~n - 1);< 954367#factENTRY ~n := #in~n; 954350#L25 assume !(~n <= 0); 954312#L26 call #t~ret0 := fact(~n - 1);< 954338#factENTRY ~n := #in~n; 954346#L25 assume !(~n <= 0); 954316#L26 call #t~ret0 := fact(~n - 1);< 954342#factENTRY ~n := #in~n; 954346#L25 assume !(~n <= 0); 954316#L26 call #t~ret0 := fact(~n - 1);< 954342#factENTRY ~n := #in~n; 954346#L25 assume !(~n <= 0); 954316#L26 call #t~ret0 := fact(~n - 1);< 954342#factENTRY ~n := #in~n; 954346#L25 assume !(~n <= 0); 954316#L26 call #t~ret0 := fact(~n - 1);< 954342#factENTRY ~n := #in~n; 954348#L25 assume ~n <= 0;#res := 1; 954345#factFINAL assume true; 954340#factEXIT >#66#return; 954339#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 954333#factFINAL assume true; 954307#factEXIT >#66#return; 954327#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 954529#factFINAL assume true; 954526#factEXIT >#66#return; 954525#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 954524#factFINAL assume true; 954518#factEXIT >#66#return; 954516#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 954514#factFINAL assume true; 954511#factEXIT >#66#return; 954510#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 954509#factFINAL assume true; 954503#factEXIT >#66#return; 954478#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 955774#factFINAL assume true; 955773#factEXIT >#76#return; 953045#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 953054#factENTRY ~n := #in~n; 955303#L25 assume !(~n <= 0); 951322#L26 call #t~ret0 := fact(~n - 1);< 951320#factENTRY ~n := #in~n; 951323#L25 assume ~n <= 0;#res := 1; 955622#factFINAL assume true; 955619#factEXIT >#66#return; 955621#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 955670#factFINAL assume true; 953044#factEXIT >#78#return; 953050#L30-8 [2022-11-20 09:44:08,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:44:08,563 INFO L85 PathProgramCache]: Analyzing trace with hash 478774201, now seen corresponding path program 52 times [2022-11-20 09:44:08,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:44:08,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555835355] [2022-11-20 09:44:08,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:44:08,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:44:08,588 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:44:08,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [100824043] [2022-11-20 09:44:08,588 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 09:44:08,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:44:08,589 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:44:08,595 INFO L229 MonitoredProcess]: Starting monitored process 367 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:44:08,597 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (367)] Waiting until timeout for monitored process [2022-11-20 09:44:09,571 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 09:44:09,571 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:44:09,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 1819 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-20 09:44:09,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:44:10,066 INFO L134 CoverageAnalysis]: Checked inductivity of 39137 backedges. 7095 proven. 298 refuted. 0 times theorem prover too weak. 31744 trivial. 0 not checked. [2022-11-20 09:44:10,066 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:44:11,108 INFO L134 CoverageAnalysis]: Checked inductivity of 39137 backedges. 89 proven. 512 refuted. 0 times theorem prover too weak. 38536 trivial. 0 not checked. [2022-11-20 09:44:11,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:44:11,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555835355] [2022-11-20 09:44:11,108 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 09:44:11,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100824043] [2022-11-20 09:44:11,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100824043] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:44:11,109 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:44:11,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2022-11-20 09:44:11,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009089465] [2022-11-20 09:44:11,109 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:44:11,109 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-20 09:44:11,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:44:11,110 INFO L85 PathProgramCache]: Analyzing trace with hash 2101173811, now seen corresponding path program 47 times [2022-11-20 09:44:11,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:44:11,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793304500] [2022-11-20 09:44:11,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:44:11,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:44:11,138 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:44:11,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [281771894] [2022-11-20 09:44:11,139 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-20 09:44:11,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:44:11,139 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:44:11,142 INFO L229 MonitoredProcess]: Starting monitored process 368 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:44:11,144 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (368)] Waiting until timeout for monitored process [2022-11-20 09:44:13,096 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 37 check-sat command(s) [2022-11-20 09:44:13,096 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:44:13,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 1229 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-20 09:44:13,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:44:13,539 INFO L134 CoverageAnalysis]: Checked inductivity of 22369 backedges. 3445 proven. 1911 refuted. 0 times theorem prover too weak. 17013 trivial. 0 not checked. [2022-11-20 09:44:13,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:44:17,264 INFO L134 CoverageAnalysis]: Checked inductivity of 22369 backedges. 2579 proven. 2051 refuted. 0 times theorem prover too weak. 17739 trivial. 0 not checked. [2022-11-20 09:44:17,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:44:17,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793304500] [2022-11-20 09:44:17,264 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 09:44:17,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281771894] [2022-11-20 09:44:17,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281771894] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:44:17,264 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:44:17,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 29] total 32 [2022-11-20 09:44:17,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734618037] [2022-11-20 09:44:17,265 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:44:17,266 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 09:44:17,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:44:17,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-20 09:44:17,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=845, Unknown=0, NotChecked=0, Total=992 [2022-11-20 09:44:17,266 INFO L87 Difference]: Start difference. First operand 7332 states and 12298 transitions. cyclomatic complexity: 5035 Second operand has 32 states, 29 states have (on average 2.793103448275862) internal successors, (81), 32 states have internal predecessors, (81), 19 states have call successors, (27), 2 states have call predecessors, (27), 14 states have return successors, (35), 15 states have call predecessors, (35), 19 states have call successors, (35) [2022-11-20 09:44:19,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:44:19,959 INFO L93 Difference]: Finished difference Result 7848 states and 13326 transitions. [2022-11-20 09:44:19,959 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7848 states and 13326 transitions. [2022-11-20 09:44:20,012 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1472 [2022-11-20 09:44:20,081 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7848 states to 7712 states and 13131 transitions. [2022-11-20 09:44:20,081 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 672 [2022-11-20 09:44:20,082 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 684 [2022-11-20 09:44:20,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7712 states and 13131 transitions. [2022-11-20 09:44:20,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 09:44:20,082 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7712 states and 13131 transitions. [2022-11-20 09:44:20,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7712 states and 13131 transitions. [2022-11-20 09:44:20,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7712 to 6972. [2022-11-20 09:44:20,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6972 states, 4246 states have (on average 1.0447479981158738) internal successors, (4436), 4234 states have internal predecessors, (4436), 2098 states have call successors, (2178), 732 states have call predecessors, (2178), 628 states have return successors, (5035), 2005 states have call predecessors, (5035), 2098 states have call successors, (5035) [2022-11-20 09:44:20,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6972 states to 6972 states and 11649 transitions. [2022-11-20 09:44:20,236 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6972 states and 11649 transitions. [2022-11-20 09:44:20,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-20 09:44:20,236 INFO L428 stractBuchiCegarLoop]: Abstraction has 6972 states and 11649 transitions. [2022-11-20 09:44:20,236 INFO L335 stractBuchiCegarLoop]: ======== Iteration 75 ============ [2022-11-20 09:44:20,236 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6972 states and 11649 transitions. [2022-11-20 09:44:20,257 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1291 [2022-11-20 09:44:20,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 09:44:20,257 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 09:44:20,260 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [127, 127, 76, 76, 76, 76, 51, 17, 16, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 7, 7, 7, 7, 7, 6, 6, 4, 3, 3, 1, 1, 1, 1] [2022-11-20 09:44:20,260 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [92, 92, 71, 71, 71, 71, 21, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:44:20,260 INFO L748 eck$LassoCheckResult]: Stem: 974945#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 974911#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; 974912#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 974944#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; 974929#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 974930#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 979954#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; 974893#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 974894#factENTRY ~n := #in~n; 980649#L25 assume ~n <= 0;#res := 1; 980644#factFINAL assume true; 980643#factEXIT >#68#return; 974965#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 974966#factENTRY ~n := #in~n; 979968#L25 assume ~n <= 0;#res := 1; 979967#factFINAL assume true; 979966#factEXIT >#70#return; 974877#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 974878#factENTRY ~n := #in~n; 980723#L25 assume ~n <= 0;#res := 1; 980722#factFINAL assume true; 980720#factEXIT >#72#return; 980721#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; 974935#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 974936#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 981080#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 981078#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; 974875#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 974876#factENTRY ~n := #in~n; 981414#L25 assume !(~n <= 0); 981410#L26 call #t~ret0 := fact(~n - 1);< 981411#factENTRY ~n := #in~n; 981416#L25 assume ~n <= 0;#res := 1; 981413#factFINAL assume true; 981409#factEXIT >#66#return; 981408#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 981407#factFINAL assume true; 981403#factEXIT >#74#return; 981386#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 981387#factENTRY ~n := #in~n; 981402#L25 assume ~n <= 0;#res := 1; 981401#factFINAL assume true; 981385#factEXIT >#76#return; 981377#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 981378#factENTRY ~n := #in~n; 981396#L25 assume !(~n <= 0); 981394#L26 call #t~ret0 := fact(~n - 1);< 981395#factENTRY ~n := #in~n; 981400#L25 assume ~n <= 0;#res := 1; 981399#factFINAL assume true; 981393#factEXIT >#66#return; 981392#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 981384#factFINAL assume true; 981376#factEXIT >#78#return; 981372#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; 981366#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 981364#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 981362#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 981355#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; 981132#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 981140#factENTRY ~n := #in~n; 981157#L25 assume !(~n <= 0); 981147#L26 call #t~ret0 := fact(~n - 1);< 981151#factENTRY ~n := #in~n; 981271#L25 assume !(~n <= 0); 981146#L26 call #t~ret0 := fact(~n - 1);< 981270#factENTRY ~n := #in~n; 981422#L25 assume ~n <= 0;#res := 1; 981421#factFINAL assume true; 981420#factEXIT >#66#return; 981419#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 981418#factFINAL assume true; 981144#factEXIT >#66#return; 981142#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 981141#factFINAL assume true; 981130#factEXIT >#74#return; 981137#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 981129#factENTRY ~n := #in~n; 981623#L25 assume ~n <= 0;#res := 1; 981621#factFINAL assume true; 981617#factEXIT >#76#return; 981608#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 981615#factENTRY ~n := #in~n; 981613#L25 assume !(~n <= 0); 981573#L26 call #t~ret0 := fact(~n - 1);< 981603#factENTRY ~n := #in~n; 981599#L25 assume !(~n <= 0); 981574#L26 call #t~ret0 := fact(~n - 1);< 981598#factENTRY ~n := #in~n; 981595#L25 assume ~n <= 0;#res := 1; 981596#factFINAL assume true; 981580#factEXIT >#66#return; 981578#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 981571#factFINAL assume true; 981575#factEXIT >#66#return; 981641#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 981657#factFINAL assume true; 981656#factEXIT >#78#return; 981654#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; 981652#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 981651#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 981650#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 981648#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; 980771#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 980950#factENTRY ~n := #in~n; 980949#L25 assume !(~n <= 0); 980774#L26 call #t~ret0 := fact(~n - 1);< 980905#factENTRY ~n := #in~n; 980939#L25 assume !(~n <= 0); 980775#L26 call #t~ret0 := fact(~n - 1);< 980803#factENTRY ~n := #in~n; 980939#L25 assume !(~n <= 0); 980775#L26 call #t~ret0 := fact(~n - 1);< 980803#factENTRY ~n := #in~n; 980940#L25 assume ~n <= 0;#res := 1; 980935#factFINAL assume true; 980936#factEXIT >#66#return; 980951#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 980930#factFINAL assume true; 980800#factEXIT >#66#return; 980801#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 980773#factFINAL assume true; 980776#factEXIT >#66#return; 980955#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 980954#factFINAL assume true; 980859#factEXIT >#74#return; 980834#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 980835#factENTRY ~n := #in~n; 980839#L25 assume ~n <= 0;#res := 1; 980837#factFINAL assume true; 980833#factEXIT >#76#return; 974950#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 980831#factENTRY ~n := #in~n; 980830#L25 assume !(~n <= 0); 980786#L26 call #t~ret0 := fact(~n - 1);< 980827#factENTRY ~n := #in~n; 980890#L25 assume !(~n <= 0); 980793#L26 call #t~ret0 := fact(~n - 1);< 980806#factENTRY ~n := #in~n; 980893#L25 assume !(~n <= 0); 980792#L26 call #t~ret0 := fact(~n - 1);< 980888#factENTRY ~n := #in~n; 980892#L25 assume ~n <= 0;#res := 1; 980891#factFINAL assume true; 980887#factEXIT >#66#return; 980886#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 980883#factFINAL assume true; 980882#factEXIT >#66#return; 980880#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 980879#factFINAL assume true; 980851#factEXIT >#66#return; 974949#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 974951#factFINAL assume true; 980856#factEXIT >#78#return; 974976#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; 974975#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 974974#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 974973#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 974943#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 974931#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 974932#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 975865#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; 975857#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 975858#factENTRY ~n := #in~n; 975875#L25 assume !(~n <= 0); 975872#L26 call #t~ret0 := fact(~n - 1);< 975873#factENTRY ~n := #in~n; 975876#L25 assume ~n <= 0;#res := 1; 975874#factFINAL assume true; 975871#factEXIT >#66#return; 975868#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 975864#factFINAL assume true; 975855#factEXIT >#68#return; 975850#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 975852#factENTRY ~n := #in~n; 975862#L25 assume ~n <= 0;#res := 1; 975854#factFINAL assume true; 975849#factEXIT >#70#return; 975846#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 975847#factENTRY ~n := #in~n; 975863#L25 assume !(~n <= 0); 975860#L26 call #t~ret0 := fact(~n - 1);< 975861#factENTRY ~n := #in~n; 975869#L25 assume ~n <= 0;#res := 1; 975867#factFINAL assume true; 975859#factEXIT >#66#return; 975853#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 975848#factFINAL assume true; 975844#factEXIT >#72#return; 975842#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; 975839#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 975835#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 975826#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 975823#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; 975819#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 975821#factENTRY ~n := #in~n; 975837#L25 assume !(~n <= 0); 975828#L26 call #t~ret0 := fact(~n - 1);< 975833#factENTRY ~n := #in~n; 975840#L25 assume ~n <= 0;#res := 1; 975836#factFINAL assume true; 975827#factEXIT >#66#return; 975824#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 975822#factFINAL assume true; 975818#factEXIT >#68#return; 975812#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 975816#factENTRY ~n := #in~n; 975900#L25 assume !(~n <= 0); 975890#L26 call #t~ret0 := fact(~n - 1);< 975892#factENTRY ~n := #in~n; 975902#L25 assume ~n <= 0;#res := 1; 975901#factFINAL assume true; 975889#factEXIT >#66#return; 975891#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 975883#factFINAL assume true; 975884#factEXIT >#70#return; 975800#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 975804#factENTRY ~n := #in~n; 975906#L25 assume ~n <= 0;#res := 1; 975907#factFINAL assume true; 975799#factEXIT >#72#return; 975802#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; 975791#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 975792#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 975783#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 975784#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; 975779#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 975774#factENTRY ~n := #in~n; 976904#L25 assume !(~n <= 0); 976902#L26 call #t~ret0 := fact(~n - 1);< 976903#factENTRY ~n := #in~n; 976913#L25 assume !(~n <= 0); 976901#L26 call #t~ret0 := fact(~n - 1);< 976910#factENTRY ~n := #in~n; 976917#L25 assume ~n <= 0;#res := 1; 976912#factFINAL assume true; 976909#factEXIT >#66#return; 976906#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 976905#factFINAL assume true; 976900#factEXIT >#66#return; 976899#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 975778#factFINAL assume true; 975780#factEXIT >#74#return; 975685#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 975686#factENTRY ~n := #in~n; 976692#L25 assume !(~n <= 0); 976429#L26 call #t~ret0 := fact(~n - 1);< 976436#factENTRY ~n := #in~n; 976452#L25 assume ~n <= 0;#res := 1; 976445#factFINAL assume true; 976428#factEXIT >#66#return; 976433#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977655#factFINAL assume true; 975683#factEXIT >#76#return; 975678#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 975681#factENTRY ~n := #in~n; 976681#L25 assume !(~n <= 0); 976678#L26 call #t~ret0 := fact(~n - 1);< 976679#factENTRY ~n := #in~n; 976682#L25 assume ~n <= 0;#res := 1; 976680#factFINAL assume true; 976677#factEXIT >#66#return; 976676#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 976637#factFINAL assume true; 975677#factEXIT >#78#return; 975675#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; 975673#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 975671#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 975668#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 975664#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; 975535#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 975538#factENTRY ~n := #in~n; 975601#L25 assume !(~n <= 0); 975598#L26 call #t~ret0 := fact(~n - 1);< 975600#factENTRY ~n := #in~n; 975611#L25 assume !(~n <= 0); 975599#L26 call #t~ret0 := fact(~n - 1);< 975609#factENTRY ~n := #in~n; 975611#L25 assume !(~n <= 0); 975599#L26 call #t~ret0 := fact(~n - 1);< 975609#factENTRY ~n := #in~n; 975638#L25 assume ~n <= 0;#res := 1; 975637#factFINAL assume true; 975634#factEXIT >#66#return; 975632#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 975631#factFINAL assume true; 975608#factEXIT >#66#return; 975606#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 975603#factFINAL assume true; 975597#factEXIT >#66#return; 975595#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 975541#factFINAL assume true; 975533#factEXIT >#74#return; 975434#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 975437#factENTRY ~n := #in~n; 975531#L25 assume !(~n <= 0); 975532#L26 call #t~ret0 := fact(~n - 1);< 975557#factENTRY ~n := #in~n; 975577#L25 assume ~n <= 0;#res := 1; 975576#factFINAL assume true; 975555#factEXIT >#66#return; 975554#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 975485#factFINAL assume true; 975432#factEXIT >#76#return; 975398#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 975401#factENTRY ~n := #in~n; 976639#L25 assume !(~n <= 0); 975490#L26 call #t~ret0 := fact(~n - 1);< 975499#factENTRY ~n := #in~n; 975614#L25 assume !(~n <= 0); 975497#L26 call #t~ret0 := fact(~n - 1);< 975546#factENTRY ~n := #in~n; 975596#L25 assume ~n <= 0;#res := 1; 975594#factFINAL assume true; 975544#factEXIT >#66#return; 975542#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 975528#factFINAL assume true; 975521#factEXIT >#66#return; 975525#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 975808#factFINAL assume true; 975397#factEXIT >#78#return; 975400#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; 975878#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 975877#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 975797#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 975798#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 975790#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 975787#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 975786#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; 975329#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 975335#factENTRY ~n := #in~n; 975360#L25 assume !(~n <= 0); 975355#L26 call #t~ret0 := fact(~n - 1);< 975358#factENTRY ~n := #in~n; 975370#L25 assume !(~n <= 0); 975354#L26 call #t~ret0 := fact(~n - 1);< 975369#factENTRY ~n := #in~n; 975378#L25 assume ~n <= 0;#res := 1; 975376#factFINAL assume true; 975372#factEXIT >#66#return; 975371#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 975368#factFINAL assume true; 975353#factEXIT >#66#return; 975352#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 975345#factFINAL assume true; 975328#factEXIT >#68#return; 975333#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 975323#factENTRY ~n := #in~n; 979691#L25 assume ~n <= 0;#res := 1; 979690#factFINAL assume true; 979685#factEXIT >#70#return; 979680#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 979683#factENTRY ~n := #in~n; 979701#L25 assume !(~n <= 0); 979697#L26 call #t~ret0 := fact(~n - 1);< 979699#factENTRY ~n := #in~n; 979741#L25 assume !(~n <= 0); 979696#L26 call #t~ret0 := fact(~n - 1);< 979740#factENTRY ~n := #in~n; 979739#L25 assume ~n <= 0;#res := 1; 979738#factFINAL assume true; 979734#factEXIT >#66#return; 979731#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 979711#factFINAL assume true; 979694#factEXIT >#66#return; 979693#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 979692#factFINAL assume true; 979679#factEXIT >#72#return; 979682#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; 979688#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 979684#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 979678#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 979676#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; 979650#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 979654#factENTRY ~n := #in~n; 979755#L25 assume !(~n <= 0); 979752#L26 call #t~ret0 := fact(~n - 1);< 979753#factENTRY ~n := #in~n; 979763#L25 assume !(~n <= 0); 979761#L26 call #t~ret0 := fact(~n - 1);< 979762#factENTRY ~n := #in~n; 979765#L25 assume ~n <= 0;#res := 1; 979764#factFINAL assume true; 979760#factEXIT >#66#return; 979759#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 979757#factFINAL assume true; 979751#factEXIT >#66#return; 979749#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 979747#factFINAL assume true; 979647#factEXIT >#68#return; 979653#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 979670#factENTRY ~n := #in~n; 979707#L25 assume !(~n <= 0); 979704#L26 call #t~ret0 := fact(~n - 1);< 979706#factENTRY ~n := #in~n; 979710#L25 assume ~n <= 0;#res := 1; 979708#factFINAL assume true; 979702#factEXIT >#66#return; 979700#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 979672#factFINAL assume true; 979669#factEXIT >#70#return; 979665#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 979668#factENTRY ~n := #in~n; 979709#L25 assume !(~n <= 0); 979703#L26 call #t~ret0 := fact(~n - 1);< 979706#factENTRY ~n := #in~n; 979710#L25 assume ~n <= 0;#res := 1; 979708#factFINAL assume true; 979702#factEXIT >#66#return; 979705#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 979745#factFINAL assume true; 979664#factEXIT >#72#return; 979667#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; 979756#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 979754#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 979750#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 979748#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; 979651#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 979654#factENTRY ~n := #in~n; 979755#L25 assume !(~n <= 0); 979752#L26 call #t~ret0 := fact(~n - 1);< 979753#factENTRY ~n := #in~n; 979763#L25 assume !(~n <= 0); 979761#L26 call #t~ret0 := fact(~n - 1);< 979762#factENTRY ~n := #in~n; 979765#L25 assume ~n <= 0;#res := 1; 979764#factFINAL assume true; 979760#factEXIT >#66#return; 979759#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 979757#factFINAL assume true; 979751#factEXIT >#66#return; 979749#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 979747#factFINAL assume true; 979647#factEXIT >#68#return; 979598#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 979645#factENTRY ~n := #in~n; 979945#L25 assume !(~n <= 0); 979567#L26 call #t~ret0 := fact(~n - 1);< 979600#factENTRY ~n := #in~n; 980642#L25 assume !(~n <= 0); 979612#L26 call #t~ret0 := fact(~n - 1);< 979613#factENTRY ~n := #in~n; 979622#L25 assume ~n <= 0;#res := 1; 979620#factFINAL assume true; 979611#factEXIT >#66#return; 979610#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 979597#factFINAL assume true; 979565#factEXIT >#66#return; 979571#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 979758#factFINAL assume true; 979644#factEXIT >#70#return; 979639#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 979642#factENTRY ~n := #in~n; 979767#L25 assume ~n <= 0;#res := 1; 979766#factFINAL assume true; 979638#factEXIT >#72#return; 979641#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; 980251#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 980240#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 979970#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 978408#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; 978406#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 978407#factENTRY ~n := #in~n; 978890#L25 assume !(~n <= 0); 978887#L26 call #t~ret0 := fact(~n - 1);< 978888#factENTRY ~n := #in~n; 978927#L25 assume !(~n <= 0); 978894#L26 call #t~ret0 := fact(~n - 1);< 978903#factENTRY ~n := #in~n; 978927#L25 assume !(~n <= 0); 978894#L26 call #t~ret0 := fact(~n - 1);< 978903#factENTRY ~n := #in~n; 979127#L25 assume ~n <= 0;#res := 1; 978954#factFINAL assume true; 978936#factEXIT >#66#return; 978932#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 978926#factFINAL assume true; 978901#factEXIT >#66#return; 978902#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 978893#factFINAL assume true; 978896#factEXIT >#66#return; 978882#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 978879#factFINAL assume true; 978880#factEXIT >#74#return; 978168#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 979995#factENTRY ~n := #in~n; 979993#L25 assume !(~n <= 0); 977883#L26 call #t~ret0 := fact(~n - 1);< 978524#factENTRY ~n := #in~n; 980601#L25 assume !(~n <= 0); 977914#L26 call #t~ret0 := fact(~n - 1);< 977916#factENTRY ~n := #in~n; 977930#L25 assume ~n <= 0;#res := 1; 977929#factFINAL assume true; 977913#factEXIT >#66#return; 977911#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977909#factFINAL assume true; 977872#factEXIT >#66#return; 977892#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 979925#factFINAL assume true; 978167#factEXIT >#76#return; 977685#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 978415#factENTRY ~n := #in~n; 978413#L25 assume !(~n <= 0); 978382#L26 call #t~ret0 := fact(~n - 1);< 978383#factENTRY ~n := #in~n; 980471#L25 assume ~n <= 0;#res := 1; 980470#factFINAL assume true; 978381#factEXIT >#66#return; 978376#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 978375#factFINAL assume true; 977684#factEXIT >#78#return; 977683#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; 977682#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 977681#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 977680#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 977679#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 977678#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 977677#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 977676#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; 975382#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 975391#factENTRY ~n := #in~n; 975387#L25 assume !(~n <= 0); 975356#L26 call #t~ret0 := fact(~n - 1);< 975358#factENTRY ~n := #in~n; 975370#L25 assume !(~n <= 0); 975354#L26 call #t~ret0 := fact(~n - 1);< 975369#factENTRY ~n := #in~n; 975370#L25 assume !(~n <= 0); 975354#L26 call #t~ret0 := fact(~n - 1);< 975369#factENTRY ~n := #in~n; 975378#L25 assume ~n <= 0;#res := 1; 975376#factFINAL assume true; 975372#factEXIT >#66#return; 975371#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 975368#factFINAL assume true; 975353#factEXIT >#66#return; 975357#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 976930#factFINAL assume true; 976929#factEXIT >#66#return; 976928#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 976926#factFINAL assume true; 975785#factEXIT >#68#return; 975317#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 975324#factENTRY ~n := #in~n; 975344#L25 assume ~n <= 0;#res := 1; 975327#factFINAL assume true; 975316#factEXIT >#70#return; 975321#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 976685#factENTRY ~n := #in~n; 977289#L25 assume !(~n <= 0); 975348#L26 call #t~ret0 := fact(~n - 1);< 975663#factENTRY ~n := #in~n; 975662#L25 assume !(~n <= 0); 975341#L26 call #t~ret0 := fact(~n - 1);< 975350#factENTRY ~n := #in~n; 976674#L25 assume !(~n <= 0); 975364#L26 call #t~ret0 := fact(~n - 1);< 975389#factENTRY ~n := #in~n; 975385#L25 assume ~n <= 0;#res := 1; 975380#factFINAL assume true; 975363#factEXIT >#66#return; 975362#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 975347#factFINAL assume true; 975336#factEXIT >#66#return; 975342#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977630#factFINAL assume true; 977286#factEXIT >#66#return; 977284#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977283#factFINAL assume true; 977280#factEXIT >#72#return; 977281#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; 977675#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 977674#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 977673#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 977672#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; 977000#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 977006#factENTRY ~n := #in~n; 977034#L25 assume !(~n <= 0); 975249#L26 call #t~ret0 := fact(~n - 1);< 976997#factENTRY ~n := #in~n; 976998#L25 assume !(~n <= 0); 975238#L26 call #t~ret0 := fact(~n - 1);< 975246#factENTRY ~n := #in~n; 975245#L25 assume !(~n <= 0); 975228#L26 call #t~ret0 := fact(~n - 1);< 975240#factENTRY ~n := #in~n; 975244#L25 assume ~n <= 0;#res := 1; 975243#factFINAL assume true; 975225#factEXIT >#66#return; 975233#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977042#factFINAL assume true; 977036#factEXIT >#66#return; 977035#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977023#factFINAL assume true; 977009#factEXIT >#66#return; 977008#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977007#factFINAL assume true; 976999#factEXIT >#68#return; 976936#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 976938#factENTRY ~n := #in~n; 976992#L25 assume !(~n <= 0); 975235#L26 call #t~ret0 := fact(~n - 1);< 976949#factENTRY ~n := #in~n; 976993#L25 assume ~n <= 0;#res := 1; 976950#factFINAL assume true; 976941#factEXIT >#66#return; 976940#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 976939#factFINAL assume true; 976935#factEXIT >#70#return; 975252#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 975257#factENTRY ~n := #in~n; 975255#L25 assume !(~n <= 0); 975239#L26 call #t~ret0 := fact(~n - 1);< 975253#factENTRY ~n := #in~n; 975245#L25 assume !(~n <= 0); 975228#L26 call #t~ret0 := fact(~n - 1);< 975240#factENTRY ~n := #in~n; 975244#L25 assume ~n <= 0;#res := 1; 975243#factFINAL assume true; 975225#factEXIT >#66#return; 975233#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977042#factFINAL assume true; 977036#factEXIT >#66#return; 977040#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977849#factFINAL assume true; 977670#factEXIT >#72#return; 977671#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; 977958#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 977957#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 977956#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 977953#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; 977004#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 977006#factENTRY ~n := #in~n; 977034#L25 assume !(~n <= 0); 975249#L26 call #t~ret0 := fact(~n - 1);< 976997#factENTRY ~n := #in~n; 976998#L25 assume !(~n <= 0); 975238#L26 call #t~ret0 := fact(~n - 1);< 975246#factENTRY ~n := #in~n; 975245#L25 assume !(~n <= 0); 975228#L26 call #t~ret0 := fact(~n - 1);< 975240#factENTRY ~n := #in~n; 975244#L25 assume ~n <= 0;#res := 1; 975243#factFINAL assume true; 975225#factEXIT >#66#return; 975233#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977042#factFINAL assume true; 977036#factEXIT >#66#return; 977035#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977023#factFINAL assume true; 977009#factEXIT >#66#return; 977008#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977007#factFINAL assume true; 976999#factEXIT >#68#return; 975179#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 975176#factENTRY ~n := #in~n; 977712#L25 assume !(~n <= 0); 975236#L26 call #t~ret0 := fact(~n - 1);< 977024#factENTRY ~n := #in~n; 980716#L25 assume !(~n <= 0); 975231#L26 call #t~ret0 := fact(~n - 1);< 975234#factENTRY ~n := #in~n; 975244#L25 assume ~n <= 0;#res := 1; 975243#factFINAL assume true; 975225#factEXIT >#66#return; 975233#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977042#factFINAL assume true; 977036#factEXIT >#66#return; 975184#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 975177#factFINAL assume true; 975181#factEXIT >#70#return; 977569#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 977570#factENTRY ~n := #in~n; 977667#L25 assume !(~n <= 0); 976944#L26 call #t~ret0 := fact(~n - 1);< 976955#factENTRY ~n := #in~n; 976993#L25 assume ~n <= 0;#res := 1; 976950#factFINAL assume true; 976941#factEXIT >#66#return; 976948#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977663#factFINAL assume true; 977661#factEXIT >#72#return; 977662#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; 980753#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 980751#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 980749#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 980747#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; 977001#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 977006#factENTRY ~n := #in~n; 977034#L25 assume !(~n <= 0); 975249#L26 call #t~ret0 := fact(~n - 1);< 976997#factENTRY ~n := #in~n; 976998#L25 assume !(~n <= 0); 975238#L26 call #t~ret0 := fact(~n - 1);< 975246#factENTRY ~n := #in~n; 975245#L25 assume !(~n <= 0); 975228#L26 call #t~ret0 := fact(~n - 1);< 975240#factENTRY ~n := #in~n; 975244#L25 assume ~n <= 0;#res := 1; 975243#factFINAL assume true; 975225#factEXIT >#66#return; 975233#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977042#factFINAL assume true; 977036#factEXIT >#66#return; 977035#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977023#factFINAL assume true; 977009#factEXIT >#66#return; 977008#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977007#factFINAL assume true; 976999#factEXIT >#68#return; 975175#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 975176#factENTRY ~n := #in~n; 977712#L25 assume !(~n <= 0); 975236#L26 call #t~ret0 := fact(~n - 1);< 977024#factENTRY ~n := #in~n; 980716#L25 assume !(~n <= 0); 975231#L26 call #t~ret0 := fact(~n - 1);< 975234#factENTRY ~n := #in~n; 975244#L25 assume ~n <= 0;#res := 1; 975243#factFINAL assume true; 975225#factEXIT >#66#return; 975233#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977042#factFINAL assume true; 977036#factEXIT >#66#return; 975184#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 975177#factFINAL assume true; 975181#factEXIT >#70#return; 974983#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 977652#factENTRY ~n := #in~n; 977708#L25 assume ~n <= 0;#res := 1; 977651#factFINAL assume true; 974981#factEXIT >#72#return; 974984#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; 979156#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 979154#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 979152#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 979149#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; 979147#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 979148#factENTRY ~n := #in~n; 979172#L25 assume !(~n <= 0); 979164#L26 call #t~ret0 := fact(~n - 1);< 979170#factENTRY ~n := #in~n; 979297#L25 assume !(~n <= 0); 979163#L26 call #t~ret0 := fact(~n - 1);< 979202#factENTRY ~n := #in~n; 979216#L25 assume !(~n <= 0); 979168#L26 call #t~ret0 := fact(~n - 1);< 979213#factENTRY ~n := #in~n; 979216#L25 assume !(~n <= 0); 979168#L26 call #t~ret0 := fact(~n - 1);< 979213#factENTRY ~n := #in~n; 979511#L25 assume ~n <= 0;#res := 1; 979510#factFINAL assume true; 979212#factEXIT >#66#return; 979210#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 979209#factFINAL assume true; 979201#factEXIT >#66#return; 979199#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 979196#factFINAL assume true; 979193#factEXIT >#66#return; 979191#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 979173#factFINAL assume true; 979160#factEXIT >#66#return; 979158#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 979157#factFINAL assume true; 979146#factEXIT >#74#return; 979140#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 979144#factENTRY ~n := #in~n; 979513#L25 assume !(~n <= 0); 979182#L26 call #t~ret0 := fact(~n - 1);< 974922#factENTRY ~n := #in~n; 979959#L25 assume !(~n <= 0); 978110#L26 call #t~ret0 := fact(~n - 1);< 980506#factENTRY ~n := #in~n; 980505#L25 assume !(~n <= 0); 974957#L26 call #t~ret0 := fact(~n - 1);< 978131#factENTRY ~n := #in~n; 974956#L25 assume !(~n <= 0); 974903#L26 call #t~ret0 := fact(~n - 1);< 974902#factENTRY ~n := #in~n; 974904#L25 assume ~n <= 0;#res := 1; 980507#factFINAL assume true; 978130#factEXIT >#66#return; 978128#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 978124#factFINAL assume true; 978107#factEXIT >#66#return; 978117#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 979189#factFINAL assume true; 979180#factEXIT >#66#return; 979185#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 979475#factFINAL assume true; 979469#factEXIT >#66#return; 979474#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 979515#factFINAL assume true; 979143#factEXIT >#76#return; 978071#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 978963#factENTRY ~n := #in~n; 980521#L25 assume !(~n <= 0); 978054#L26 call #t~ret0 := fact(~n - 1);< 978072#factENTRY ~n := #in~n; 980522#L25 assume ~n <= 0;#res := 1; 978069#factFINAL assume true; 978053#factEXIT >#66#return; 978056#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 979116#factFINAL assume true; 978961#factEXIT >#78#return; 978031#L30-8 [2022-11-20 09:44:20,261 INFO L750 eck$LassoCheckResult]: Loop: 978031#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; 980695#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 980694#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 980693#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 980692#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 980691#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 980690#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 980689#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; 976797#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 976873#factENTRY ~n := #in~n; 976872#L25 assume !(~n <= 0); 976808#L26 call #t~ret0 := fact(~n - 1);< 976825#factENTRY ~n := #in~n; 976870#L25 assume !(~n <= 0); 976807#L26 call #t~ret0 := fact(~n - 1);< 976830#factENTRY ~n := #in~n; 976874#L25 assume !(~n <= 0); 976805#L26 call #t~ret0 := fact(~n - 1);< 976837#factENTRY ~n := #in~n; 976844#L25 assume !(~n <= 0); 976811#L26 call #t~ret0 := fact(~n - 1);< 976843#factENTRY ~n := #in~n; 976856#L25 assume !(~n <= 0); 976809#L26 call #t~ret0 := fact(~n - 1);< 976850#factENTRY ~n := #in~n; 976859#L25 assume ~n <= 0;#res := 1; 976858#factFINAL assume true; 976849#factEXIT >#66#return; 976847#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 976845#factFINAL assume true; 976842#factEXIT >#66#return; 976840#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 976839#factFINAL assume true; 976836#factEXIT >#66#return; 976834#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 976833#factFINAL assume true; 976828#factEXIT >#66#return; 976827#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 976826#factFINAL assume true; 976804#factEXIT >#66#return; 976802#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 976801#factFINAL assume true; 976794#factEXIT >#68#return; 976773#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 976781#factENTRY ~n := #in~n; 976841#L25 assume ~n <= 0;#res := 1; 976835#factFINAL assume true; 976763#factEXIT >#70#return; 976760#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 976791#factENTRY ~n := #in~n; 980523#L25 assume !(~n <= 0); 976684#L26 call #t~ret0 := fact(~n - 1);< 976758#factENTRY ~n := #in~n; 976757#L25 assume !(~n <= 0); 975666#L26 call #t~ret0 := fact(~n - 1);< 976673#factENTRY ~n := #in~n; 976648#L25 assume !(~n <= 0); 975349#L26 call #t~ret0 := fact(~n - 1);< 975663#factENTRY ~n := #in~n; 975662#L25 assume !(~n <= 0); 975341#L26 call #t~ret0 := fact(~n - 1);< 975350#factENTRY ~n := #in~n; 976674#L25 assume !(~n <= 0); 975364#L26 call #t~ret0 := fact(~n - 1);< 975389#factENTRY ~n := #in~n; 975385#L25 assume ~n <= 0;#res := 1; 975380#factFINAL assume true; 975363#factEXIT >#66#return; 975362#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 975347#factFINAL assume true; 975336#factEXIT >#66#return; 975342#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977630#factFINAL assume true; 977286#factEXIT >#66#return; 977287#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 978343#factFINAL assume true; 978339#factEXIT >#66#return; 978340#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 980528#factFINAL assume true; 978048#factEXIT >#66#return; 978049#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977951#factFINAL assume true; 977842#factEXIT >#72#return; 977840#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; 977838#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 977836#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 977835#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 977834#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; 977358#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 977378#factENTRY ~n := #in~n; 977845#L25 assume !(~n <= 0); 977239#L26 call #t~ret0 := fact(~n - 1);< 977581#factENTRY ~n := #in~n; 977248#L25 assume !(~n <= 0); 977117#L26 call #t~ret0 := fact(~n - 1);< 977237#factENTRY ~n := #in~n; 977115#L25 assume !(~n <= 0); 975250#L26 call #t~ret0 := fact(~n - 1);< 976997#factENTRY ~n := #in~n; 976998#L25 assume !(~n <= 0); 975238#L26 call #t~ret0 := fact(~n - 1);< 975246#factENTRY ~n := #in~n; 975245#L25 assume !(~n <= 0); 975228#L26 call #t~ret0 := fact(~n - 1);< 975240#factENTRY ~n := #in~n; 975244#L25 assume ~n <= 0;#res := 1; 975243#factFINAL assume true; 975225#factEXIT >#66#return; 975233#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977042#factFINAL assume true; 977036#factEXIT >#66#return; 977035#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977023#factFINAL assume true; 977009#factEXIT >#66#return; 977020#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977771#factFINAL assume true; 977765#factEXIT >#66#return; 977768#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977946#factFINAL assume true; 977699#factEXIT >#66#return; 977696#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977381#factFINAL assume true; 977357#factEXIT >#68#return; 976954#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 977568#factENTRY ~n := #in~n; 977566#L25 assume !(~n <= 0); 976942#L26 call #t~ret0 := fact(~n - 1);< 976955#factENTRY ~n := #in~n; 976993#L25 assume ~n <= 0;#res := 1; 976950#factFINAL assume true; 976941#factEXIT >#66#return; 976946#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977950#factFINAL assume true; 977833#factEXIT >#70#return; 977236#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 977832#factENTRY ~n := #in~n; 977952#L25 assume !(~n <= 0); 977116#L26 call #t~ret0 := fact(~n - 1);< 977237#factENTRY ~n := #in~n; 977115#L25 assume !(~n <= 0); 975250#L26 call #t~ret0 := fact(~n - 1);< 976997#factENTRY ~n := #in~n; 976998#L25 assume !(~n <= 0); 975238#L26 call #t~ret0 := fact(~n - 1);< 975246#factENTRY ~n := #in~n; 975245#L25 assume !(~n <= 0); 975228#L26 call #t~ret0 := fact(~n - 1);< 975240#factENTRY ~n := #in~n; 975244#L25 assume ~n <= 0;#res := 1; 975243#factFINAL assume true; 975225#factEXIT >#66#return; 975233#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977042#factFINAL assume true; 977036#factEXIT >#66#return; 977035#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977023#factFINAL assume true; 977009#factEXIT >#66#return; 977020#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977771#factFINAL assume true; 977765#factEXIT >#66#return; 977767#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977931#factFINAL assume true; 977796#factEXIT >#72#return; 977795#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; 977793#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 977791#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 977789#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 977787#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; 977369#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 977378#factENTRY ~n := #in~n; 977845#L25 assume !(~n <= 0); 977239#L26 call #t~ret0 := fact(~n - 1);< 977581#factENTRY ~n := #in~n; 977248#L25 assume !(~n <= 0); 977117#L26 call #t~ret0 := fact(~n - 1);< 977237#factENTRY ~n := #in~n; 977115#L25 assume !(~n <= 0); 975250#L26 call #t~ret0 := fact(~n - 1);< 976997#factENTRY ~n := #in~n; 976998#L25 assume !(~n <= 0); 975238#L26 call #t~ret0 := fact(~n - 1);< 975246#factENTRY ~n := #in~n; 975245#L25 assume !(~n <= 0); 975228#L26 call #t~ret0 := fact(~n - 1);< 975240#factENTRY ~n := #in~n; 975244#L25 assume ~n <= 0;#res := 1; 975243#factFINAL assume true; 975225#factEXIT >#66#return; 975233#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977042#factFINAL assume true; 977036#factEXIT >#66#return; 977035#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977023#factFINAL assume true; 977009#factEXIT >#66#return; 977020#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977771#factFINAL assume true; 977765#factEXIT >#66#return; 977768#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977946#factFINAL assume true; 977699#factEXIT >#66#return; 977696#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977381#factFINAL assume true; 977357#factEXIT >#68#return; 977342#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 977356#factENTRY ~n := #in~n; 977780#L25 assume !(~n <= 0); 977011#L26 call #t~ret0 := fact(~n - 1);< 977776#factENTRY ~n := #in~n; 978300#L25 assume !(~n <= 0); 975226#L26 call #t~ret0 := fact(~n - 1);< 977772#factENTRY ~n := #in~n; 975244#L25 assume ~n <= 0;#res := 1; 975243#factFINAL assume true; 975225#factEXIT >#66#return; 975233#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977042#factFINAL assume true; 977036#factEXIT >#66#return; 977038#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977762#factFINAL assume true; 977761#factEXIT >#70#return; 977028#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 977760#factENTRY ~n := #in~n; 980743#L25 assume !(~n <= 0); 977013#L26 call #t~ret0 := fact(~n - 1);< 977027#factENTRY ~n := #in~n; 980725#L25 assume !(~n <= 0); 975237#L26 call #t~ret0 := fact(~n - 1);< 977024#factENTRY ~n := #in~n; 980716#L25 assume !(~n <= 0); 975231#L26 call #t~ret0 := fact(~n - 1);< 975234#factENTRY ~n := #in~n; 975244#L25 assume ~n <= 0;#res := 1; 975243#factFINAL assume true; 975225#factEXIT >#66#return; 975233#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977042#factFINAL assume true; 977036#factEXIT >#66#return; 977035#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977023#factFINAL assume true; 977009#factEXIT >#66#return; 977019#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977763#factFINAL assume true; 977714#factEXIT >#72#return; 977753#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; 978322#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 978320#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 978319#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 978318#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; 977374#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 977378#factENTRY ~n := #in~n; 977845#L25 assume !(~n <= 0); 977239#L26 call #t~ret0 := fact(~n - 1);< 977581#factENTRY ~n := #in~n; 977248#L25 assume !(~n <= 0); 977117#L26 call #t~ret0 := fact(~n - 1);< 977237#factENTRY ~n := #in~n; 977115#L25 assume !(~n <= 0); 975250#L26 call #t~ret0 := fact(~n - 1);< 976997#factENTRY ~n := #in~n; 976998#L25 assume !(~n <= 0); 975238#L26 call #t~ret0 := fact(~n - 1);< 975246#factENTRY ~n := #in~n; 975245#L25 assume !(~n <= 0); 975228#L26 call #t~ret0 := fact(~n - 1);< 975240#factENTRY ~n := #in~n; 975244#L25 assume ~n <= 0;#res := 1; 975243#factFINAL assume true; 975225#factEXIT >#66#return; 975233#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977042#factFINAL assume true; 977036#factEXIT >#66#return; 977035#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977023#factFINAL assume true; 977009#factEXIT >#66#return; 977020#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977771#factFINAL assume true; 977765#factEXIT >#66#return; 977768#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977946#factFINAL assume true; 977699#factEXIT >#66#return; 977696#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977381#factFINAL assume true; 977357#factEXIT >#68#return; 977346#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 977356#factENTRY ~n := #in~n; 977780#L25 assume !(~n <= 0); 977011#L26 call #t~ret0 := fact(~n - 1);< 977776#factENTRY ~n := #in~n; 978300#L25 assume !(~n <= 0); 975226#L26 call #t~ret0 := fact(~n - 1);< 977772#factENTRY ~n := #in~n; 980640#L25 assume !(~n <= 0); 975229#L26 call #t~ret0 := fact(~n - 1);< 977025#factENTRY ~n := #in~n; 975244#L25 assume ~n <= 0;#res := 1; 975243#factFINAL assume true; 975225#factEXIT >#66#return; 975233#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977042#factFINAL assume true; 977036#factEXIT >#66#return; 977035#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977023#factFINAL assume true; 977009#factEXIT >#66#return; 977018#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977704#factFINAL assume true; 977556#factEXIT >#70#return; 976984#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 977459#factENTRY ~n := #in~n; 977955#L25 assume !(~n <= 0); 976945#L26 call #t~ret0 := fact(~n - 1);< 976991#factENTRY ~n := #in~n; 980640#L25 assume !(~n <= 0); 975229#L26 call #t~ret0 := fact(~n - 1);< 977025#factENTRY ~n := #in~n; 975244#L25 assume ~n <= 0;#res := 1; 975243#factFINAL assume true; 975225#factEXIT >#66#return; 975233#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977042#factFINAL assume true; 977036#factEXIT >#66#return; 977039#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977703#factFINAL assume true; 977495#factEXIT >#72#return; 977526#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; 978316#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 978314#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 978312#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 978310#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; 977375#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 977378#factENTRY ~n := #in~n; 977845#L25 assume !(~n <= 0); 977239#L26 call #t~ret0 := fact(~n - 1);< 977581#factENTRY ~n := #in~n; 977248#L25 assume !(~n <= 0); 977117#L26 call #t~ret0 := fact(~n - 1);< 977237#factENTRY ~n := #in~n; 977115#L25 assume !(~n <= 0); 975250#L26 call #t~ret0 := fact(~n - 1);< 976997#factENTRY ~n := #in~n; 976998#L25 assume !(~n <= 0); 975238#L26 call #t~ret0 := fact(~n - 1);< 975246#factENTRY ~n := #in~n; 975245#L25 assume !(~n <= 0); 975228#L26 call #t~ret0 := fact(~n - 1);< 975240#factENTRY ~n := #in~n; 975244#L25 assume ~n <= 0;#res := 1; 975243#factFINAL assume true; 975225#factEXIT >#66#return; 975233#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977042#factFINAL assume true; 977036#factEXIT >#66#return; 977035#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977023#factFINAL assume true; 977009#factEXIT >#66#return; 977020#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977771#factFINAL assume true; 977765#factEXIT >#66#return; 977768#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977946#factFINAL assume true; 977699#factEXIT >#66#return; 977696#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977381#factFINAL assume true; 977357#factEXIT >#68#return; 977339#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 977356#factENTRY ~n := #in~n; 977780#L25 assume !(~n <= 0); 977011#L26 call #t~ret0 := fact(~n - 1);< 977776#factENTRY ~n := #in~n; 978300#L25 assume !(~n <= 0); 975226#L26 call #t~ret0 := fact(~n - 1);< 977772#factENTRY ~n := #in~n; 980640#L25 assume !(~n <= 0); 975229#L26 call #t~ret0 := fact(~n - 1);< 977025#factENTRY ~n := #in~n; 980716#L25 assume !(~n <= 0); 975231#L26 call #t~ret0 := fact(~n - 1);< 975234#factENTRY ~n := #in~n; 975244#L25 assume ~n <= 0;#res := 1; 975243#factFINAL assume true; 975225#factEXIT >#66#return; 975233#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977042#factFINAL assume true; 977036#factEXIT >#66#return; 977035#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977023#factFINAL assume true; 977009#factEXIT >#66#return; 977020#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977771#factFINAL assume true; 977765#factEXIT >#66#return; 977764#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977702#factFINAL assume true; 977461#factEXIT >#70#return; 976988#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 977459#factENTRY ~n := #in~n; 977955#L25 assume !(~n <= 0); 976945#L26 call #t~ret0 := fact(~n - 1);< 976991#factENTRY ~n := #in~n; 976993#L25 assume ~n <= 0;#res := 1; 976950#factFINAL assume true; 976941#factEXIT >#66#return; 976947#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977697#factFINAL assume true; 977389#factEXIT >#72#return; 977457#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; 978309#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 978307#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 978305#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 978303#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; 977368#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 977378#factENTRY ~n := #in~n; 977845#L25 assume !(~n <= 0); 977239#L26 call #t~ret0 := fact(~n - 1);< 977581#factENTRY ~n := #in~n; 977248#L25 assume !(~n <= 0); 977117#L26 call #t~ret0 := fact(~n - 1);< 977237#factENTRY ~n := #in~n; 977115#L25 assume !(~n <= 0); 975250#L26 call #t~ret0 := fact(~n - 1);< 976997#factENTRY ~n := #in~n; 976998#L25 assume !(~n <= 0); 975238#L26 call #t~ret0 := fact(~n - 1);< 975246#factENTRY ~n := #in~n; 975245#L25 assume !(~n <= 0); 975228#L26 call #t~ret0 := fact(~n - 1);< 975240#factENTRY ~n := #in~n; 975244#L25 assume ~n <= 0;#res := 1; 975243#factFINAL assume true; 975225#factEXIT >#66#return; 975233#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977042#factFINAL assume true; 977036#factEXIT >#66#return; 977035#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977023#factFINAL assume true; 977009#factEXIT >#66#return; 977020#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977771#factFINAL assume true; 977765#factEXIT >#66#return; 977768#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977946#factFINAL assume true; 977699#factEXIT >#66#return; 977696#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977381#factFINAL assume true; 977357#factEXIT >#68#return; 977353#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 977356#factENTRY ~n := #in~n; 977780#L25 assume !(~n <= 0); 977011#L26 call #t~ret0 := fact(~n - 1);< 977776#factENTRY ~n := #in~n; 978300#L25 assume !(~n <= 0); 975226#L26 call #t~ret0 := fact(~n - 1);< 977772#factENTRY ~n := #in~n; 980640#L25 assume !(~n <= 0); 975229#L26 call #t~ret0 := fact(~n - 1);< 977025#factENTRY ~n := #in~n; 980716#L25 assume !(~n <= 0); 975231#L26 call #t~ret0 := fact(~n - 1);< 975234#factENTRY ~n := #in~n; 975245#L25 assume !(~n <= 0); 975228#L26 call #t~ret0 := fact(~n - 1);< 975240#factENTRY ~n := #in~n; 975244#L25 assume ~n <= 0;#res := 1; 975243#factFINAL assume true; 975225#factEXIT >#66#return; 975233#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977042#factFINAL assume true; 977036#factEXIT >#66#return; 977035#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977023#factFINAL assume true; 977009#factEXIT >#66#return; 977020#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977771#factFINAL assume true; 977765#factEXIT >#66#return; 977768#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977946#factFINAL assume true; 977699#factEXIT >#66#return; 977700#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 977690#factFINAL assume true; 977337#factEXIT >#70#return; 975008#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 974987#factENTRY ~n := #in~n; 975042#L25 assume ~n <= 0;#res := 1; 974988#factFINAL assume true; 975041#factEXIT >#72#return; 977331#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; 979374#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 979373#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 979372#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 979371#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; 978424#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 979370#factENTRY ~n := #in~n; 979369#L25 assume !(~n <= 0); 979174#L26 call #t~ret0 := fact(~n - 1);< 979332#factENTRY ~n := #in~n; 979330#L25 assume !(~n <= 0); 979161#L26 call #t~ret0 := fact(~n - 1);< 979176#factENTRY ~n := #in~n; 979296#L25 assume !(~n <= 0); 979167#L26 call #t~ret0 := fact(~n - 1);< 979195#factENTRY ~n := #in~n; 979341#L25 assume !(~n <= 0); 979166#L26 call #t~ret0 := fact(~n - 1);< 979202#factENTRY ~n := #in~n; 979216#L25 assume !(~n <= 0); 979168#L26 call #t~ret0 := fact(~n - 1);< 979213#factENTRY ~n := #in~n; 979511#L25 assume ~n <= 0;#res := 1; 979510#factFINAL assume true; 979212#factEXIT >#66#return; 979210#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 979209#factFINAL assume true; 979201#factEXIT >#66#return; 979199#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 979196#factFINAL assume true; 979193#factEXIT >#66#return; 979191#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 979173#factFINAL assume true; 979160#factEXIT >#66#return; 979169#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 979435#factFINAL assume true; 979433#factEXIT >#66#return; 979424#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 979835#factFINAL assume true; 979833#factEXIT >#74#return; 974880#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 979483#factENTRY ~n := #in~n; 979482#L25 assume !(~n <= 0); 978153#L26 call #t~ret0 := fact(~n - 1);< 978165#factENTRY ~n := #in~n; 979480#L25 assume !(~n <= 0); 979181#L26 call #t~ret0 := fact(~n - 1);< 979479#factENTRY ~n := #in~n; 979958#L25 assume !(~n <= 0); 978116#L26 call #t~ret0 := fact(~n - 1);< 979190#factENTRY ~n := #in~n; 980505#L25 assume !(~n <= 0); 974957#L26 call #t~ret0 := fact(~n - 1);< 978131#factENTRY ~n := #in~n; 974956#L25 assume !(~n <= 0); 974903#L26 call #t~ret0 := fact(~n - 1);< 974902#factENTRY ~n := #in~n; 974904#L25 assume ~n <= 0;#res := 1; 980507#factFINAL assume true; 978130#factEXIT >#66#return; 978128#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 978124#factFINAL assume true; 978107#factEXIT >#66#return; 978117#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 979189#factFINAL assume true; 979180#factEXIT >#66#return; 979185#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 979475#factFINAL assume true; 979469#factEXIT >#66#return; 979470#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 980492#factFINAL assume true; 978146#factEXIT >#66#return; 978164#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 980669#factFINAL assume true; 974879#factEXIT >#76#return; 974884#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 977138#factENTRY ~n := #in~n; 980679#L25 assume !(~n <= 0); 978055#L26 call #t~ret0 := fact(~n - 1);< 978072#factENTRY ~n := #in~n; 980522#L25 assume ~n <= 0;#res := 1; 978069#factFINAL assume true; 978053#factEXIT >#66#return; 978052#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 978050#factFINAL assume true; 978027#factEXIT >#78#return; 978031#L30-8 [2022-11-20 09:44:20,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:44:20,261 INFO L85 PathProgramCache]: Analyzing trace with hash 291195713, now seen corresponding path program 53 times [2022-11-20 09:44:20,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:44:20,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361016761] [2022-11-20 09:44:20,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:44:20,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:44:20,285 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:44:20,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1396835487] [2022-11-20 09:44:20,285 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-20 09:44:20,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:44:20,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:44:20,288 INFO L229 MonitoredProcess]: Starting monitored process 369 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:44:20,289 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (369)] Waiting until timeout for monitored process [2022-11-20 09:44:22,866 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2022-11-20 09:44:22,866 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:44:22,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 1772 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-20 09:44:22,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:44:23,082 INFO L134 CoverageAnalysis]: Checked inductivity of 38477 backedges. 9040 proven. 97 refuted. 0 times theorem prover too weak. 29340 trivial. 0 not checked. [2022-11-20 09:44:23,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:44:24,306 INFO L134 CoverageAnalysis]: Checked inductivity of 38477 backedges. 1908 proven. 309 refuted. 0 times theorem prover too weak. 36260 trivial. 0 not checked. [2022-11-20 09:44:24,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:44:24,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361016761] [2022-11-20 09:44:24,307 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 09:44:24,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396835487] [2022-11-20 09:44:24,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396835487] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:44:24,307 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:44:24,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 18 [2022-11-20 09:44:24,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90264036] [2022-11-20 09:44:24,308 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:44:24,309 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-20 09:44:24,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:44:24,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1019415509, now seen corresponding path program 48 times [2022-11-20 09:44:24,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:44:24,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245460299] [2022-11-20 09:44:24,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:44:24,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:44:24,353 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:44:24,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [533293387] [2022-11-20 09:44:24,353 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-20 09:44:24,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:44:24,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:44:24,378 INFO L229 MonitoredProcess]: Starting monitored process 370 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:44:24,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (370)] Waiting until timeout for monitored process [2022-11-20 09:44:25,405 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2022-11-20 09:44:25,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:44:25,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 911 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-20 09:44:25,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:44:25,834 INFO L134 CoverageAnalysis]: Checked inductivity of 21859 backedges. 5540 proven. 1691 refuted. 0 times theorem prover too weak. 14628 trivial. 0 not checked. [2022-11-20 09:44:25,834 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:44:29,107 INFO L134 CoverageAnalysis]: Checked inductivity of 21859 backedges. 2087 proven. 2101 refuted. 0 times theorem prover too weak. 17671 trivial. 0 not checked. [2022-11-20 09:44:29,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:44:29,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245460299] [2022-11-20 09:44:29,107 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 09:44:29,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533293387] [2022-11-20 09:44:29,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533293387] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:44:29,107 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:44:29,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 28] total 31 [2022-11-20 09:44:29,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364505456] [2022-11-20 09:44:29,108 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:44:29,109 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 09:44:29,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:44:29,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-20 09:44:29,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=797, Unknown=0, NotChecked=0, Total=930 [2022-11-20 09:44:29,110 INFO L87 Difference]: Start difference. First operand 6972 states and 11649 transitions. cyclomatic complexity: 4742 Second operand has 31 states, 28 states have (on average 2.642857142857143) internal successors, (74), 31 states have internal predecessors, (74), 18 states have call successors, (28), 2 states have call predecessors, (28), 13 states have return successors, (35), 15 states have call predecessors, (35), 18 states have call successors, (35) [2022-11-20 09:44:31,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:44:31,627 INFO L93 Difference]: Finished difference Result 7727 states and 12991 transitions. [2022-11-20 09:44:31,627 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7727 states and 12991 transitions. [2022-11-20 09:44:31,679 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1291 [2022-11-20 09:44:31,741 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7727 states to 7727 states and 12975 transitions. [2022-11-20 09:44:31,741 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 676 [2022-11-20 09:44:31,742 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 676 [2022-11-20 09:44:31,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7727 states and 12975 transitions. [2022-11-20 09:44:31,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 09:44:31,742 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7727 states and 12975 transitions. [2022-11-20 09:44:31,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7727 states and 12975 transitions. [2022-11-20 09:44:31,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7727 to 6987. [2022-11-20 09:44:31,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6987 states, 4256 states have (on average 1.0446428571428572) internal successors, (4446), 4244 states have internal predecessors, (4446), 2099 states have call successors, (2179), 733 states have call predecessors, (2179), 632 states have return successors, (5045), 2009 states have call predecessors, (5045), 2099 states have call successors, (5045) [2022-11-20 09:44:31,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6987 states to 6987 states and 11670 transitions. [2022-11-20 09:44:31,898 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6987 states and 11670 transitions. [2022-11-20 09:44:31,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-20 09:44:31,899 INFO L428 stractBuchiCegarLoop]: Abstraction has 6987 states and 11670 transitions. [2022-11-20 09:44:31,899 INFO L335 stractBuchiCegarLoop]: ======== Iteration 76 ============ [2022-11-20 09:44:31,900 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6987 states and 11670 transitions. [2022-11-20 09:44:31,920 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1291 [2022-11-20 09:44:31,920 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 09:44:31,920 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 09:44:31,923 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [127, 127, 76, 76, 76, 76, 51, 17, 16, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 7, 7, 7, 7, 7, 6, 6, 4, 3, 3, 1, 1, 1, 1] [2022-11-20 09:44:31,924 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [92, 92, 71, 71, 71, 71, 21, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:44:31,924 INFO L748 eck$LassoCheckResult]: Stem: 998004#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 997976#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; 997977#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 998003#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; 998020#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1002715#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1002713#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; 997960#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 997961#factENTRY ~n := #in~n; 1002980#L25 assume ~n <= 0;#res := 1; 1002979#factFINAL assume true; 1002970#factEXIT >#68#return; 998018#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 998019#factENTRY ~n := #in~n; 1003046#L25 assume ~n <= 0;#res := 1; 1003041#factFINAL assume true; 1002936#factEXIT >#70#return; 997947#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 997948#factENTRY ~n := #in~n; 1002982#L25 assume ~n <= 0;#res := 1; 1002981#factFINAL assume true; 1002927#factEXIT >#72#return; 1002928#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; 997996#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 997997#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1004118#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1004114#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; 997904#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 997905#factENTRY ~n := #in~n; 1004510#L25 assume !(~n <= 0); 1004507#L26 call #t~ret0 := fact(~n - 1);< 1004508#factENTRY ~n := #in~n; 1004511#L25 assume ~n <= 0;#res := 1; 1004509#factFINAL assume true; 1004506#factEXIT >#66#return; 1004504#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1004501#factFINAL assume true; 1004496#factEXIT >#74#return; 1004491#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1004492#factENTRY ~n := #in~n; 1004500#L25 assume ~n <= 0;#res := 1; 1004495#factFINAL assume true; 1004490#factEXIT >#76#return; 1004487#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1004488#factENTRY ~n := #in~n; 1004503#L25 assume !(~n <= 0); 1004498#L26 call #t~ret0 := fact(~n - 1);< 1004499#factENTRY ~n := #in~n; 1004505#L25 assume ~n <= 0;#res := 1; 1004502#factFINAL assume true; 1004497#factEXIT >#66#return; 1004494#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1004489#factFINAL assume true; 1004486#factEXIT >#78#return; 1004485#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; 1004483#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1004477#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1004475#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1004472#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; 1004265#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1004272#factENTRY ~n := #in~n; 1004309#L25 assume !(~n <= 0); 1004301#L26 call #t~ret0 := fact(~n - 1);< 1004307#factENTRY ~n := #in~n; 1004319#L25 assume !(~n <= 0); 1004304#L26 call #t~ret0 := fact(~n - 1);< 1004317#factENTRY ~n := #in~n; 1004323#L25 assume ~n <= 0;#res := 1; 1004322#factFINAL assume true; 1004320#factEXIT >#66#return; 1004318#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1004311#factFINAL assume true; 1004300#factEXIT >#66#return; 1004295#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1004293#factFINAL assume true; 1004262#factEXIT >#74#return; 1004271#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1004165#factENTRY ~n := #in~n; 1004603#L25 assume ~n <= 0;#res := 1; 1004601#factFINAL assume true; 1004599#factEXIT >#76#return; 1004101#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 998024#factENTRY ~n := #in~n; 1004649#L25 assume !(~n <= 0); 1004036#L26 call #t~ret0 := fact(~n - 1);< 1004050#factENTRY ~n := #in~n; 1004648#L25 assume !(~n <= 0); 1004035#L26 call #t~ret0 := fact(~n - 1);< 1004353#factENTRY ~n := #in~n; 1004799#L25 assume ~n <= 0;#res := 1; 1004362#factFINAL assume true; 1004352#factEXIT >#66#return; 1004349#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1004097#factFINAL assume true; 1004083#factEXIT >#66#return; 1004084#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1004798#factFINAL assume true; 1004797#factEXIT >#78#return; 1004796#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; 1004795#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1004794#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1004113#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1003985#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; 1003814#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1003983#factENTRY ~n := #in~n; 1003982#L25 assume !(~n <= 0); 1003813#L26 call #t~ret0 := fact(~n - 1);< 1003815#factENTRY ~n := #in~n; 1003975#L25 assume !(~n <= 0); 1003817#L26 call #t~ret0 := fact(~n - 1);< 1003842#factENTRY ~n := #in~n; 1003975#L25 assume !(~n <= 0); 1003817#L26 call #t~ret0 := fact(~n - 1);< 1003842#factENTRY ~n := #in~n; 1003972#L25 assume ~n <= 0;#res := 1; 1003970#factFINAL assume true; 1003971#factEXIT >#66#return; 1003966#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1003967#factFINAL assume true; 1003841#factEXIT >#66#return; 1003823#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1003816#factFINAL assume true; 1003818#factEXIT >#66#return; 1003988#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1003987#factFINAL assume true; 1003984#factEXIT >#74#return; 1003876#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1003877#factENTRY ~n := #in~n; 1003899#L25 assume ~n <= 0;#res := 1; 1003897#factFINAL assume true; 1003875#factEXIT >#76#return; 1003861#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1003868#factENTRY ~n := #in~n; 1003865#L25 assume !(~n <= 0); 1003832#L26 call #t~ret0 := fact(~n - 1);< 1003862#factENTRY ~n := #in~n; 1003923#L25 assume !(~n <= 0); 1003829#L26 call #t~ret0 := fact(~n - 1);< 1003847#factENTRY ~n := #in~n; 1003916#L25 assume !(~n <= 0); 1003828#L26 call #t~ret0 := fact(~n - 1);< 1003913#factENTRY ~n := #in~n; 1003918#L25 assume ~n <= 0;#res := 1; 1003917#factFINAL assume true; 1003912#factEXIT >#66#return; 1003910#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1003879#factFINAL assume true; 1003874#factEXIT >#66#return; 1003872#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1003871#factFINAL assume true; 1003867#factEXIT >#66#return; 1003837#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1003995#factFINAL assume true; 1003960#factEXIT >#78#return; 1002893#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; 1002892#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1002890#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1002783#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 998002#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 997992#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 997993#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1002710#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; 1002708#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1002709#factENTRY ~n := #in~n; 1002819#L25 assume !(~n <= 0); 1002817#L26 call #t~ret0 := fact(~n - 1);< 1002818#factENTRY ~n := #in~n; 1002821#L25 assume ~n <= 0;#res := 1; 1002820#factFINAL assume true; 1002816#factEXIT >#66#return; 1002814#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1002810#factFINAL assume true; 1002706#factEXIT >#68#return; 1002699#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1002701#factENTRY ~n := #in~n; 1002704#L25 assume ~n <= 0;#res := 1; 1002702#factFINAL assume true; 1002698#factEXIT >#70#return; 1002694#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1002697#factENTRY ~n := #in~n; 1002815#L25 assume !(~n <= 0); 1002812#L26 call #t~ret0 := fact(~n - 1);< 1002813#factENTRY ~n := #in~n; 1002823#L25 assume ~n <= 0;#res := 1; 1002822#factFINAL assume true; 1002811#factEXIT >#66#return; 1002809#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1002705#factFINAL assume true; 1002693#factEXIT >#72#return; 1002692#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; 1002690#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1002667#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1002666#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1002656#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; 1001979#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1001984#factENTRY ~n := #in~n; 1001981#L25 assume !(~n <= 0); 1001977#L26 call #t~ret0 := fact(~n - 1);< 1001980#factENTRY ~n := #in~n; 1002113#L25 assume ~n <= 0;#res := 1; 1002112#factFINAL assume true; 1002106#factEXIT >#66#return; 1002110#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1002752#factFINAL assume true; 1002744#factEXIT >#68#return; 1001954#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1001957#factENTRY ~n := #in~n; 1002585#L25 assume !(~n <= 0); 1001970#L26 call #t~ret0 := fact(~n - 1);< 1001971#factENTRY ~n := #in~n; 1002587#L25 assume ~n <= 0;#res := 1; 1001976#factFINAL assume true; 1001969#factEXIT >#66#return; 1001968#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1001959#factFINAL assume true; 1001960#factEXIT >#70#return; 1001993#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1001996#factENTRY ~n := #in~n; 1002570#L25 assume ~n <= 0;#res := 1; 1002569#factFINAL assume true; 1001992#factEXIT >#72#return; 1001991#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; 1001990#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1001989#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1001988#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1001987#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; 1001936#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1001937#factENTRY ~n := #in~n; 1002440#L25 assume !(~n <= 0); 1002437#L26 call #t~ret0 := fact(~n - 1);< 1002439#factENTRY ~n := #in~n; 1002448#L25 assume !(~n <= 0); 1002438#L26 call #t~ret0 := fact(~n - 1);< 1002446#factENTRY ~n := #in~n; 1002473#L25 assume ~n <= 0;#res := 1; 1002472#factFINAL assume true; 1002445#factEXIT >#66#return; 1002443#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1002441#factFINAL assume true; 1002436#factEXIT >#66#return; 1002434#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1002432#factFINAL assume true; 1002428#factEXIT >#74#return; 1000593#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1000417#factENTRY ~n := #in~n; 1003543#L25 assume !(~n <= 0); 1003262#L26 call #t~ret0 := fact(~n - 1);< 1003266#factENTRY ~n := #in~n; 1003272#L25 assume ~n <= 0;#res := 1; 1003270#factFINAL assume true; 1003258#factEXIT >#66#return; 1003264#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1003776#factFINAL assume true; 1003774#factEXIT >#76#return; 1000399#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1000402#factENTRY ~n := #in~n; 1000436#L25 assume !(~n <= 0); 1000434#L26 call #t~ret0 := fact(~n - 1);< 1000435#factENTRY ~n := #in~n; 1000438#L25 assume ~n <= 0;#res := 1; 1000437#factFINAL assume true; 1000433#factEXIT >#66#return; 1000432#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1000410#factFINAL assume true; 1000398#factEXIT >#78#return; 1000394#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; 1000393#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1000392#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1000390#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1000388#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; 1000268#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1000269#factENTRY ~n := #in~n; 1000411#L25 assume !(~n <= 0); 1000408#L26 call #t~ret0 := fact(~n - 1);< 1000409#factENTRY ~n := #in~n; 1000510#L25 assume !(~n <= 0); 1000407#L26 call #t~ret0 := fact(~n - 1);< 1000509#factENTRY ~n := #in~n; 1000510#L25 assume !(~n <= 0); 1000407#L26 call #t~ret0 := fact(~n - 1);< 1000509#factENTRY ~n := #in~n; 1000517#L25 assume ~n <= 0;#res := 1; 1000516#factFINAL assume true; 1000515#factEXIT >#66#return; 1000513#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1000511#factFINAL assume true; 1000508#factEXIT >#66#return; 1000507#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1000506#factFINAL assume true; 1000406#factEXIT >#66#return; 1000405#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1000404#factFINAL assume true; 1000264#factEXIT >#74#return; 1000240#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1000262#factENTRY ~n := #in~n; 1000383#L25 assume !(~n <= 0); 1000380#L26 call #t~ret0 := fact(~n - 1);< 1000382#factENTRY ~n := #in~n; 1000387#L25 assume ~n <= 0;#res := 1; 1000384#factFINAL assume true; 1000378#factEXIT >#66#return; 1000377#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1000376#factFINAL assume true; 1000261#factEXIT >#76#return; 1000257#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 998885#factENTRY ~n := #in~n; 1000375#L25 assume !(~n <= 0); 1000345#L26 call #t~ret0 := fact(~n - 1);< 1000369#factENTRY ~n := #in~n; 1000504#L25 assume !(~n <= 0); 1000343#L26 call #t~ret0 := fact(~n - 1);< 1000503#factENTRY ~n := #in~n; 1000531#L25 assume ~n <= 0;#res := 1; 1000552#factFINAL assume true; 1000524#factEXIT >#66#return; 1000523#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1000522#factFINAL assume true; 1000363#factEXIT >#66#return; 1000361#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1000259#factFINAL assume true; 1000256#factEXIT >#78#return; 998883#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; 1002201#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1002200#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1002199#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 1002197#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 1002185#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1002182#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1000676#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; 998818#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 998824#factENTRY ~n := #in~n; 998905#L25 assume !(~n <= 0); 998838#L26 call #t~ret0 := fact(~n - 1);< 998840#factENTRY ~n := #in~n; 998876#L25 assume !(~n <= 0); 998839#L26 call #t~ret0 := fact(~n - 1);< 998874#factENTRY ~n := #in~n; 998912#L25 assume ~n <= 0;#res := 1; 998911#factFINAL assume true; 998910#factEXIT >#66#return; 998909#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 998886#factFINAL assume true; 998872#factEXIT >#66#return; 998873#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 998835#factFINAL assume true; 998817#factEXIT >#68#return; 998822#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 998637#factENTRY ~n := #in~n; 1001330#L25 assume ~n <= 0;#res := 1; 1001322#factFINAL assume true; 1001319#factEXIT >#70#return; 1001321#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1001355#factENTRY ~n := #in~n; 1001353#L25 assume !(~n <= 0); 1001346#L26 call #t~ret0 := fact(~n - 1);< 1001352#factENTRY ~n := #in~n; 1001998#L25 assume !(~n <= 0); 1001344#L26 call #t~ret0 := fact(~n - 1);< 1001358#factENTRY ~n := #in~n; 1001361#L25 assume ~n <= 0;#res := 1; 1001360#factFINAL assume true; 1001356#factEXIT >#66#return; 1001354#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1001351#factFINAL assume true; 1001343#factEXIT >#66#return; 1001347#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1001488#factFINAL assume true; 1001481#factEXIT >#72#return; 1001482#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; 1001486#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1001485#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1001484#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1001483#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; 1001452#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1001457#factENTRY ~n := #in~n; 1001504#L25 assume !(~n <= 0); 1001502#L26 call #t~ret0 := fact(~n - 1);< 1001503#factENTRY ~n := #in~n; 1001511#L25 assume !(~n <= 0); 1001509#L26 call #t~ret0 := fact(~n - 1);< 1001510#factENTRY ~n := #in~n; 1001513#L25 assume ~n <= 0;#res := 1; 1001512#factFINAL assume true; 1001508#factEXIT >#66#return; 1001506#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1001505#factFINAL assume true; 1001501#factEXIT >#66#return; 1001500#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1001460#factFINAL assume true; 1001450#factEXIT >#68#return; 1001456#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1001472#factENTRY ~n := #in~n; 1001495#L25 assume !(~n <= 0); 1001491#L26 call #t~ret0 := fact(~n - 1);< 1001494#factENTRY ~n := #in~n; 1001498#L25 assume ~n <= 0;#res := 1; 1001496#factFINAL assume true; 1001490#factEXIT >#66#return; 1001489#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1001478#factFINAL assume true; 1001471#factEXIT >#70#return; 1001466#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1001469#factENTRY ~n := #in~n; 1001497#L25 assume !(~n <= 0); 1001492#L26 call #t~ret0 := fact(~n - 1);< 1001494#factENTRY ~n := #in~n; 1001498#L25 assume ~n <= 0;#res := 1; 1001496#factFINAL assume true; 1001490#factEXIT >#66#return; 1001493#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1001499#factFINAL assume true; 1001465#factEXIT >#72#return; 1001468#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; 1001540#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1001539#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1001537#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1001536#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; 1001453#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1001457#factENTRY ~n := #in~n; 1001504#L25 assume !(~n <= 0); 1001502#L26 call #t~ret0 := fact(~n - 1);< 1001503#factENTRY ~n := #in~n; 1001511#L25 assume !(~n <= 0); 1001509#L26 call #t~ret0 := fact(~n - 1);< 1001510#factENTRY ~n := #in~n; 1001513#L25 assume ~n <= 0;#res := 1; 1001512#factFINAL assume true; 1001508#factEXIT >#66#return; 1001506#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1001505#factFINAL assume true; 1001501#factEXIT >#66#return; 1001500#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1001460#factFINAL assume true; 1001450#factEXIT >#68#return; 1001304#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1001449#factENTRY ~n := #in~n; 1002739#L25 assume !(~n <= 0); 1001290#L26 call #t~ret0 := fact(~n - 1);< 1001306#factENTRY ~n := #in~n; 1001323#L25 assume !(~n <= 0); 1001316#L26 call #t~ret0 := fact(~n - 1);< 1001317#factENTRY ~n := #in~n; 1001332#L25 assume ~n <= 0;#res := 1; 1001331#factFINAL assume true; 1001315#factEXIT >#66#return; 1001309#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1001303#factFINAL assume true; 1001287#factEXIT >#66#return; 1001296#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1001507#factFINAL assume true; 1001448#factEXIT >#70#return; 1001444#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1001447#factENTRY ~n := #in~n; 1001515#L25 assume ~n <= 0;#res := 1; 1001514#factFINAL assume true; 1001443#factEXIT >#72#return; 1001446#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; 1001820#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1001819#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1001818#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1000909#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; 1000905#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1000906#factENTRY ~n := #in~n; 1001264#L25 assume !(~n <= 0); 1001257#L26 call #t~ret0 := fact(~n - 1);< 1001261#factENTRY ~n := #in~n; 1001268#L25 assume !(~n <= 0); 1001259#L26 call #t~ret0 := fact(~n - 1);< 1001267#factENTRY ~n := #in~n; 1001268#L25 assume !(~n <= 0); 1001259#L26 call #t~ret0 := fact(~n - 1);< 1001267#factENTRY ~n := #in~n; 1001273#L25 assume ~n <= 0;#res := 1; 1001272#factFINAL assume true; 1001271#factEXIT >#66#return; 1001270#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1001269#factFINAL assume true; 1001266#factEXIT >#66#return; 1001265#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1001263#factFINAL assume true; 1001256#factEXIT >#66#return; 1001260#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1001364#factFINAL assume true; 1000904#factEXIT >#74#return; 1000898#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1000902#factENTRY ~n := #in~n; 1000901#L25 assume !(~n <= 0); 1000855#L26 call #t~ret0 := fact(~n - 1);< 1000893#factENTRY ~n := #in~n; 1000892#L25 assume !(~n <= 0); 1000887#L26 call #t~ret0 := fact(~n - 1);< 1000888#factENTRY ~n := #in~n; 1000895#L25 assume ~n <= 0;#res := 1; 1000894#factFINAL assume true; 1000886#factEXIT >#66#return; 1000884#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1000872#factFINAL assume true; 1000843#factEXIT >#66#return; 1000864#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1001815#factFINAL assume true; 1001809#factEXIT >#76#return; 998730#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 998731#factENTRY ~n := #in~n; 1001178#L25 assume !(~n <= 0); 1001175#L26 call #t~ret0 := fact(~n - 1);< 1001176#factENTRY ~n := #in~n; 1001188#L25 assume ~n <= 0;#res := 1; 1001187#factFINAL assume true; 1001174#factEXIT >#66#return; 1001171#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1001169#factFINAL assume true; 1001150#factEXIT >#78#return; 998726#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; 998723#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 998722#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 998721#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 998719#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 998717#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 998650#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 998648#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; 998642#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 998643#factENTRY ~n := #in~n; 998861#L25 assume !(~n <= 0); 998837#L26 call #t~ret0 := fact(~n - 1);< 998840#factENTRY ~n := #in~n; 998876#L25 assume !(~n <= 0); 998839#L26 call #t~ret0 := fact(~n - 1);< 998874#factENTRY ~n := #in~n; 998876#L25 assume !(~n <= 0); 998839#L26 call #t~ret0 := fact(~n - 1);< 998874#factENTRY ~n := #in~n; 998912#L25 assume ~n <= 0;#res := 1; 998911#factFINAL assume true; 998910#factEXIT >#66#return; 998909#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 998886#factFINAL assume true; 998872#factEXIT >#66#return; 998870#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 998868#factFINAL assume true; 998836#factEXIT >#66#return; 998834#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 998646#factFINAL assume true; 998640#factEXIT >#68#return; 998632#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 998638#factENTRY ~n := #in~n; 998783#L25 assume ~n <= 0;#res := 1; 998782#factFINAL assume true; 998630#factEXIT >#70#return; 998607#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 998610#factENTRY ~n := #in~n; 998924#L25 assume !(~n <= 0); 998918#L26 call #t~ret0 := fact(~n - 1);< 998922#factENTRY ~n := #in~n; 998941#L25 assume !(~n <= 0); 998932#L26 call #t~ret0 := fact(~n - 1);< 998936#factENTRY ~n := #in~n; 1000245#L25 assume !(~n <= 0); 998958#L26 call #t~ret0 := fact(~n - 1);< 998968#factENTRY ~n := #in~n; 998966#L25 assume ~n <= 0;#res := 1; 998963#factFINAL assume true; 998957#factEXIT >#66#return; 998954#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 998942#factFINAL assume true; 998931#factEXIT >#66#return; 998930#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 998926#factFINAL assume true; 998915#factEXIT >#66#return; 998914#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 998734#factFINAL assume true; 998606#factEXIT >#72#return; 998521#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; 998520#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 998513#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 998511#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 998509#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; 998338#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 998341#factENTRY ~n := #in~n; 998370#L25 assume !(~n <= 0); 998357#L26 call #t~ret0 := fact(~n - 1);< 998362#factENTRY ~n := #in~n; 998410#L25 assume !(~n <= 0); 998230#L26 call #t~ret0 := fact(~n - 1);< 998237#factENTRY ~n := #in~n; 998238#L25 assume !(~n <= 0); 998218#L26 call #t~ret0 := fact(~n - 1);< 998232#factENTRY ~n := #in~n; 998234#L25 assume ~n <= 0;#res := 1; 998233#factFINAL assume true; 998217#factEXIT >#66#return; 998223#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 998391#factFINAL assume true; 998378#factEXIT >#66#return; 998374#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 998367#factFINAL assume true; 998356#factEXIT >#66#return; 998352#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 998348#factFINAL assume true; 998334#factEXIT >#68#return; 998326#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 998331#factENTRY ~n := #in~n; 998328#L25 assume !(~n <= 0); 998242#L26 call #t~ret0 := fact(~n - 1);< 998327#factENTRY ~n := #in~n; 998294#L25 assume ~n <= 0;#res := 1; 998522#factFINAL assume true; 998514#factEXIT >#66#return; 998512#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 998510#factFINAL assume true; 998508#factEXIT >#70#return; 998405#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 998451#factENTRY ~n := #in~n; 998611#L25 assume !(~n <= 0); 998229#L26 call #t~ret0 := fact(~n - 1);< 998407#factENTRY ~n := #in~n; 998238#L25 assume !(~n <= 0); 998218#L26 call #t~ret0 := fact(~n - 1);< 998232#factENTRY ~n := #in~n; 998234#L25 assume ~n <= 0;#res := 1; 998233#factFINAL assume true; 998217#factEXIT >#66#return; 998223#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 998391#factFINAL assume true; 998378#factEXIT >#66#return; 998381#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 998645#factFINAL assume true; 998449#factEXIT >#72#return; 998450#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; 998505#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 998482#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 998480#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 998478#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; 998339#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 998341#factENTRY ~n := #in~n; 998370#L25 assume !(~n <= 0); 998357#L26 call #t~ret0 := fact(~n - 1);< 998362#factENTRY ~n := #in~n; 998410#L25 assume !(~n <= 0); 998230#L26 call #t~ret0 := fact(~n - 1);< 998237#factENTRY ~n := #in~n; 998238#L25 assume !(~n <= 0); 998218#L26 call #t~ret0 := fact(~n - 1);< 998232#factENTRY ~n := #in~n; 998234#L25 assume ~n <= 0;#res := 1; 998233#factFINAL assume true; 998217#factEXIT >#66#return; 998223#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 998391#factFINAL assume true; 998378#factEXIT >#66#return; 998374#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 998367#factFINAL assume true; 998356#factEXIT >#66#return; 998352#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 998348#factFINAL assume true; 998334#factEXIT >#68#return; 998099#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 998332#factENTRY ~n := #in~n; 998330#L25 assume !(~n <= 0); 998244#L26 call #t~ret0 := fact(~n - 1);< 998249#factENTRY ~n := #in~n; 998246#L25 assume !(~n <= 0); 998221#L26 call #t~ret0 := fact(~n - 1);< 998239#factENTRY ~n := #in~n; 998234#L25 assume ~n <= 0;#res := 1; 998233#factFINAL assume true; 998217#factEXIT >#66#return; 998223#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 998391#factFINAL assume true; 998378#factEXIT >#66#return; 998383#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 998477#factFINAL assume true; 998389#factEXIT >#70#return; 998385#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 998388#factENTRY ~n := #in~n; 998832#L25 assume !(~n <= 0); 998515#L26 call #t~ret0 := fact(~n - 1);< 998605#factENTRY ~n := #in~n; 998294#L25 assume ~n <= 0;#res := 1; 998522#factFINAL assume true; 998514#factEXIT >#66#return; 998519#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 998411#factFINAL assume true; 998384#factEXIT >#72#return; 998375#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; 998371#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 998363#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 998353#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 998349#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; 998335#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 998341#factENTRY ~n := #in~n; 998370#L25 assume !(~n <= 0); 998357#L26 call #t~ret0 := fact(~n - 1);< 998362#factENTRY ~n := #in~n; 998410#L25 assume !(~n <= 0); 998230#L26 call #t~ret0 := fact(~n - 1);< 998237#factENTRY ~n := #in~n; 998238#L25 assume !(~n <= 0); 998218#L26 call #t~ret0 := fact(~n - 1);< 998232#factENTRY ~n := #in~n; 998234#L25 assume ~n <= 0;#res := 1; 998233#factFINAL assume true; 998217#factEXIT >#66#return; 998223#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 998391#factFINAL assume true; 998378#factEXIT >#66#return; 998374#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 998367#factFINAL assume true; 998356#factEXIT >#66#return; 998352#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 998348#factFINAL assume true; 998334#factEXIT >#68#return; 998100#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 998332#factENTRY ~n := #in~n; 998330#L25 assume !(~n <= 0); 998244#L26 call #t~ret0 := fact(~n - 1);< 998249#factENTRY ~n := #in~n; 998246#L25 assume !(~n <= 0); 998221#L26 call #t~ret0 := fact(~n - 1);< 998239#factENTRY ~n := #in~n; 998234#L25 assume ~n <= 0;#res := 1; 998233#factFINAL assume true; 998217#factEXIT >#66#return; 998223#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 998391#factFINAL assume true; 998378#factEXIT >#66#return; 998383#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 998477#factFINAL assume true; 998389#factEXIT >#70#return; 998102#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 999669#factENTRY ~n := #in~n; 999671#L25 assume ~n <= 0;#res := 1; 999670#factFINAL assume true; 999667#factEXIT >#72#return; 999668#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; 1000103#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1000102#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1000101#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1000100#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; 999660#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1000098#factENTRY ~n := #in~n; 1000096#L25 assume !(~n <= 0); 999928#L26 call #t~ret0 := fact(~n - 1);< 1000094#factENTRY ~n := #in~n; 1001786#L25 assume !(~n <= 0); 999926#L26 call #t~ret0 := fact(~n - 1);< 1000107#factENTRY ~n := #in~n; 1000127#L25 assume !(~n <= 0); 999924#L26 call #t~ret0 := fact(~n - 1);< 1000122#factENTRY ~n := #in~n; 1000127#L25 assume !(~n <= 0); 999924#L26 call #t~ret0 := fact(~n - 1);< 1000122#factENTRY ~n := #in~n; 1000129#L25 assume ~n <= 0;#res := 1; 1000128#factFINAL assume true; 1000121#factEXIT >#66#return; 1000120#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1000119#factFINAL assume true; 1000115#factEXIT >#66#return; 1000113#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1000108#factFINAL assume true; 1000105#factEXIT >#66#return; 1000104#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1000093#factFINAL assume true; 1000036#factEXIT >#66#return; 1000037#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1000654#factFINAL assume true; 1000651#factEXIT >#74#return; 999823#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1000805#factENTRY ~n := #in~n; 1002774#L25 assume !(~n <= 0); 1000566#L26 call #t~ret0 := fact(~n - 1);< 1001055#factENTRY ~n := #in~n; 1000570#L25 assume !(~n <= 0); 999702#L26 call #t~ret0 := fact(~n - 1);< 1000291#factENTRY ~n := #in~n; 1000290#L25 assume !(~n <= 0); 999701#L26 call #t~ret0 := fact(~n - 1);< 1000282#factENTRY ~n := #in~n; 1000281#L25 assume !(~n <= 0); 999778#L26 call #t~ret0 := fact(~n - 1);< 999780#factENTRY ~n := #in~n; 999790#L25 assume ~n <= 0;#res := 1; 999788#factFINAL assume true; 999777#factEXIT >#66#return; 999776#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 999774#factFINAL assume true; 999696#factEXIT >#66#return; 999707#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1001138#factFINAL assume true; 1001135#factEXIT >#66#return; 1001136#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1001388#factFINAL assume true; 1001049#factEXIT >#66#return; 1001045#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1001044#factFINAL assume true; 1000804#factEXIT >#76#return; 999689#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 999692#factENTRY ~n := #in~n; 999690#L25 assume !(~n <= 0); 999683#L26 call #t~ret0 := fact(~n - 1);< 999685#factENTRY ~n := #in~n; 999691#L25 assume ~n <= 0;#res := 1; 999687#factFINAL assume true; 999681#factEXIT >#66#return; 999684#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 999840#factFINAL assume true; 999815#factEXIT >#78#return; 999631#L30-8 [2022-11-20 09:44:31,925 INFO L750 eck$LassoCheckResult]: Loop: 999631#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; 1000746#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1000744#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1000742#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 1000740#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 1000738#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1000737#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1000736#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; 999294#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 999766#factENTRY ~n := #in~n; 999765#L25 assume !(~n <= 0); 999359#L26 call #t~ret0 := fact(~n - 1);< 999377#factENTRY ~n := #in~n; 999764#L25 assume !(~n <= 0); 999368#L26 call #t~ret0 := fact(~n - 1);< 999762#factENTRY ~n := #in~n; 999759#L25 assume !(~n <= 0); 999365#L26 call #t~ret0 := fact(~n - 1);< 999757#factENTRY ~n := #in~n; 999754#L25 assume !(~n <= 0); 999362#L26 call #t~ret0 := fact(~n - 1);< 999609#factENTRY ~n := #in~n; 999785#L25 assume !(~n <= 0); 999361#L26 call #t~ret0 := fact(~n - 1);< 999734#factENTRY ~n := #in~n; 999784#L25 assume ~n <= 0;#res := 1; 999783#factFINAL assume true; 999733#factEXIT >#66#return; 999731#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 999729#factFINAL assume true; 999714#factEXIT >#66#return; 999713#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 999712#factFINAL assume true; 999608#factEXIT >#66#return; 999607#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 999546#factFINAL assume true; 999379#factEXIT >#66#return; 999378#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 999375#factFINAL assume true; 999358#factEXIT >#66#return; 999356#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 999355#factFINAL assume true; 999290#factEXIT >#68#return; 999280#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 999289#factENTRY ~n := #in~n; 999342#L25 assume ~n <= 0;#res := 1; 999341#factFINAL assume true; 999272#factEXIT >#70#return; 999268#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 999271#factENTRY ~n := #in~n; 999597#L25 assume !(~n <= 0); 999336#L26 call #t~ret0 := fact(~n - 1);< 999339#factENTRY ~n := #in~n; 999351#L25 assume !(~n <= 0); 998944#L26 call #t~ret0 := fact(~n - 1);< 998948#factENTRY ~n := #in~n; 998947#L25 assume !(~n <= 0); 998916#L26 call #t~ret0 := fact(~n - 1);< 998922#factENTRY ~n := #in~n; 998941#L25 assume !(~n <= 0); 998932#L26 call #t~ret0 := fact(~n - 1);< 998936#factENTRY ~n := #in~n; 1000245#L25 assume !(~n <= 0); 998958#L26 call #t~ret0 := fact(~n - 1);< 998968#factENTRY ~n := #in~n; 998966#L25 assume ~n <= 0;#res := 1; 998963#factFINAL assume true; 998957#factEXIT >#66#return; 998954#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 998942#factFINAL assume true; 998931#factEXIT >#66#return; 998930#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 998926#factFINAL assume true; 998915#factEXIT >#66#return; 998921#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 999353#factFINAL assume true; 999348#factEXIT >#66#return; 999347#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 999343#factFINAL assume true; 999335#factEXIT >#66#return; 999334#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 999333#factFINAL assume true; 999267#factEXIT >#72#return; 999265#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; 999264#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 999263#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 999261#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 999260#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; 998429#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 998639#factENTRY ~n := #in~n; 998629#L25 assume !(~n <= 0); 998416#L26 call #t~ret0 := fact(~n - 1);< 998421#factENTRY ~n := #in~n; 998419#L25 assume !(~n <= 0); 998136#L26 call #t~ret0 := fact(~n - 1);< 998413#factENTRY ~n := #in~n; 998412#L25 assume !(~n <= 0); 998358#L26 call #t~ret0 := fact(~n - 1);< 998362#factENTRY ~n := #in~n; 998410#L25 assume !(~n <= 0); 998230#L26 call #t~ret0 := fact(~n - 1);< 998237#factENTRY ~n := #in~n; 998238#L25 assume !(~n <= 0); 998218#L26 call #t~ret0 := fact(~n - 1);< 998232#factENTRY ~n := #in~n; 998234#L25 assume ~n <= 0;#res := 1; 998233#factFINAL assume true; 998217#factEXIT >#66#return; 998223#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 998391#factFINAL assume true; 998378#factEXIT >#66#return; 998374#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 998367#factFINAL assume true; 998356#factEXIT >#66#return; 998216#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 998180#factFINAL assume true; 998109#factEXIT >#66#return; 998142#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 999238#factFINAL assume true; 999150#factEXIT >#66#return; 999153#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 999262#factFINAL assume true; 999259#factEXIT >#68#return; 998591#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 998828#factENTRY ~n := #in~n; 998827#L25 assume !(~n <= 0); 998516#L26 call #t~ret0 := fact(~n - 1);< 998605#factENTRY ~n := #in~n; 998294#L25 assume ~n <= 0;#res := 1; 998522#factFINAL assume true; 998514#factEXIT >#66#return; 998518#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 999266#factFINAL assume true; 999246#factEXIT >#70#return; 998414#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 998826#factENTRY ~n := #in~n; 998628#L25 assume !(~n <= 0); 998110#L26 call #t~ret0 := fact(~n - 1);< 998413#factENTRY ~n := #in~n; 998412#L25 assume !(~n <= 0); 998358#L26 call #t~ret0 := fact(~n - 1);< 998362#factENTRY ~n := #in~n; 998410#L25 assume !(~n <= 0); 998230#L26 call #t~ret0 := fact(~n - 1);< 998237#factENTRY ~n := #in~n; 998238#L25 assume !(~n <= 0); 998218#L26 call #t~ret0 := fact(~n - 1);< 998232#factENTRY ~n := #in~n; 998234#L25 assume ~n <= 0;#res := 1; 998233#factFINAL assume true; 998217#factEXIT >#66#return; 998223#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 998391#factFINAL assume true; 998378#factEXIT >#66#return; 998374#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 998367#factFINAL assume true; 998356#factEXIT >#66#return; 998216#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 998180#factFINAL assume true; 998109#factEXIT >#66#return; 998141#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1000130#factFINAL assume true; 1000079#factEXIT >#72#return; 1000080#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; 1000745#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1000743#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1000741#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1000739#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; 998430#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 998639#factENTRY ~n := #in~n; 998629#L25 assume !(~n <= 0); 998416#L26 call #t~ret0 := fact(~n - 1);< 998421#factENTRY ~n := #in~n; 998419#L25 assume !(~n <= 0); 998136#L26 call #t~ret0 := fact(~n - 1);< 998413#factENTRY ~n := #in~n; 998412#L25 assume !(~n <= 0); 998358#L26 call #t~ret0 := fact(~n - 1);< 998362#factENTRY ~n := #in~n; 998410#L25 assume !(~n <= 0); 998230#L26 call #t~ret0 := fact(~n - 1);< 998237#factENTRY ~n := #in~n; 998238#L25 assume !(~n <= 0); 998218#L26 call #t~ret0 := fact(~n - 1);< 998232#factENTRY ~n := #in~n; 998234#L25 assume ~n <= 0;#res := 1; 998233#factFINAL assume true; 998217#factEXIT >#66#return; 998223#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 998391#factFINAL assume true; 998378#factEXIT >#66#return; 998374#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 998367#factFINAL assume true; 998356#factEXIT >#66#return; 998216#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 998180#factFINAL assume true; 998109#factEXIT >#66#return; 998142#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 999238#factFINAL assume true; 999150#factEXIT >#66#return; 999153#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 999262#factFINAL assume true; 999259#factEXIT >#68#return; 998736#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 998773#factENTRY ~n := #in~n; 998771#L25 assume !(~n <= 0); 998122#L26 call #t~ret0 := fact(~n - 1);< 998286#factENTRY ~n := #in~n; 998283#L25 assume !(~n <= 0); 998140#L26 call #t~ret0 := fact(~n - 1);< 998257#factENTRY ~n := #in~n; 998234#L25 assume ~n <= 0;#res := 1; 998233#factFINAL assume true; 998217#factEXIT >#66#return; 998223#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 998391#factFINAL assume true; 998378#factEXIT >#66#return; 998379#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 999354#factFINAL assume true; 999332#factEXIT >#70#return; 998346#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 998355#factENTRY ~n := #in~n; 998351#L25 assume !(~n <= 0); 998137#L26 call #t~ret0 := fact(~n - 1);< 998333#factENTRY ~n := #in~n; 998329#L25 assume !(~n <= 0); 998243#L26 call #t~ret0 := fact(~n - 1);< 998249#factENTRY ~n := #in~n; 998246#L25 assume !(~n <= 0); 998221#L26 call #t~ret0 := fact(~n - 1);< 998239#factENTRY ~n := #in~n; 998234#L25 assume ~n <= 0;#res := 1; 998233#factFINAL assume true; 998217#factEXIT >#66#return; 998223#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 998391#factFINAL assume true; 998378#factEXIT >#66#return; 998374#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 998367#factFINAL assume true; 998356#factEXIT >#66#return; 998360#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 999465#factFINAL assume true; 999313#factEXIT >#72#return; 999322#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; 1002743#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1002742#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1002741#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1002740#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; 998440#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 998639#factENTRY ~n := #in~n; 998629#L25 assume !(~n <= 0); 998416#L26 call #t~ret0 := fact(~n - 1);< 998421#factENTRY ~n := #in~n; 998419#L25 assume !(~n <= 0); 998136#L26 call #t~ret0 := fact(~n - 1);< 998413#factENTRY ~n := #in~n; 998412#L25 assume !(~n <= 0); 998358#L26 call #t~ret0 := fact(~n - 1);< 998362#factENTRY ~n := #in~n; 998410#L25 assume !(~n <= 0); 998230#L26 call #t~ret0 := fact(~n - 1);< 998237#factENTRY ~n := #in~n; 998238#L25 assume !(~n <= 0); 998218#L26 call #t~ret0 := fact(~n - 1);< 998232#factENTRY ~n := #in~n; 998234#L25 assume ~n <= 0;#res := 1; 998233#factFINAL assume true; 998217#factEXIT >#66#return; 998223#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 998391#factFINAL assume true; 998378#factEXIT >#66#return; 998374#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 998367#factFINAL assume true; 998356#factEXIT >#66#return; 998216#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 998180#factFINAL assume true; 998109#factEXIT >#66#return; 998142#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 999238#factFINAL assume true; 999150#factEXIT >#66#return; 999153#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 999262#factFINAL assume true; 999259#factEXIT >#68#return; 998738#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 998773#factENTRY ~n := #in~n; 998771#L25 assume !(~n <= 0); 998122#L26 call #t~ret0 := fact(~n - 1);< 998286#factENTRY ~n := #in~n; 998283#L25 assume !(~n <= 0); 998140#L26 call #t~ret0 := fact(~n - 1);< 998257#factENTRY ~n := #in~n; 998253#L25 assume !(~n <= 0); 998220#L26 call #t~ret0 := fact(~n - 1);< 998248#factENTRY ~n := #in~n; 998234#L25 assume ~n <= 0;#res := 1; 998233#factFINAL assume true; 998217#factEXIT >#66#return; 998223#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 998391#factFINAL assume true; 998378#factEXIT >#66#return; 998374#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 998367#factFINAL assume true; 998356#factEXIT >#66#return; 998359#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 999651#factFINAL assume true; 999421#factEXIT >#70#return; 998852#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 998865#factENTRY ~n := #in~n; 998862#L25 assume !(~n <= 0); 998123#L26 call #t~ret0 := fact(~n - 1);< 998724#factENTRY ~n := #in~n; 998253#L25 assume !(~n <= 0); 998220#L26 call #t~ret0 := fact(~n - 1);< 998248#factENTRY ~n := #in~n; 998234#L25 assume ~n <= 0;#res := 1; 998233#factFINAL assume true; 998217#factEXIT >#66#return; 998223#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 998391#factFINAL assume true; 998378#factEXIT >#66#return; 998380#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 999301#factFINAL assume true; 999173#factEXIT >#72#return; 999188#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; 1001797#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1001798#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1001792#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1001793#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; 998431#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 998639#factENTRY ~n := #in~n; 998629#L25 assume !(~n <= 0); 998416#L26 call #t~ret0 := fact(~n - 1);< 998421#factENTRY ~n := #in~n; 998419#L25 assume !(~n <= 0); 998136#L26 call #t~ret0 := fact(~n - 1);< 998413#factENTRY ~n := #in~n; 998412#L25 assume !(~n <= 0); 998358#L26 call #t~ret0 := fact(~n - 1);< 998362#factENTRY ~n := #in~n; 998410#L25 assume !(~n <= 0); 998230#L26 call #t~ret0 := fact(~n - 1);< 998237#factENTRY ~n := #in~n; 998238#L25 assume !(~n <= 0); 998218#L26 call #t~ret0 := fact(~n - 1);< 998232#factENTRY ~n := #in~n; 998234#L25 assume ~n <= 0;#res := 1; 998233#factFINAL assume true; 998217#factEXIT >#66#return; 998223#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 998391#factFINAL assume true; 998378#factEXIT >#66#return; 998374#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 998367#factFINAL assume true; 998356#factEXIT >#66#return; 998216#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 998180#factFINAL assume true; 998109#factEXIT >#66#return; 998142#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 999238#factFINAL assume true; 999150#factEXIT >#66#return; 999153#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 999262#factFINAL assume true; 999259#factEXIT >#68#return; 998739#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 998773#factENTRY ~n := #in~n; 998771#L25 assume !(~n <= 0); 998122#L26 call #t~ret0 := fact(~n - 1);< 998286#factENTRY ~n := #in~n; 998283#L25 assume !(~n <= 0); 998140#L26 call #t~ret0 := fact(~n - 1);< 998257#factENTRY ~n := #in~n; 998253#L25 assume !(~n <= 0); 998220#L26 call #t~ret0 := fact(~n - 1);< 998248#factENTRY ~n := #in~n; 998246#L25 assume !(~n <= 0); 998221#L26 call #t~ret0 := fact(~n - 1);< 998239#factENTRY ~n := #in~n; 998234#L25 assume ~n <= 0;#res := 1; 998233#factFINAL assume true; 998217#factEXIT >#66#return; 998223#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 998391#factFINAL assume true; 998378#factEXIT >#66#return; 998374#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 998367#factFINAL assume true; 998356#factEXIT >#66#return; 998216#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 998180#factFINAL assume true; 998109#factEXIT >#66#return; 998143#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 999237#factFINAL assume true; 999236#factEXIT >#70#return; 998846#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 998865#factENTRY ~n := #in~n; 998862#L25 assume !(~n <= 0); 998123#L26 call #t~ret0 := fact(~n - 1);< 998724#factENTRY ~n := #in~n; 998294#L25 assume ~n <= 0;#res := 1; 998522#factFINAL assume true; 998514#factEXIT >#66#return; 998517#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 999157#factFINAL assume true; 999104#factEXIT >#72#return; 999115#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; 1002679#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1002680#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1002671#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1002672#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; 998428#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 998639#factENTRY ~n := #in~n; 998629#L25 assume !(~n <= 0); 998416#L26 call #t~ret0 := fact(~n - 1);< 998421#factENTRY ~n := #in~n; 998419#L25 assume !(~n <= 0); 998136#L26 call #t~ret0 := fact(~n - 1);< 998413#factENTRY ~n := #in~n; 998412#L25 assume !(~n <= 0); 998358#L26 call #t~ret0 := fact(~n - 1);< 998362#factENTRY ~n := #in~n; 998410#L25 assume !(~n <= 0); 998230#L26 call #t~ret0 := fact(~n - 1);< 998237#factENTRY ~n := #in~n; 998238#L25 assume !(~n <= 0); 998218#L26 call #t~ret0 := fact(~n - 1);< 998232#factENTRY ~n := #in~n; 998234#L25 assume ~n <= 0;#res := 1; 998233#factFINAL assume true; 998217#factEXIT >#66#return; 998223#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 998391#factFINAL assume true; 998378#factEXIT >#66#return; 998374#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 998367#factFINAL assume true; 998356#factEXIT >#66#return; 998216#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 998180#factFINAL assume true; 998109#factEXIT >#66#return; 998142#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 999238#factFINAL assume true; 999150#factEXIT >#66#return; 999153#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 999262#factFINAL assume true; 999259#factEXIT >#68#return; 998741#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 998773#factENTRY ~n := #in~n; 998771#L25 assume !(~n <= 0); 998122#L26 call #t~ret0 := fact(~n - 1);< 998286#factENTRY ~n := #in~n; 998283#L25 assume !(~n <= 0); 998140#L26 call #t~ret0 := fact(~n - 1);< 998257#factENTRY ~n := #in~n; 998253#L25 assume !(~n <= 0); 998220#L26 call #t~ret0 := fact(~n - 1);< 998248#factENTRY ~n := #in~n; 998246#L25 assume !(~n <= 0); 998221#L26 call #t~ret0 := fact(~n - 1);< 998239#factENTRY ~n := #in~n; 998238#L25 assume !(~n <= 0); 998218#L26 call #t~ret0 := fact(~n - 1);< 998232#factENTRY ~n := #in~n; 998234#L25 assume ~n <= 0;#res := 1; 998233#factFINAL assume true; 998217#factEXIT >#66#return; 998223#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 998391#factFINAL assume true; 998378#factEXIT >#66#return; 998374#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 998367#factFINAL assume true; 998356#factEXIT >#66#return; 998216#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 998180#factFINAL assume true; 998109#factEXIT >#66#return; 998142#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 999238#factFINAL assume true; 999150#factEXIT >#66#return; 999151#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 999300#factFINAL assume true; 999160#factEXIT >#70#return; 998075#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 998093#factENTRY ~n := #in~n; 998095#L25 assume ~n <= 0;#res := 1; 998094#factFINAL assume true; 998025#factEXIT >#72#return; 997998#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; 997994#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 997995#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1000766#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1000758#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; 999868#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1000748#factENTRY ~n := #in~n; 1001139#L25 assume !(~n <= 0); 999917#L26 call #t~ret0 := fact(~n - 1);< 999993#factENTRY ~n := #in~n; 1000657#L25 assume !(~n <= 0); 999930#L26 call #t~ret0 := fact(~n - 1);< 1000030#factENTRY ~n := #in~n; 1001745#L25 assume !(~n <= 0); 999919#L26 call #t~ret0 := fact(~n - 1);< 1000038#factENTRY ~n := #in~n; 1001786#L25 assume !(~n <= 0); 999926#L26 call #t~ret0 := fact(~n - 1);< 1000107#factENTRY ~n := #in~n; 1000127#L25 assume !(~n <= 0); 999924#L26 call #t~ret0 := fact(~n - 1);< 1000122#factENTRY ~n := #in~n; 1000127#L25 assume !(~n <= 0); 999924#L26 call #t~ret0 := fact(~n - 1);< 1000122#factENTRY ~n := #in~n; 1000129#L25 assume ~n <= 0;#res := 1; 1000128#factFINAL assume true; 1000121#factEXIT >#66#return; 1000120#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1000119#factFINAL assume true; 1000115#factEXIT >#66#return; 1000113#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1000108#factFINAL assume true; 1000105#factEXIT >#66#return; 1000104#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1000093#factFINAL assume true; 1000036#factEXIT >#66#return; 1000034#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1000031#factFINAL assume true; 1000028#factEXIT >#66#return; 1000026#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 999992#factFINAL assume true; 999988#factEXIT >#66#return; 999989#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1000769#factFINAL assume true; 1000747#factEXIT >#74#return; 999640#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 999642#factENTRY ~n := #in~n; 1001675#L25 assume !(~n <= 0); 997925#L26 call #t~ret0 := fact(~n - 1);< 1000301#factENTRY ~n := #in~n; 1000299#L25 assume !(~n <= 0); 1000293#L26 call #t~ret0 := fact(~n - 1);< 1000298#factENTRY ~n := #in~n; 1000295#L25 assume !(~n <= 0); 999703#L26 call #t~ret0 := fact(~n - 1);< 1000292#factENTRY ~n := #in~n; 1000290#L25 assume !(~n <= 0); 999701#L26 call #t~ret0 := fact(~n - 1);< 1000282#factENTRY ~n := #in~n; 999790#L25 assume ~n <= 0;#res := 1; 999788#factFINAL assume true; 999777#factEXIT >#66#return; 999776#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 999774#factFINAL assume true; 999696#factEXIT >#66#return; 999707#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1001138#factFINAL assume true; 1001135#factEXIT >#66#return; 1001136#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1001388#factFINAL assume true; 1001049#factEXIT >#66#return; 1001051#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1001674#factFINAL assume true; 1001673#factEXIT >#76#return; 999634#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 999637#factENTRY ~n := #in~n; 999686#L25 assume !(~n <= 0); 999682#L26 call #t~ret0 := fact(~n - 1);< 999685#factENTRY ~n := #in~n; 999691#L25 assume ~n <= 0;#res := 1; 999687#factFINAL assume true; 999681#factEXIT >#66#return; 999679#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 999676#factFINAL assume true; 999632#factEXIT >#78#return; 999631#L30-8 [2022-11-20 09:44:31,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:44:31,925 INFO L85 PathProgramCache]: Analyzing trace with hash 291195713, now seen corresponding path program 54 times [2022-11-20 09:44:31,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:44:31,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050886492] [2022-11-20 09:44:31,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:44:31,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:44:31,957 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:44:31,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1011782646] [2022-11-20 09:44:31,957 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-20 09:44:31,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:44:31,958 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:44:31,968 INFO L229 MonitoredProcess]: Starting monitored process 371 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:44:31,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (371)] Waiting until timeout for monitored process [2022-11-20 09:44:33,020 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-11-20 09:44:33,021 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:44:33,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 09:44:33,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:44:33,194 INFO L134 CoverageAnalysis]: Checked inductivity of 38477 backedges. 7117 proven. 48 refuted. 0 times theorem prover too weak. 31312 trivial. 0 not checked. [2022-11-20 09:44:33,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:44:34,033 INFO L134 CoverageAnalysis]: Checked inductivity of 38477 backedges. 391 proven. 48 refuted. 0 times theorem prover too weak. 38038 trivial. 0 not checked. [2022-11-20 09:44:34,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:44:34,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050886492] [2022-11-20 09:44:34,033 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 09:44:34,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011782646] [2022-11-20 09:44:34,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011782646] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:44:34,033 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:44:34,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2022-11-20 09:44:34,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304025656] [2022-11-20 09:44:34,034 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:44:34,035 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-20 09:44:34,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:44:34,035 INFO L85 PathProgramCache]: Analyzing trace with hash -198894549, now seen corresponding path program 49 times [2022-11-20 09:44:34,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:44:34,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436257926] [2022-11-20 09:44:34,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:44:34,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:44:34,053 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:44:34,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [951935237] [2022-11-20 09:44:34,053 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 09:44:34,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:44:34,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:44:34,055 INFO L229 MonitoredProcess]: Starting monitored process 372 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:44:34,058 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (372)] Waiting until timeout for monitored process [2022-11-20 09:44:34,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:44:34,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 1217 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-20 09:44:34,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:44:35,374 INFO L134 CoverageAnalysis]: Checked inductivity of 21859 backedges. 2612 proven. 1950 refuted. 0 times theorem prover too weak. 17297 trivial. 0 not checked. [2022-11-20 09:44:35,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:44:38,364 INFO L134 CoverageAnalysis]: Checked inductivity of 21859 backedges. 1757 proven. 2055 refuted. 0 times theorem prover too weak. 18047 trivial. 0 not checked. [2022-11-20 09:44:38,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:44:38,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436257926] [2022-11-20 09:44:38,365 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 09:44:38,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951935237] [2022-11-20 09:44:38,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951935237] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:44:38,365 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:44:38,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 25] total 28 [2022-11-20 09:44:38,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544110274] [2022-11-20 09:44:38,366 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:44:38,366 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 09:44:38,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:44:38,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-20 09:44:38,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=641, Unknown=0, NotChecked=0, Total=756 [2022-11-20 09:44:38,367 INFO L87 Difference]: Start difference. First operand 6987 states and 11670 transitions. cyclomatic complexity: 4748 Second operand has 28 states, 25 states have (on average 2.8) internal successors, (70), 28 states have internal predecessors, (70), 17 states have call successors, (22), 2 states have call predecessors, (22), 12 states have return successors, (28), 13 states have call predecessors, (28), 17 states have call successors, (28) [2022-11-20 09:44:40,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:44:40,828 INFO L93 Difference]: Finished difference Result 7589 states and 12693 transitions. [2022-11-20 09:44:40,828 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7589 states and 12693 transitions. [2022-11-20 09:44:40,882 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1291 [2022-11-20 09:44:40,951 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7589 states to 7585 states and 12685 transitions. [2022-11-20 09:44:40,951 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 690 [2022-11-20 09:44:40,952 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 690 [2022-11-20 09:44:40,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7585 states and 12685 transitions. [2022-11-20 09:44:40,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 09:44:40,952 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7585 states and 12685 transitions. [2022-11-20 09:44:40,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7585 states and 12685 transitions. [2022-11-20 09:44:41,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7585 to 6993. [2022-11-20 09:44:41,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6993 states, 4260 states have (on average 1.0446009389671362) internal successors, (4450), 4248 states have internal predecessors, (4450), 2101 states have call successors, (2181), 735 states have call predecessors, (2181), 632 states have return successors, (5005), 2009 states have call predecessors, (5005), 2101 states have call successors, (5005) [2022-11-20 09:44:41,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6993 states to 6993 states and 11636 transitions. [2022-11-20 09:44:41,104 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6993 states and 11636 transitions. [2022-11-20 09:44:41,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-20 09:44:41,105 INFO L428 stractBuchiCegarLoop]: Abstraction has 6993 states and 11636 transitions. [2022-11-20 09:44:41,105 INFO L335 stractBuchiCegarLoop]: ======== Iteration 77 ============ [2022-11-20 09:44:41,106 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6993 states and 11636 transitions. [2022-11-20 09:44:41,125 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1291 [2022-11-20 09:44:41,125 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 09:44:41,125 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 09:44:41,129 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [127, 127, 76, 76, 76, 76, 51, 17, 16, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 7, 7, 7, 7, 7, 6, 6, 4, 3, 3, 1, 1, 1, 1] [2022-11-20 09:44:41,129 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [93, 93, 72, 72, 72, 72, 21, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:44:41,130 INFO L748 eck$LassoCheckResult]: Stem: 1020881#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1020855#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; 1020856#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 1020880#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; 1020907#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1026312#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1026257#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; 1020845#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1020846#factENTRY ~n := #in~n; 1026450#L25 assume ~n <= 0;#res := 1; 1026448#factFINAL assume true; 1026446#factEXIT >#68#return; 1020902#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1020903#factENTRY ~n := #in~n; 1026298#L25 assume ~n <= 0;#res := 1; 1026296#factFINAL assume true; 1026295#factEXIT >#70#return; 1020819#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1020820#factENTRY ~n := #in~n; 1026453#L25 assume ~n <= 0;#res := 1; 1026452#factFINAL assume true; 1026451#factEXIT >#72#return; 1020874#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; 1020875#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1020877#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1026987#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1026986#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; 1020791#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1020792#factENTRY ~n := #in~n; 1027226#L25 assume !(~n <= 0); 1027224#L26 call #t~ret0 := fact(~n - 1);< 1027225#factENTRY ~n := #in~n; 1027228#L25 assume ~n <= 0;#res := 1; 1027227#factFINAL assume true; 1027223#factEXIT >#66#return; 1027221#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1027219#factFINAL assume true; 1027218#factEXIT >#74#return; 1027216#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1027217#factENTRY ~n := #in~n; 1027222#L25 assume ~n <= 0;#res := 1; 1027220#factFINAL assume true; 1027215#factEXIT >#76#return; 1027208#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1027211#factENTRY ~n := #in~n; 1027248#L25 assume !(~n <= 0); 1027245#L26 call #t~ret0 := fact(~n - 1);< 1027246#factENTRY ~n := #in~n; 1027268#L25 assume ~n <= 0;#res := 1; 1027253#factFINAL assume true; 1027244#factEXIT >#66#return; 1027243#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1027232#factFINAL assume true; 1027207#factEXIT >#78#return; 1027209#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; 1027250#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1027174#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1027173#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1027169#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; 1027080#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1027086#factENTRY ~n := #in~n; 1027111#L25 assume !(~n <= 0); 1027096#L26 call #t~ret0 := fact(~n - 1);< 1027102#factENTRY ~n := #in~n; 1027135#L25 assume !(~n <= 0); 1027099#L26 call #t~ret0 := fact(~n - 1);< 1027124#factENTRY ~n := #in~n; 1027129#L25 assume ~n <= 0;#res := 1; 1027128#factFINAL assume true; 1027123#factEXIT >#66#return; 1027114#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1027105#factFINAL assume true; 1027095#factEXIT >#66#return; 1027092#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1027089#factFINAL assume true; 1027078#factEXIT >#74#return; 1027084#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1027075#factENTRY ~n := #in~n; 1027618#L25 assume ~n <= 0;#res := 1; 1027617#factFINAL assume true; 1027614#factEXIT >#76#return; 1027594#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1027605#factENTRY ~n := #in~n; 1027598#L25 assume !(~n <= 0); 1020806#L26 call #t~ret0 := fact(~n - 1);< 1027011#factENTRY ~n := #in~n; 1027583#L25 assume !(~n <= 0); 1020803#L26 call #t~ret0 := fact(~n - 1);< 1027604#factENTRY ~n := #in~n; 1027611#L25 assume ~n <= 0;#res := 1; 1027609#factFINAL assume true; 1027603#factEXIT >#66#return; 1027597#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1027589#factFINAL assume true; 1027580#factEXIT >#66#return; 1027581#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1027632#factFINAL assume true; 1027631#factEXIT >#78#return; 1027630#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; 1027629#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1027628#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1027627#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1027626#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; 1026714#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1026715#factENTRY ~n := #in~n; 1026735#L25 assume !(~n <= 0); 1026726#L26 call #t~ret0 := fact(~n - 1);< 1026889#factENTRY ~n := #in~n; 1026890#L25 assume !(~n <= 0); 1026727#L26 call #t~ret0 := fact(~n - 1);< 1026759#factENTRY ~n := #in~n; 1026890#L25 assume !(~n <= 0); 1026727#L26 call #t~ret0 := fact(~n - 1);< 1026759#factENTRY ~n := #in~n; 1026897#L25 assume ~n <= 0;#res := 1; 1026898#factFINAL assume true; 1026891#factEXIT >#66#return; 1026892#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1026884#factFINAL assume true; 1026885#factEXIT >#66#return; 1026736#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1026737#factFINAL assume true; 1026725#factEXIT >#66#return; 1026723#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1026724#factFINAL assume true; 1026809#factEXIT >#74#return; 1026788#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1026789#factENTRY ~n := #in~n; 1026807#L25 assume ~n <= 0;#res := 1; 1026806#factFINAL assume true; 1026787#factEXIT >#76#return; 1020887#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1026782#factENTRY ~n := #in~n; 1026780#L25 assume !(~n <= 0); 1026743#L26 call #t~ret0 := fact(~n - 1);< 1026779#factENTRY ~n := #in~n; 1026825#L25 assume !(~n <= 0); 1026741#L26 call #t~ret0 := fact(~n - 1);< 1026761#factENTRY ~n := #in~n; 1026824#L25 assume !(~n <= 0); 1026748#L26 call #t~ret0 := fact(~n - 1);< 1026818#factENTRY ~n := #in~n; 1026827#L25 assume ~n <= 0;#res := 1; 1026826#factFINAL assume true; 1026817#factEXIT >#66#return; 1026815#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1026813#factFINAL assume true; 1026812#factEXIT >#66#return; 1026811#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1026810#factFINAL assume true; 1026792#factEXIT >#66#return; 1020886#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1020888#factFINAL assume true; 1026876#factEXIT >#78#return; 1025181#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; 1025180#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1025179#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1025178#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 1025176#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 1025174#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1025171#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1025140#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; 1025131#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1025133#factENTRY ~n := #in~n; 1025145#L25 assume !(~n <= 0); 1025142#L26 call #t~ret0 := fact(~n - 1);< 1025143#factENTRY ~n := #in~n; 1025146#L25 assume ~n <= 0;#res := 1; 1025144#factFINAL assume true; 1025141#factEXIT >#66#return; 1025139#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1025136#factFINAL assume true; 1025130#factEXIT >#68#return; 1025124#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1025126#factENTRY ~n := #in~n; 1025177#L25 assume ~n <= 0;#res := 1; 1025175#factFINAL assume true; 1025123#factEXIT >#70#return; 1025118#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1025121#factENTRY ~n := #in~n; 1025195#L25 assume !(~n <= 0); 1025193#L26 call #t~ret0 := fact(~n - 1);< 1025194#factENTRY ~n := #in~n; 1025204#L25 assume ~n <= 0;#res := 1; 1025203#factFINAL assume true; 1025192#factEXIT >#66#return; 1025191#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1025182#factFINAL assume true; 1025117#factEXIT >#72#return; 1025120#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; 1025212#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1025210#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1025208#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1025207#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; 1025077#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1025078#factENTRY ~n := #in~n; 1025086#L25 assume !(~n <= 0); 1025057#L26 call #t~ret0 := fact(~n - 1);< 1025063#factENTRY ~n := #in~n; 1025069#L25 assume ~n <= 0;#res := 1; 1025065#factFINAL assume true; 1025056#factEXIT >#66#return; 1025060#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1025084#factFINAL assume true; 1025081#factEXIT >#68#return; 1025066#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1025079#factENTRY ~n := #in~n; 1025135#L25 assume !(~n <= 0); 1025128#L26 call #t~ret0 := fact(~n - 1);< 1025129#factENTRY ~n := #in~n; 1025138#L25 assume ~n <= 0;#res := 1; 1025134#factFINAL assume true; 1025127#factEXIT >#66#return; 1025122#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1025116#factFINAL assume true; 1025108#factEXIT >#70#return; 1025100#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1025102#factENTRY ~n := #in~n; 1025200#L25 assume ~n <= 0;#res := 1; 1025199#factFINAL assume true; 1025098#factEXIT >#72#return; 1025101#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; 1025202#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1025201#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1025186#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1025187#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; 1025028#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1025088#factENTRY ~n := #in~n; 1025087#L25 assume !(~n <= 0); 1025071#L26 call #t~ret0 := fact(~n - 1);< 1025083#factENTRY ~n := #in~n; 1025080#L25 assume !(~n <= 0); 1025072#L26 call #t~ret0 := fact(~n - 1);< 1025076#factENTRY ~n := #in~n; 1025211#L25 assume ~n <= 0;#res := 1; 1025209#factFINAL assume true; 1025075#factEXIT >#66#return; 1025070#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1025073#factFINAL assume true; 1025085#factEXIT >#66#return; 1025054#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1025055#factFINAL assume true; 1025027#factEXIT >#74#return; 1024221#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1024223#factENTRY ~n := #in~n; 1025760#L25 assume !(~n <= 0); 1024825#L26 call #t~ret0 := fact(~n - 1);< 1024829#factENTRY ~n := #in~n; 1024836#L25 assume ~n <= 0;#res := 1; 1024830#factFINAL assume true; 1024822#factEXIT >#66#return; 1024828#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1026681#factFINAL assume true; 1026679#factEXIT >#76#return; 1024216#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1024218#factENTRY ~n := #in~n; 1024233#L25 assume !(~n <= 0); 1024229#L26 call #t~ret0 := fact(~n - 1);< 1024230#factENTRY ~n := #in~n; 1024235#L25 assume ~n <= 0;#res := 1; 1024232#factFINAL assume true; 1024228#factEXIT >#66#return; 1024225#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1024219#factFINAL assume true; 1024214#factEXIT >#78#return; 1024212#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; 1024208#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1024206#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1024204#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1024201#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; 1023862#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1023864#factENTRY ~n := #in~n; 1023876#L25 assume !(~n <= 0); 1023873#L26 call #t~ret0 := fact(~n - 1);< 1023874#factENTRY ~n := #in~n; 1023882#L25 assume !(~n <= 0); 1023872#L26 call #t~ret0 := fact(~n - 1);< 1023881#factENTRY ~n := #in~n; 1023882#L25 assume !(~n <= 0); 1023872#L26 call #t~ret0 := fact(~n - 1);< 1023881#factENTRY ~n := #in~n; 1023891#L25 assume ~n <= 0;#res := 1; 1023890#factFINAL assume true; 1023889#factEXIT >#66#return; 1023887#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1023886#factFINAL assume true; 1023880#factEXIT >#66#return; 1023879#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1023878#factFINAL assume true; 1023871#factEXIT >#66#return; 1023869#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1023867#factFINAL assume true; 1023859#factEXIT >#74#return; 1021898#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1022073#factENTRY ~n := #in~n; 1022352#L25 assume !(~n <= 0); 1022345#L26 call #t~ret0 := fact(~n - 1);< 1022347#factENTRY ~n := #in~n; 1022552#L25 assume ~n <= 0;#res := 1; 1022351#factFINAL assume true; 1022343#factEXIT >#66#return; 1022346#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1023762#factFINAL assume true; 1021896#factEXIT >#76#return; 1021894#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1021834#factENTRY ~n := #in~n; 1022146#L25 assume !(~n <= 0); 1022049#L26 call #t~ret0 := fact(~n - 1);< 1022056#factENTRY ~n := #in~n; 1022348#L25 assume !(~n <= 0); 1022048#L26 call #t~ret0 := fact(~n - 1);< 1022223#factENTRY ~n := #in~n; 1022070#L25 assume ~n <= 0;#res := 1; 1022068#factFINAL assume true; 1022064#factEXIT >#66#return; 1022063#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1022057#factFINAL assume true; 1022043#factEXIT >#66#return; 1022017#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021893#factFINAL assume true; 1021895#factEXIT >#78#return; 1021832#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; 1026171#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1026169#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1026167#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 1020879#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 1020870#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1020871#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1025614#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; 1021791#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1021795#factENTRY ~n := #in~n; 1021794#L25 assume !(~n <= 0); 1021776#L26 call #t~ret0 := fact(~n - 1);< 1021778#factENTRY ~n := #in~n; 1021787#L25 assume !(~n <= 0); 1021777#L26 call #t~ret0 := fact(~n - 1);< 1021786#factENTRY ~n := #in~n; 1021817#L25 assume ~n <= 0;#res := 1; 1021815#factFINAL assume true; 1021805#factEXIT >#66#return; 1021803#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021788#factFINAL assume true; 1021784#factEXIT >#66#return; 1021785#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021802#factFINAL assume true; 1021797#factEXIT >#68#return; 1021799#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1021711#factENTRY ~n := #in~n; 1026252#L25 assume ~n <= 0;#res := 1; 1026251#factFINAL assume true; 1026181#factEXIT >#70#return; 1026182#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1026213#factENTRY ~n := #in~n; 1026212#L25 assume !(~n <= 0); 1026204#L26 call #t~ret0 := fact(~n - 1);< 1026210#factENTRY ~n := #in~n; 1026414#L25 assume !(~n <= 0); 1026202#L26 call #t~ret0 := fact(~n - 1);< 1026413#factENTRY ~n := #in~n; 1026222#L25 assume ~n <= 0;#res := 1; 1026221#factFINAL assume true; 1026216#factEXIT >#66#return; 1026215#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1026209#factFINAL assume true; 1026201#factEXIT >#66#return; 1026205#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1026242#factFINAL assume true; 1026240#factEXIT >#72#return; 1026241#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; 1026397#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1026394#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1026392#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1026249#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; 1026012#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1026016#factENTRY ~n := #in~n; 1026406#L25 assume !(~n <= 0); 1026403#L26 call #t~ret0 := fact(~n - 1);< 1026404#factENTRY ~n := #in~n; 1026411#L25 assume !(~n <= 0); 1026409#L26 call #t~ret0 := fact(~n - 1);< 1026410#factENTRY ~n := #in~n; 1026449#L25 assume ~n <= 0;#res := 1; 1026447#factFINAL assume true; 1026408#factEXIT >#66#return; 1026407#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1026405#factFINAL assume true; 1026402#factEXIT >#66#return; 1026247#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1026094#factFINAL assume true; 1026009#factEXIT >#68#return; 1026014#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1026110#factENTRY ~n := #in~n; 1026238#L25 assume !(~n <= 0); 1026228#L26 call #t~ret0 := fact(~n - 1);< 1026231#factENTRY ~n := #in~n; 1026244#L25 assume ~n <= 0;#res := 1; 1026236#factFINAL assume true; 1026227#factEXIT >#66#return; 1026230#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1026248#factFINAL assume true; 1026109#factEXIT >#70#return; 1026105#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1026108#factENTRY ~n := #in~n; 1026232#L25 assume !(~n <= 0); 1026229#L26 call #t~ret0 := fact(~n - 1);< 1026231#factENTRY ~n := #in~n; 1026244#L25 assume ~n <= 0;#res := 1; 1026236#factFINAL assume true; 1026227#factEXIT >#66#return; 1026226#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1026225#factFINAL assume true; 1026104#factEXIT >#72#return; 1026103#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; 1026102#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1026100#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1026099#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1026097#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; 1026011#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1026016#factENTRY ~n := #in~n; 1026406#L25 assume !(~n <= 0); 1026403#L26 call #t~ret0 := fact(~n - 1);< 1026404#factENTRY ~n := #in~n; 1026411#L25 assume !(~n <= 0); 1026409#L26 call #t~ret0 := fact(~n - 1);< 1026410#factENTRY ~n := #in~n; 1026449#L25 assume ~n <= 0;#res := 1; 1026447#factFINAL assume true; 1026408#factEXIT >#66#return; 1026407#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1026405#factFINAL assume true; 1026402#factEXIT >#66#return; 1026247#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1026094#factFINAL assume true; 1026009#factEXIT >#68#return; 1026007#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1026008#factENTRY ~n := #in~n; 1026214#L25 assume !(~n <= 0); 1026068#L26 call #t~ret0 := fact(~n - 1);< 1026073#factENTRY ~n := #in~n; 1026319#L25 assume !(~n <= 0); 1026315#L26 call #t~ret0 := fact(~n - 1);< 1026317#factENTRY ~n := #in~n; 1026323#L25 assume ~n <= 0;#res := 1; 1026318#factFINAL assume true; 1026314#factEXIT >#66#return; 1026311#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1026310#factFINAL assume true; 1026065#factEXIT >#66#return; 1026072#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1026074#factFINAL assume true; 1026005#factEXIT >#70#return; 1026002#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1026004#factENTRY ~n := #in~n; 1026144#L25 assume ~n <= 0;#res := 1; 1026063#factFINAL assume true; 1026000#factEXIT >#72#return; 1025999#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; 1025997#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1025996#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1025995#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1025857#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; 1025852#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1025853#factENTRY ~n := #in~n; 1025876#L25 assume !(~n <= 0); 1025868#L26 call #t~ret0 := fact(~n - 1);< 1025872#factENTRY ~n := #in~n; 1025880#L25 assume !(~n <= 0); 1025869#L26 call #t~ret0 := fact(~n - 1);< 1025878#factENTRY ~n := #in~n; 1025880#L25 assume !(~n <= 0); 1025869#L26 call #t~ret0 := fact(~n - 1);< 1025878#factENTRY ~n := #in~n; 1025884#L25 assume ~n <= 0;#res := 1; 1025883#factFINAL assume true; 1025882#factEXIT >#66#return; 1025881#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1025879#factFINAL assume true; 1025877#factEXIT >#66#return; 1025875#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1025873#factFINAL assume true; 1025867#factEXIT >#66#return; 1025871#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1026301#factFINAL assume true; 1025851#factEXIT >#74#return; 1025831#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1025832#factENTRY ~n := #in~n; 1026300#L25 assume !(~n <= 0); 1025805#L26 call #t~ret0 := fact(~n - 1);< 1025846#factENTRY ~n := #in~n; 1026360#L25 assume !(~n <= 0); 1026349#L26 call #t~ret0 := fact(~n - 1);< 1026351#factENTRY ~n := #in~n; 1026364#L25 assume ~n <= 0;#res := 1; 1026363#factFINAL assume true; 1026348#factEXIT >#66#return; 1026346#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1026259#factFINAL assume true; 1025791#factEXIT >#66#return; 1025812#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1025835#factFINAL assume true; 1025830#factEXIT >#76#return; 1025822#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1025827#factENTRY ~n := #in~n; 1025825#L25 assume !(~n <= 0); 1025820#L26 call #t~ret0 := fact(~n - 1);< 1025823#factENTRY ~n := #in~n; 1026286#L25 assume ~n <= 0;#res := 1; 1026284#factFINAL assume true; 1025819#factEXIT >#66#return; 1025821#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1025836#factFINAL assume true; 1025834#factEXIT >#78#return; 1025671#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; 1025669#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1025667#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1025665#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 1025664#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 1025647#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1022143#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1021911#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; 1021759#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1021760#factENTRY ~n := #in~n; 1021779#L25 assume !(~n <= 0); 1021775#L26 call #t~ret0 := fact(~n - 1);< 1021778#factENTRY ~n := #in~n; 1021787#L25 assume !(~n <= 0); 1021777#L26 call #t~ret0 := fact(~n - 1);< 1021786#factENTRY ~n := #in~n; 1021787#L25 assume !(~n <= 0); 1021777#L26 call #t~ret0 := fact(~n - 1);< 1021786#factENTRY ~n := #in~n; 1021817#L25 assume ~n <= 0;#res := 1; 1021815#factFINAL assume true; 1021805#factEXIT >#66#return; 1021803#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021788#factFINAL assume true; 1021784#factEXIT >#66#return; 1021781#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021780#factFINAL assume true; 1021774#factEXIT >#66#return; 1021773#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021771#factFINAL assume true; 1021757#factEXIT >#68#return; 1021707#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1021710#factENTRY ~n := #in~n; 1021796#L25 assume ~n <= 0;#res := 1; 1021793#factFINAL assume true; 1021703#factEXIT >#70#return; 1021708#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1021746#factENTRY ~n := #in~n; 1021761#L25 assume !(~n <= 0); 1021752#L26 call #t~ret0 := fact(~n - 1);< 1021756#factENTRY ~n := #in~n; 1021917#L25 assume !(~n <= 0); 1021768#L26 call #t~ret0 := fact(~n - 1);< 1021783#factENTRY ~n := #in~n; 1024531#L25 assume !(~n <= 0); 1021807#L26 call #t~ret0 := fact(~n - 1);< 1021808#factENTRY ~n := #in~n; 1021813#L25 assume ~n <= 0;#res := 1; 1021812#factFINAL assume true; 1021806#factEXIT >#66#return; 1021804#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021782#factFINAL assume true; 1021765#factEXIT >#66#return; 1021769#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021822#factFINAL assume true; 1021749#factEXIT >#66#return; 1021748#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021747#factFINAL assume true; 1021744#factEXIT >#72#return; 1021743#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; 1021741#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1021737#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1021736#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1021735#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; 1021537#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1021614#factENTRY ~n := #in~n; 1021598#L25 assume !(~n <= 0); 1021508#L26 call #t~ret0 := fact(~n - 1);< 1021515#factENTRY ~n := #in~n; 1023211#L25 assume !(~n <= 0); 1021192#L26 call #t~ret0 := fact(~n - 1);< 1021200#factENTRY ~n := #in~n; 1021199#L25 assume !(~n <= 0); 1021181#L26 call #t~ret0 := fact(~n - 1);< 1021193#factENTRY ~n := #in~n; 1021195#L25 assume ~n <= 0;#res := 1; 1021194#factFINAL assume true; 1021178#factEXIT >#66#return; 1021186#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021617#factFINAL assume true; 1021599#factEXIT >#66#return; 1021593#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021518#factFINAL assume true; 1021506#factEXIT >#66#return; 1021513#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021645#factFINAL assume true; 1021638#factEXIT >#68#return; 1021639#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1021718#factENTRY ~n := #in~n; 1021842#L25 assume !(~n <= 0); 1021203#L26 call #t~ret0 := fact(~n - 1);< 1021839#factENTRY ~n := #in~n; 1021264#L25 assume ~n <= 0;#res := 1; 1021866#factFINAL assume true; 1021719#factEXIT >#66#return; 1021724#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021836#factFINAL assume true; 1021717#factEXIT >#70#return; 1021620#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1021655#factENTRY ~n := #in~n; 1021647#L25 assume !(~n <= 0); 1021190#L26 call #t~ret0 := fact(~n - 1);< 1021622#factENTRY ~n := #in~n; 1021199#L25 assume !(~n <= 0); 1021181#L26 call #t~ret0 := fact(~n - 1);< 1021193#factENTRY ~n := #in~n; 1021195#L25 assume ~n <= 0;#res := 1; 1021194#factFINAL assume true; 1021178#factEXIT >#66#return; 1021186#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021617#factFINAL assume true; 1021599#factEXIT >#66#return; 1021604#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021801#factFINAL assume true; 1021715#factEXIT >#72#return; 1021716#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; 1021734#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1021733#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1021732#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1021731#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; 1021538#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1021614#factENTRY ~n := #in~n; 1021598#L25 assume !(~n <= 0); 1021508#L26 call #t~ret0 := fact(~n - 1);< 1021515#factENTRY ~n := #in~n; 1023211#L25 assume !(~n <= 0); 1021192#L26 call #t~ret0 := fact(~n - 1);< 1021200#factENTRY ~n := #in~n; 1021199#L25 assume !(~n <= 0); 1021181#L26 call #t~ret0 := fact(~n - 1);< 1021193#factENTRY ~n := #in~n; 1021195#L25 assume ~n <= 0;#res := 1; 1021194#factFINAL assume true; 1021178#factEXIT >#66#return; 1021186#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021617#factFINAL assume true; 1021599#factEXIT >#66#return; 1021593#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021518#factFINAL assume true; 1021506#factEXIT >#66#return; 1021513#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021645#factFINAL assume true; 1021638#factEXIT >#68#return; 1021521#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1021605#factENTRY ~n := #in~n; 1021594#L25 assume !(~n <= 0); 1021201#L26 call #t~ret0 := fact(~n - 1);< 1021208#factENTRY ~n := #in~n; 1021206#L25 assume !(~n <= 0); 1021180#L26 call #t~ret0 := fact(~n - 1);< 1021198#factENTRY ~n := #in~n; 1021195#L25 assume ~n <= 0;#res := 1; 1021194#factFINAL assume true; 1021178#factEXIT >#66#return; 1021186#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021617#factFINAL assume true; 1021599#factEXIT >#66#return; 1021600#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021726#factFINAL assume true; 1021690#factEXIT >#70#return; 1021665#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1021668#factENTRY ~n := #in~n; 1021887#L25 assume !(~n <= 0); 1021721#L26 call #t~ret0 := fact(~n - 1);< 1021725#factENTRY ~n := #in~n; 1021264#L25 assume ~n <= 0;#res := 1; 1021866#factFINAL assume true; 1021719#factEXIT >#66#return; 1021689#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021686#factFINAL assume true; 1021664#factEXIT >#72#return; 1021663#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; 1021654#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1021646#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1021642#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1021641#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; 1021539#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1021614#factENTRY ~n := #in~n; 1021598#L25 assume !(~n <= 0); 1021508#L26 call #t~ret0 := fact(~n - 1);< 1021515#factENTRY ~n := #in~n; 1023211#L25 assume !(~n <= 0); 1021192#L26 call #t~ret0 := fact(~n - 1);< 1021200#factENTRY ~n := #in~n; 1021199#L25 assume !(~n <= 0); 1021181#L26 call #t~ret0 := fact(~n - 1);< 1021193#factENTRY ~n := #in~n; 1021195#L25 assume ~n <= 0;#res := 1; 1021194#factFINAL assume true; 1021178#factEXIT >#66#return; 1021186#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021617#factFINAL assume true; 1021599#factEXIT >#66#return; 1021593#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021518#factFINAL assume true; 1021506#factEXIT >#66#return; 1021513#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021645#factFINAL assume true; 1021638#factEXIT >#68#return; 1021519#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1021605#factENTRY ~n := #in~n; 1021594#L25 assume !(~n <= 0); 1021201#L26 call #t~ret0 := fact(~n - 1);< 1021208#factENTRY ~n := #in~n; 1021206#L25 assume !(~n <= 0); 1021180#L26 call #t~ret0 := fact(~n - 1);< 1021198#factENTRY ~n := #in~n; 1021195#L25 assume ~n <= 0;#res := 1; 1021194#factFINAL assume true; 1021178#factEXIT >#66#return; 1021186#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021617#factFINAL assume true; 1021599#factEXIT >#66#return; 1021600#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021726#factFINAL assume true; 1021690#factEXIT >#70#return; 1020979#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1020980#factENTRY ~n := #in~n; 1022016#L25 assume ~n <= 0;#res := 1; 1020981#factFINAL assume true; 1020983#factEXIT >#72#return; 1021947#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; 1023711#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1023709#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1023708#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1023707#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; 1021942#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1023703#factENTRY ~n := #in~n; 1023701#L25 assume !(~n <= 0); 1023027#L26 call #t~ret0 := fact(~n - 1);< 1023700#factENTRY ~n := #in~n; 1023733#L25 assume !(~n <= 0); 1023025#L26 call #t~ret0 := fact(~n - 1);< 1023714#factENTRY ~n := #in~n; 1023725#L25 assume !(~n <= 0); 1023022#L26 call #t~ret0 := fact(~n - 1);< 1023723#factENTRY ~n := #in~n; 1023725#L25 assume !(~n <= 0); 1023022#L26 call #t~ret0 := fact(~n - 1);< 1023723#factENTRY ~n := #in~n; 1023727#L25 assume ~n <= 0;#res := 1; 1023726#factFINAL assume true; 1023722#factEXIT >#66#return; 1023720#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1023718#factFINAL assume true; 1023713#factEXIT >#66#return; 1023712#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1023710#factFINAL assume true; 1023704#factEXIT >#66#return; 1023702#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1023699#factFINAL assume true; 1023688#factEXIT >#66#return; 1023689#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1025719#factFINAL assume true; 1025618#factEXIT >#74#return; 1023337#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1023905#factENTRY ~n := #in~n; 1023903#L25 assume !(~n <= 0); 1023186#L26 call #t~ret0 := fact(~n - 1);< 1023197#factENTRY ~n := #in~n; 1023329#L25 assume !(~n <= 0); 1022854#L26 call #t~ret0 := fact(~n - 1);< 1023218#factENTRY ~n := #in~n; 1025478#L25 assume !(~n <= 0); 1022867#L26 call #t~ret0 := fact(~n - 1);< 1022899#factENTRY ~n := #in~n; 1022904#L25 assume !(~n <= 0); 1022898#L26 call #t~ret0 := fact(~n - 1);< 1022900#factENTRY ~n := #in~n; 1022906#L25 assume ~n <= 0;#res := 1; 1022905#factFINAL assume true; 1022897#factEXIT >#66#return; 1022895#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1022888#factFINAL assume true; 1022851#factEXIT >#66#return; 1022870#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1023336#factFINAL assume true; 1023214#factEXIT >#66#return; 1023212#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1023199#factFINAL assume true; 1023179#factEXIT >#66#return; 1023194#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1025699#factFINAL assume true; 1025700#factEXIT >#76#return; 1020795#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1023079#factENTRY ~n := #in~n; 1023077#L25 assume !(~n <= 0); 1023070#L26 call #t~ret0 := fact(~n - 1);< 1023072#factENTRY ~n := #in~n; 1023078#L25 assume ~n <= 0;#res := 1; 1023076#factFINAL assume true; 1023068#factEXIT >#66#return; 1023071#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1026262#factFINAL assume true; 1020793#factEXIT >#78#return; 1020797#L30-8 [2022-11-20 09:44:41,131 INFO L750 eck$LassoCheckResult]: Loop: 1020797#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; 1020857#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1020866#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1020906#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 1020878#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 1020868#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1020869#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1020900#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; 1022495#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1022501#factENTRY ~n := #in~n; 1025639#L25 assume !(~n <= 0); 1022615#L26 call #t~ret0 := fact(~n - 1);< 1022655#factENTRY ~n := #in~n; 1025640#L25 assume !(~n <= 0); 1022613#L26 call #t~ret0 := fact(~n - 1);< 1022669#factENTRY ~n := #in~n; 1025637#L25 assume !(~n <= 0); 1022612#L26 call #t~ret0 := fact(~n - 1);< 1022675#factENTRY ~n := #in~n; 1022977#L25 assume !(~n <= 0); 1022624#L26 call #t~ret0 := fact(~n - 1);< 1022684#factENTRY ~n := #in~n; 1022881#L25 assume !(~n <= 0); 1022622#L26 call #t~ret0 := fact(~n - 1);< 1022880#factENTRY ~n := #in~n; 1022883#L25 assume ~n <= 0;#res := 1; 1022882#factFINAL assume true; 1022879#factEXIT >#66#return; 1022878#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1022877#factFINAL assume true; 1022683#factEXIT >#66#return; 1022681#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1022679#factFINAL assume true; 1022674#factEXIT >#66#return; 1022672#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1022670#factFINAL assume true; 1022667#factEXIT >#66#return; 1022666#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1022665#factFINAL assume true; 1022658#factEXIT >#66#return; 1022659#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1023558#factFINAL assume true; 1023555#factEXIT >#68#return; 1022478#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1022491#factENTRY ~n := #in~n; 1022828#L25 assume ~n <= 0;#res := 1; 1022826#factFINAL assume true; 1022474#factEXIT >#70#return; 1022489#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1022644#factENTRY ~n := #in~n; 1022642#L25 assume !(~n <= 0); 1022636#L26 call #t~ret0 := fact(~n - 1);< 1022639#factENTRY ~n := #in~n; 1022647#L25 assume !(~n <= 0); 1021824#L26 call #t~ret0 := fact(~n - 1);< 1021850#factENTRY ~n := #in~n; 1021848#L25 assume !(~n <= 0); 1021750#L26 call #t~ret0 := fact(~n - 1);< 1021756#factENTRY ~n := #in~n; 1021917#L25 assume !(~n <= 0); 1021768#L26 call #t~ret0 := fact(~n - 1);< 1021783#factENTRY ~n := #in~n; 1024531#L25 assume !(~n <= 0); 1021807#L26 call #t~ret0 := fact(~n - 1);< 1021808#factENTRY ~n := #in~n; 1021813#L25 assume ~n <= 0;#res := 1; 1021812#factFINAL assume true; 1021806#factEXIT >#66#return; 1021804#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021782#factFINAL assume true; 1021765#factEXIT >#66#return; 1021769#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021822#factFINAL assume true; 1021749#factEXIT >#66#return; 1021755#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1022649#factFINAL assume true; 1022645#factEXIT >#66#return; 1022643#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1022641#factFINAL assume true; 1022635#factEXIT >#66#return; 1022638#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1023645#factFINAL assume true; 1023550#factEXIT >#72#return; 1023551#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; 1023775#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1023774#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1023772#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1023770#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; 1021436#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1021451#factENTRY ~n := #in~n; 1021483#L25 assume !(~n <= 0); 1021455#L26 call #t~ret0 := fact(~n - 1);< 1021464#factENTRY ~n := #in~n; 1021937#L25 assume !(~n <= 0); 1021489#L26 call #t~ret0 := fact(~n - 1);< 1021497#factENTRY ~n := #in~n; 1021613#L25 assume !(~n <= 0); 1021507#L26 call #t~ret0 := fact(~n - 1);< 1021515#factENTRY ~n := #in~n; 1023211#L25 assume !(~n <= 0); 1021192#L26 call #t~ret0 := fact(~n - 1);< 1021200#factENTRY ~n := #in~n; 1021199#L25 assume !(~n <= 0); 1021181#L26 call #t~ret0 := fact(~n - 1);< 1021193#factENTRY ~n := #in~n; 1021195#L25 assume ~n <= 0;#res := 1; 1021194#factFINAL assume true; 1021178#factEXIT >#66#return; 1021186#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021617#factFINAL assume true; 1021599#factEXIT >#66#return; 1021593#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021518#factFINAL assume true; 1021506#factEXIT >#66#return; 1021504#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021499#factFINAL assume true; 1021487#factEXIT >#66#return; 1021484#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021465#factFINAL assume true; 1021454#factEXIT >#66#return; 1021453#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021452#factFINAL assume true; 1021428#factEXIT >#68#return; 1021449#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1021889#factENTRY ~n := #in~n; 1021888#L25 assume !(~n <= 0); 1021720#L26 call #t~ret0 := fact(~n - 1);< 1021725#factENTRY ~n := #in~n; 1021264#L25 assume ~n <= 0;#res := 1; 1021866#factFINAL assume true; 1021719#factEXIT >#66#return; 1021723#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021909#factFINAL assume true; 1021892#factEXIT >#70#return; 1021615#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1021624#factENTRY ~n := #in~n; 1021623#L25 assume !(~n <= 0); 1021491#L26 call #t~ret0 := fact(~n - 1);< 1021497#factENTRY ~n := #in~n; 1021613#L25 assume !(~n <= 0); 1021507#L26 call #t~ret0 := fact(~n - 1);< 1021515#factENTRY ~n := #in~n; 1023211#L25 assume !(~n <= 0); 1021192#L26 call #t~ret0 := fact(~n - 1);< 1021200#factENTRY ~n := #in~n; 1021199#L25 assume !(~n <= 0); 1021181#L26 call #t~ret0 := fact(~n - 1);< 1021193#factENTRY ~n := #in~n; 1021195#L25 assume ~n <= 0;#res := 1; 1021194#factFINAL assume true; 1021178#factEXIT >#66#return; 1021186#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021617#factFINAL assume true; 1021599#factEXIT >#66#return; 1021593#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021518#factFINAL assume true; 1021506#factEXIT >#66#return; 1021504#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021499#factFINAL assume true; 1021487#factEXIT >#66#return; 1021492#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1023351#factFINAL assume true; 1023115#factEXIT >#72#return; 1023124#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; 1025466#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1025465#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1025464#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1025463#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; 1021441#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1021451#factENTRY ~n := #in~n; 1021483#L25 assume !(~n <= 0); 1021455#L26 call #t~ret0 := fact(~n - 1);< 1021464#factENTRY ~n := #in~n; 1021937#L25 assume !(~n <= 0); 1021489#L26 call #t~ret0 := fact(~n - 1);< 1021497#factENTRY ~n := #in~n; 1021613#L25 assume !(~n <= 0); 1021507#L26 call #t~ret0 := fact(~n - 1);< 1021515#factENTRY ~n := #in~n; 1023211#L25 assume !(~n <= 0); 1021192#L26 call #t~ret0 := fact(~n - 1);< 1021200#factENTRY ~n := #in~n; 1021199#L25 assume !(~n <= 0); 1021181#L26 call #t~ret0 := fact(~n - 1);< 1021193#factENTRY ~n := #in~n; 1021195#L25 assume ~n <= 0;#res := 1; 1021194#factFINAL assume true; 1021178#factEXIT >#66#return; 1021186#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021617#factFINAL assume true; 1021599#factEXIT >#66#return; 1021593#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021518#factFINAL assume true; 1021506#factEXIT >#66#return; 1021504#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021499#factFINAL assume true; 1021487#factEXIT >#66#return; 1021484#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021465#factFINAL assume true; 1021454#factEXIT >#66#return; 1021453#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021452#factFINAL assume true; 1021428#factEXIT >#68#return; 1021369#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1021399#factENTRY ~n := #in~n; 1021395#L25 assume !(~n <= 0); 1021225#L26 call #t~ret0 := fact(~n - 1);< 1021254#factENTRY ~n := #in~n; 1021251#L25 assume !(~n <= 0); 1021179#L26 call #t~ret0 := fact(~n - 1);< 1021220#factENTRY ~n := #in~n; 1021195#L25 assume ~n <= 0;#res := 1; 1021194#factFINAL assume true; 1021178#factEXIT >#66#return; 1021186#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021617#factFINAL assume true; 1021599#factEXIT >#66#return; 1021603#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1022663#factFINAL assume true; 1022404#factEXIT >#70#return; 1021528#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1021607#factENTRY ~n := #in~n; 1021595#L25 assume !(~n <= 0); 1021490#L26 call #t~ret0 := fact(~n - 1);< 1021516#factENTRY ~n := #in~n; 1021606#L25 assume !(~n <= 0); 1021202#L26 call #t~ret0 := fact(~n - 1);< 1021208#factENTRY ~n := #in~n; 1021206#L25 assume !(~n <= 0); 1021180#L26 call #t~ret0 := fact(~n - 1);< 1021198#factENTRY ~n := #in~n; 1021195#L25 assume ~n <= 0;#res := 1; 1021194#factFINAL assume true; 1021178#factEXIT >#66#return; 1021186#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021617#factFINAL assume true; 1021599#factEXIT >#66#return; 1021593#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021518#factFINAL assume true; 1021506#factEXIT >#66#return; 1021509#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1022648#factFINAL assume true; 1022363#factEXIT >#72#return; 1022375#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; 1023683#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1023681#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1023679#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1023677#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; 1021447#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1021451#factENTRY ~n := #in~n; 1021483#L25 assume !(~n <= 0); 1021455#L26 call #t~ret0 := fact(~n - 1);< 1021464#factENTRY ~n := #in~n; 1021937#L25 assume !(~n <= 0); 1021489#L26 call #t~ret0 := fact(~n - 1);< 1021497#factENTRY ~n := #in~n; 1021613#L25 assume !(~n <= 0); 1021507#L26 call #t~ret0 := fact(~n - 1);< 1021515#factENTRY ~n := #in~n; 1023211#L25 assume !(~n <= 0); 1021192#L26 call #t~ret0 := fact(~n - 1);< 1021200#factENTRY ~n := #in~n; 1021199#L25 assume !(~n <= 0); 1021181#L26 call #t~ret0 := fact(~n - 1);< 1021193#factENTRY ~n := #in~n; 1021195#L25 assume ~n <= 0;#res := 1; 1021194#factFINAL assume true; 1021178#factEXIT >#66#return; 1021186#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021617#factFINAL assume true; 1021599#factEXIT >#66#return; 1021593#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021518#factFINAL assume true; 1021506#factEXIT >#66#return; 1021504#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021499#factFINAL assume true; 1021487#factEXIT >#66#return; 1021484#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021465#factFINAL assume true; 1021454#factEXIT >#66#return; 1021453#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021452#factFINAL assume true; 1021428#factEXIT >#68#return; 1021359#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1021399#factENTRY ~n := #in~n; 1021395#L25 assume !(~n <= 0); 1021225#L26 call #t~ret0 := fact(~n - 1);< 1021254#factENTRY ~n := #in~n; 1021251#L25 assume !(~n <= 0); 1021179#L26 call #t~ret0 := fact(~n - 1);< 1021220#factENTRY ~n := #in~n; 1021217#L25 assume !(~n <= 0); 1021185#L26 call #t~ret0 := fact(~n - 1);< 1021209#factENTRY ~n := #in~n; 1021195#L25 assume ~n <= 0;#res := 1; 1021194#factFINAL assume true; 1021178#factEXIT >#66#return; 1021186#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021617#factFINAL assume true; 1021599#factEXIT >#66#return; 1021593#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021518#factFINAL assume true; 1021506#factEXIT >#66#return; 1021512#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1022532#factFINAL assume true; 1022531#factEXIT >#70#return; 1021299#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1021424#factENTRY ~n := #in~n; 1021421#L25 assume !(~n <= 0); 1021212#L26 call #t~ret0 := fact(~n - 1);< 1021316#factENTRY ~n := #in~n; 1021217#L25 assume !(~n <= 0); 1021185#L26 call #t~ret0 := fact(~n - 1);< 1021209#factENTRY ~n := #in~n; 1021195#L25 assume ~n <= 0;#res := 1; 1021194#factFINAL assume true; 1021178#factEXIT >#66#return; 1021186#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021617#factFINAL assume true; 1021599#factEXIT >#66#return; 1021602#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1022542#factFINAL assume true; 1022282#factEXIT >#72#return; 1022331#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; 1023665#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1023662#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1023661#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1023660#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; 1021437#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1021451#factENTRY ~n := #in~n; 1021483#L25 assume !(~n <= 0); 1021455#L26 call #t~ret0 := fact(~n - 1);< 1021464#factENTRY ~n := #in~n; 1021937#L25 assume !(~n <= 0); 1021489#L26 call #t~ret0 := fact(~n - 1);< 1021497#factENTRY ~n := #in~n; 1021613#L25 assume !(~n <= 0); 1021507#L26 call #t~ret0 := fact(~n - 1);< 1021515#factENTRY ~n := #in~n; 1023211#L25 assume !(~n <= 0); 1021192#L26 call #t~ret0 := fact(~n - 1);< 1021200#factENTRY ~n := #in~n; 1021199#L25 assume !(~n <= 0); 1021181#L26 call #t~ret0 := fact(~n - 1);< 1021193#factENTRY ~n := #in~n; 1021195#L25 assume ~n <= 0;#res := 1; 1021194#factFINAL assume true; 1021178#factEXIT >#66#return; 1021186#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021617#factFINAL assume true; 1021599#factEXIT >#66#return; 1021593#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021518#factFINAL assume true; 1021506#factEXIT >#66#return; 1021504#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021499#factFINAL assume true; 1021487#factEXIT >#66#return; 1021484#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021465#factFINAL assume true; 1021454#factEXIT >#66#return; 1021453#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021452#factFINAL assume true; 1021428#factEXIT >#68#return; 1021360#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1021399#factENTRY ~n := #in~n; 1021395#L25 assume !(~n <= 0); 1021225#L26 call #t~ret0 := fact(~n - 1);< 1021254#factENTRY ~n := #in~n; 1021251#L25 assume !(~n <= 0); 1021179#L26 call #t~ret0 := fact(~n - 1);< 1021220#factENTRY ~n := #in~n; 1021217#L25 assume !(~n <= 0); 1021185#L26 call #t~ret0 := fact(~n - 1);< 1021209#factENTRY ~n := #in~n; 1021206#L25 assume !(~n <= 0); 1021180#L26 call #t~ret0 := fact(~n - 1);< 1021198#factENTRY ~n := #in~n; 1021195#L25 assume ~n <= 0;#res := 1; 1021194#factFINAL assume true; 1021178#factEXIT >#66#return; 1021186#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021617#factFINAL assume true; 1021599#factEXIT >#66#return; 1021593#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021518#factFINAL assume true; 1021506#factEXIT >#66#return; 1021504#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021499#factFINAL assume true; 1021487#factEXIT >#66#return; 1021494#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1022269#factFINAL assume true; 1022267#factEXIT >#70#return; 1021309#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1021424#factENTRY ~n := #in~n; 1021421#L25 assume !(~n <= 0); 1021212#L26 call #t~ret0 := fact(~n - 1);< 1021316#factENTRY ~n := #in~n; 1021264#L25 assume ~n <= 0;#res := 1; 1021866#factFINAL assume true; 1021719#factEXIT >#66#return; 1021722#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1022273#factFINAL assume true; 1022187#factEXIT >#72#return; 1022205#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; 1023639#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1023637#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1023629#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1023627#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; 1021433#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1021451#factENTRY ~n := #in~n; 1021483#L25 assume !(~n <= 0); 1021455#L26 call #t~ret0 := fact(~n - 1);< 1021464#factENTRY ~n := #in~n; 1021937#L25 assume !(~n <= 0); 1021489#L26 call #t~ret0 := fact(~n - 1);< 1021497#factENTRY ~n := #in~n; 1021613#L25 assume !(~n <= 0); 1021507#L26 call #t~ret0 := fact(~n - 1);< 1021515#factENTRY ~n := #in~n; 1023211#L25 assume !(~n <= 0); 1021192#L26 call #t~ret0 := fact(~n - 1);< 1021200#factENTRY ~n := #in~n; 1021199#L25 assume !(~n <= 0); 1021181#L26 call #t~ret0 := fact(~n - 1);< 1021193#factENTRY ~n := #in~n; 1021195#L25 assume ~n <= 0;#res := 1; 1021194#factFINAL assume true; 1021178#factEXIT >#66#return; 1021186#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021617#factFINAL assume true; 1021599#factEXIT >#66#return; 1021593#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021518#factFINAL assume true; 1021506#factEXIT >#66#return; 1021504#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021499#factFINAL assume true; 1021487#factEXIT >#66#return; 1021484#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021465#factFINAL assume true; 1021454#factEXIT >#66#return; 1021453#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021452#factFINAL assume true; 1021428#factEXIT >#68#return; 1021362#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1021399#factENTRY ~n := #in~n; 1021395#L25 assume !(~n <= 0); 1021225#L26 call #t~ret0 := fact(~n - 1);< 1021254#factENTRY ~n := #in~n; 1021251#L25 assume !(~n <= 0); 1021179#L26 call #t~ret0 := fact(~n - 1);< 1021220#factENTRY ~n := #in~n; 1021217#L25 assume !(~n <= 0); 1021185#L26 call #t~ret0 := fact(~n - 1);< 1021209#factENTRY ~n := #in~n; 1021206#L25 assume !(~n <= 0); 1021180#L26 call #t~ret0 := fact(~n - 1);< 1021198#factENTRY ~n := #in~n; 1021199#L25 assume !(~n <= 0); 1021181#L26 call #t~ret0 := fact(~n - 1);< 1021193#factENTRY ~n := #in~n; 1021195#L25 assume ~n <= 0;#res := 1; 1021194#factFINAL assume true; 1021178#factEXIT >#66#return; 1021186#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021617#factFINAL assume true; 1021599#factEXIT >#66#return; 1021593#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021518#factFINAL assume true; 1021506#factEXIT >#66#return; 1021504#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021499#factFINAL assume true; 1021487#factEXIT >#66#return; 1021484#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1021465#factFINAL assume true; 1021454#factEXIT >#66#return; 1021463#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1022018#factFINAL assume true; 1021999#factEXIT >#70#return; 1020926#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1020984#factENTRY ~n := #in~n; 1020985#L25 assume ~n <= 0;#res := 1; 1020986#factFINAL assume true; 1020911#factEXIT >#72#return; 1020978#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; 1023482#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1023380#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1023377#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1023373#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; 1021933#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1023368#factENTRY ~n := #in~n; 1023127#L25 assume !(~n <= 0); 1023026#L26 call #t~ret0 := fact(~n - 1);< 1023043#factENTRY ~n := #in~n; 1025652#L25 assume !(~n <= 0); 1023023#L26 call #t~ret0 := fact(~n - 1);< 1023050#factENTRY ~n := #in~n; 1023759#L25 assume !(~n <= 0); 1023018#L26 call #t~ret0 := fact(~n - 1);< 1023690#factENTRY ~n := #in~n; 1023733#L25 assume !(~n <= 0); 1023025#L26 call #t~ret0 := fact(~n - 1);< 1023714#factENTRY ~n := #in~n; 1023725#L25 assume !(~n <= 0); 1023022#L26 call #t~ret0 := fact(~n - 1);< 1023723#factENTRY ~n := #in~n; 1023725#L25 assume !(~n <= 0); 1023022#L26 call #t~ret0 := fact(~n - 1);< 1023723#factENTRY ~n := #in~n; 1023727#L25 assume ~n <= 0;#res := 1; 1023726#factFINAL assume true; 1023722#factEXIT >#66#return; 1023720#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1023718#factFINAL assume true; 1023713#factEXIT >#66#return; 1023712#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1023710#factFINAL assume true; 1023704#factEXIT >#66#return; 1023702#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1023699#factFINAL assume true; 1023688#factEXIT >#66#return; 1023156#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1023055#factFINAL assume true; 1023048#factEXIT >#66#return; 1023046#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1023042#factFINAL assume true; 1023040#factEXIT >#66#return; 1023041#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1023507#factFINAL assume true; 1023463#factEXIT >#74#return; 1022821#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1022824#factENTRY ~n := #in~n; 1023514#L25 assume !(~n <= 0); 1023270#L26 call #t~ret0 := fact(~n - 1);< 1023274#factENTRY ~n := #in~n; 1023272#L25 assume !(~n <= 0); 1023188#L26 call #t~ret0 := fact(~n - 1);< 1023267#factENTRY ~n := #in~n; 1023266#L25 assume !(~n <= 0); 1023215#L26 call #t~ret0 := fact(~n - 1);< 1023220#factENTRY ~n := #in~n; 1023345#L25 assume !(~n <= 0); 1022858#L26 call #t~ret0 := fact(~n - 1);< 1022892#factENTRY ~n := #in~n; 1022904#L25 assume !(~n <= 0); 1022898#L26 call #t~ret0 := fact(~n - 1);< 1022900#factENTRY ~n := #in~n; 1022906#L25 assume ~n <= 0;#res := 1; 1022905#factFINAL assume true; 1022897#factEXIT >#66#return; 1022895#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1022888#factFINAL assume true; 1022851#factEXIT >#66#return; 1022870#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1023336#factFINAL assume true; 1023214#factEXIT >#66#return; 1023212#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1023199#factFINAL assume true; 1023179#factEXIT >#66#return; 1023190#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1023520#factFINAL assume true; 1023509#factEXIT >#66#return; 1023508#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1023461#factFINAL assume true; 1022820#factEXIT >#76#return; 1022603#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1022607#factENTRY ~n := #in~n; 1023074#L25 assume !(~n <= 0); 1023069#L26 call #t~ret0 := fact(~n - 1);< 1023072#factENTRY ~n := #in~n; 1023078#L25 assume ~n <= 0;#res := 1; 1023076#factFINAL assume true; 1023068#factEXIT >#66#return; 1023066#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1022978#factFINAL assume true; 1022600#factEXIT >#78#return; 1020797#L30-8 [2022-11-20 09:44:41,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:44:41,133 INFO L85 PathProgramCache]: Analyzing trace with hash 291195713, now seen corresponding path program 55 times [2022-11-20 09:44:41,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:44:41,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949879607] [2022-11-20 09:44:41,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:44:41,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:44:41,164 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:44:41,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1082573135] [2022-11-20 09:44:41,165 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 09:44:41,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:44:41,165 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:44:41,167 INFO L229 MonitoredProcess]: Starting monitored process 373 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:44:41,169 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (373)] Waiting until timeout for monitored process [2022-11-20 09:44:42,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:44:42,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 1807 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-20 09:44:42,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:44:42,468 INFO L134 CoverageAnalysis]: Checked inductivity of 38477 backedges. 8764 proven. 13 refuted. 0 times theorem prover too weak. 29700 trivial. 0 not checked. [2022-11-20 09:44:42,468 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:44:43,610 INFO L134 CoverageAnalysis]: Checked inductivity of 38477 backedges. 1630 proven. 170 refuted. 0 times theorem prover too weak. 36677 trivial. 0 not checked. [2022-11-20 09:44:43,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:44:43,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949879607] [2022-11-20 09:44:43,611 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 09:44:43,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082573135] [2022-11-20 09:44:43,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082573135] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:44:43,611 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:44:43,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 14 [2022-11-20 09:44:43,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194394003] [2022-11-20 09:44:43,612 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:44:43,612 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-20 09:44:43,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:44:43,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1073397405, now seen corresponding path program 50 times [2022-11-20 09:44:43,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:44:43,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130753326] [2022-11-20 09:44:43,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:44:43,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:44:43,631 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:44:43,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [936700395] [2022-11-20 09:44:43,632 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 09:44:43,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:44:43,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:44:43,635 INFO L229 MonitoredProcess]: Starting monitored process 374 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:44:43,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06c69b22-47c3-4245-a814-c0ccbd726c72/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (374)] Waiting until timeout for monitored process [2022-11-20 09:44:46,848 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 09:44:46,848 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-20 09:44:46,848 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:45:00,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:45:00,729 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace